vmparam.h revision 1.10 1 1.1 cgd /*-
2 1.1 cgd * Copyright (c) 1990 The Regents of the University of California.
3 1.1 cgd * All rights reserved.
4 1.1 cgd *
5 1.1 cgd * This code is derived from software contributed to Berkeley by
6 1.1 cgd * William Jolitz.
7 1.1 cgd *
8 1.1 cgd * Redistribution and use in source and binary forms, with or without
9 1.1 cgd * modification, are permitted provided that the following conditions
10 1.1 cgd * are met:
11 1.1 cgd * 1. Redistributions of source code must retain the above copyright
12 1.1 cgd * notice, this list of conditions and the following disclaimer.
13 1.1 cgd * 2. Redistributions in binary form must reproduce the above copyright
14 1.1 cgd * notice, this list of conditions and the following disclaimer in the
15 1.1 cgd * documentation and/or other materials provided with the distribution.
16 1.1 cgd * 3. All advertising materials mentioning features or use of this software
17 1.1 cgd * must display the following acknowledgement:
18 1.1 cgd * This product includes software developed by the University of
19 1.1 cgd * California, Berkeley and its contributors.
20 1.1 cgd * 4. Neither the name of the University nor the names of its contributors
21 1.1 cgd * may be used to endorse or promote products derived from this software
22 1.1 cgd * without specific prior written permission.
23 1.1 cgd *
24 1.1 cgd * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25 1.1 cgd * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26 1.1 cgd * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27 1.1 cgd * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28 1.1 cgd * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29 1.1 cgd * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30 1.1 cgd * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31 1.1 cgd * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32 1.1 cgd * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33 1.1 cgd * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 1.1 cgd * SUCH DAMAGE.
35 1.1 cgd *
36 1.2 cgd * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91
37 1.10 cgd * $Id: vmparam.h,v 1.10 1993/12/22 12:30:59 cgd Exp $
38 1.1 cgd */
39 1.1 cgd
40 1.1 cgd
41 1.1 cgd /*
42 1.1 cgd * Machine dependent constants for 386.
43 1.1 cgd */
44 1.1 cgd
45 1.1 cgd /*
46 1.1 cgd * Virtual address space arrangement. On 386, both user and kernel
47 1.1 cgd * share the address space, not unlike the vax.
48 1.1 cgd * USRTEXT is the start of the user text/data space, while USRSTACK
49 1.1 cgd * is the top (end) of the user stack. Immediately above the user stack
50 1.1 cgd * resides the user structure, which is UPAGES long and contains the
51 1.1 cgd * kernel stack.
52 1.1 cgd *
53 1.1 cgd * Immediately after the user structure is the page table map, and then
54 1.1 cgd * kernal address space.
55 1.1 cgd */
56 1.9 mycroft #define USRTEXT CLBYTES
57 1.9 mycroft #define USRSTACK VM_MAXUSER_ADDRESS
58 1.1 cgd
59 1.1 cgd /*
60 1.1 cgd * Virtual memory related constants, all in bytes
61 1.1 cgd */
62 1.9 mycroft #define MAXTSIZ (8*1024*1024) /* max text size */
63 1.1 cgd #ifndef DFLDSIZ
64 1.4 cgd #define DFLDSIZ (16*1024*1024) /* initial data size limit */
65 1.1 cgd #endif
66 1.1 cgd #ifndef MAXDSIZ
67 1.9 mycroft #define MAXDSIZ (256*1024*1024) /* max data size */
68 1.1 cgd #endif
69 1.1 cgd #ifndef DFLSSIZ
70 1.1 cgd #define DFLSSIZ (512*1024) /* initial stack size limit */
71 1.1 cgd #endif
72 1.1 cgd #ifndef MAXSSIZ
73 1.10 cgd #define MAXSSIZ (8*1024*1024) /* max stack size */
74 1.1 cgd #endif
75 1.1 cgd
76 1.1 cgd /*
77 1.1 cgd * Default sizes of swap allocation chunks (see dmap.h).
78 1.1 cgd * The actual values may be changed in vminit() based on MAXDSIZ.
79 1.1 cgd * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024.
80 1.1 cgd */
81 1.1 cgd #define DMMIN 32 /* smallest swap allocation */
82 1.1 cgd #define DMMAX 4096 /* largest potential swap allocation */
83 1.1 cgd #define DMTEXT 1024 /* swap allocation for text */
84 1.7 cgd
85 1.9 mycroft /*
86 1.7 cgd * Size of shared memory map
87 1.7 cgd */
88 1.7 cgd #ifndef SHMMAXPGS
89 1.8 cgd #define SHMMAXPGS 64 /* XXXX should be 1024 */
90 1.7 cgd #endif
91 1.1 cgd
92 1.1 cgd /*
93 1.1 cgd * Size of User Raw I/O map
94 1.1 cgd */
95 1.1 cgd #define USRIOSIZE 300
96 1.1 cgd
97 1.1 cgd /*
98 1.1 cgd * The time for a process to be blocked before being very swappable.
99 1.1 cgd * This is a number of seconds which the system takes as being a non-trivial
100 1.1 cgd * amount of real time. You probably shouldn't change this;
101 1.1 cgd * it is used in subtle ways (fractions and multiples of it are, that is, like
102 1.1 cgd * half of a ``long time'', almost a long time, etc.)
103 1.1 cgd * It is related to human patience and other factors which don't really
104 1.1 cgd * change over time.
105 1.1 cgd */
106 1.1 cgd #define MAXSLP 20
107 1.1 cgd
108 1.1 cgd /*
109 1.1 cgd * A swapped in process is given a small amount of core without being bothered
110 1.1 cgd * by the page replacement algorithm. Basically this says that if you are
111 1.1 cgd * swapped in you deserve some resources. We protect the last SAFERSS
112 1.1 cgd * pages against paging and will just swap you out rather than paging you.
113 1.1 cgd * Note that each process has at least UPAGES+CLSIZE pages which are not
114 1.1 cgd * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
115 1.1 cgd * number just means a swapped in process is given around 25k bytes.
116 1.1 cgd * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
117 1.1 cgd * so we loan each swapped in process memory worth 100$, or just admit
118 1.1 cgd * that we don't consider it worthwhile and swap it out to disk which costs
119 1.1 cgd * $30/mb or about $0.75.
120 1.1 cgd * { wfj 6/16/89: Retail AT memory expansion $800/megabyte, loan of $17
121 1.1 cgd * on disk costing $7/mb or $0.18 (in memory still 100:1 in cost!) }
122 1.1 cgd */
123 1.1 cgd #define SAFERSS 8 /* nominal ``small'' resident set size
124 1.1 cgd protected against replacement */
125 1.1 cgd
126 1.1 cgd /*
127 1.1 cgd * Mach derived constants
128 1.1 cgd */
129 1.1 cgd
130 1.1 cgd /* user/kernel map constants */
131 1.1 cgd #define VM_MIN_ADDRESS ((vm_offset_t)0)
132 1.1 cgd #define VM_MAXUSER_ADDRESS ((vm_offset_t)0xFDBFE000)
133 1.1 cgd #define UPT_MIN_ADDRESS ((vm_offset_t)0xFDC00000)
134 1.1 cgd #define UPT_MAX_ADDRESS ((vm_offset_t)0xFDFF7000)
135 1.1 cgd #define VM_MAX_ADDRESS UPT_MAX_ADDRESS
136 1.1 cgd #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0xFDFF7000)
137 1.1 cgd #define KPT_MIN_ADDRESS ((vm_offset_t)0xFDFF8000)
138 1.1 cgd #define KPT_MAX_ADDRESS ((vm_offset_t)0xFDFFF000)
139 1.1 cgd #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xFF7FF000)
140 1.1 cgd
141 1.1 cgd /* virtual sizes (bytes) for various kernel submaps */
142 1.1 cgd #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES)
143 1.1 cgd #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES)
144 1.1 cgd #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES)
145 1.1 cgd
146 1.1 cgd /*
147 1.1 cgd * Flush MMU TLB
148 1.1 cgd */
149 1.1 cgd
150 1.1 cgd #ifndef I386_CR3PAT
151 1.1 cgd #define I386_CR3PAT 0x0
152 1.1 cgd #endif
153 1.1 cgd
154 1.1 cgd #ifdef notyet
155 1.1 cgd #define _cr3() ({u_long rtn; \
156 1.1 cgd asm (" movl %%cr3,%%eax; movl %%eax,%0 " \
157 1.1 cgd : "=g" (rtn) \
158 1.1 cgd : \
159 1.1 cgd : "ax"); \
160 1.1 cgd rtn; \
161 1.1 cgd })
162 1.1 cgd
163 1.1 cgd #define load_cr3(s) ({ u_long val; \
164 1.1 cgd val = (s) | I386_CR3PAT; \
165 1.1 cgd asm ("movl %0,%%eax; movl %%eax,%%cr3" \
166 1.1 cgd : \
167 1.1 cgd : "g" (val) \
168 1.1 cgd : "ax"); \
169 1.1 cgd })
170 1.1 cgd
171 1.1 cgd #define tlbflush() ({ u_long val; \
172 1.1 cgd val = u.u_pcb.pcb_ptd | I386_CR3PAT; \
173 1.1 cgd asm ("movl %0,%%eax; movl %%eax,%%cr3" \
174 1.1 cgd : \
175 1.1 cgd : "g" (val) \
176 1.1 cgd : "ax"); \
177 1.1 cgd })
178 1.1 cgd #endif
179