1 /* 2 * Copyright (c) 1988 University of Utah. 3 * Copyright (c) 1992 The Regents of the University of California. 4 * All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * the Systems Programming Group of the University of Utah Computer 8 * Science Department and Ralph Campbell. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * from: Utah Hdr: vmparam.h 1.16 91/01/18 39 * from: @(#)vmparam.h 7.2 (Berkeley) 2/4/93 40 * $Id: vmparam.h,v 1.1.1.1 1993/10/12 03:22:42 deraadt Exp $ 41 */ 42 43 /* 44 * Machine dependent constants for DEC Station 3100. 45 */ 46 /* 47 * USRTEXT is the start of the user text/data space, while USRSTACK 48 * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are 49 * the number of pages from the beginning of the P0 region to the 50 * beginning of the text and from the beginning of the P1 region to the 51 * beginning of the stack respectively. 52 */ 53 #define USRTEXT 0x00400000 54 #define USRDATA 0x10000000 55 #define USRSTACK 0x80000000 /* Start of user stack */ 56 #define BTOPUSRSTACK 0x80000 /* btop(USRSTACK) */ 57 #define LOWPAGES 0x00400 58 #define MIDPAGES 0x10000 59 #define HIGHPAGES 0 60 61 /* 62 * Virtual memory related constants, all in bytes 63 */ 64 #ifndef MAXTSIZ 65 #define MAXTSIZ (24*1024*1024) /* max text size */ 66 #endif 67 #ifndef DFLDSIZ 68 #define DFLDSIZ (32*1024*1024) /* initial data size limit */ 69 #endif 70 #ifndef MAXDSIZ 71 #define MAXDSIZ (32*1024*1024) /* max data size */ 72 #endif 73 #ifndef DFLSSIZ 74 #define DFLSSIZ (1024*1024) /* initial stack size limit */ 75 #endif 76 #ifndef MAXSSIZ 77 #define MAXSSIZ MAXDSIZ /* max stack size */ 78 #endif 79 80 /* 81 * Default sizes of swap allocation chunks (see dmap.h). 82 * The actual values may be changed in vminit() based on MAXDSIZ. 83 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 84 * DMMIN should be at least ctod(1) so that vtod() works. 85 * vminit() insures this. 86 */ 87 #define DMMIN 32 /* smallest swap allocation */ 88 #define DMMAX 4096 /* largest potential swap allocation */ 89 90 /* 91 * Sizes of the system and user portions of the system page table. 92 */ 93 /* SYSPTSIZE IS SILLY; (really number of buffers for I/O) */ 94 #define SYSPTSIZE 1228 95 #define USRPTSIZE 1024 96 97 /* 98 * PTEs for mapping user space into the kernel for phyio operations. 99 * 16 pte's are enough to cover 8 disks * MAXBSIZE. 100 */ 101 #ifndef USRIOSIZE 102 #define USRIOSIZE 32 103 #endif 104 105 /* 106 * PTEs for system V style shared memory. 107 * This is basically slop for kmempt which we actually allocate (malloc) from. 108 */ 109 #ifndef SHMMAXPGS 110 #define SHMMAXPGS 1024 /* 4mb */ 111 #endif 112 113 /* 114 * Boundary at which to place first MAPMEM segment if not explicitly 115 * specified. Should be a power of two. This allows some slop for 116 * the data segment to grow underneath the first mapped segment. 117 */ 118 #define MMSEG 0x200000 119 120 /* 121 * The size of the clock loop. 122 */ 123 #define LOOPPAGES (maxfree - firstfree) 124 125 /* 126 * The time for a process to be blocked before being very swappable. 127 * This is a number of seconds which the system takes as being a non-trivial 128 * amount of real time. You probably shouldn't change this; 129 * it is used in subtle ways (fractions and multiples of it are, that is, like 130 * half of a ``long time'', almost a long time, etc.) 131 * It is related to human patience and other factors which don't really 132 * change over time. 133 */ 134 #define MAXSLP 20 135 136 /* 137 * A swapped in process is given a small amount of core without being bothered 138 * by the page replacement algorithm. Basically this says that if you are 139 * swapped in you deserve some resources. We protect the last SAFERSS 140 * pages against paging and will just swap you out rather than paging you. 141 * Note that each process has at least UPAGES+CLSIZE pages which are not 142 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 143 * number just means a swapped in process is given around 25k bytes. 144 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 145 * so we loan each swapped in process memory worth 100$, or just admit 146 * that we don't consider it worthwhile and swap it out to disk which costs 147 * $30/mb or about $0.75. 148 */ 149 #define SAFERSS 4 /* nominal ``small'' resident set size 150 protected against replacement */ 151 152 /* 153 * DISKRPM is used to estimate the number of paging i/o operations 154 * which one can expect from a single disk controller. 155 */ 156 #define DISKRPM 60 157 158 /* 159 * Klustering constants. Klustering is the gathering 160 * of pages together for pagein/pageout, while clustering 161 * is the treatment of hardware page size as though it were 162 * larger than it really is. 163 * 164 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 165 * units. Note that ctod(KLMAX*CLSIZE) must be <= DMMIN in dmap.h. 166 * ctob(KLMAX) should also be less than MAXPHYS (in vm_swp.c) 167 * unless you like "big push" panics. 168 */ 169 170 #ifdef notdef /* XXX */ 171 #define KLMAX (4/CLSIZE) 172 #define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 173 #define KLIN (4/CLSIZE) /* default data/stack in klust */ 174 #define KLTXT (4/CLSIZE) /* default text in klust */ 175 #define KLOUT (4/CLSIZE) 176 #else 177 #define KLMAX (1/CLSIZE) 178 #define KLSEQL (1/CLSIZE) 179 #define KLIN (1/CLSIZE) 180 #define KLTXT (1/CLSIZE) 181 #define KLOUT (1/CLSIZE) 182 #endif 183 184 /* 185 * KLSDIST is the advance or retard of the fifo reclaim for sequential 186 * processes data space. 187 */ 188 #define KLSDIST 3 /* klusters advance/retard for seq. fifo */ 189 190 /* 191 * Paging thresholds (see vm_sched.c). 192 * Strategy of 1/19/85: 193 * lotsfree is 512k bytes, but at most 1/4 of memory 194 * desfree is 200k bytes, but at most 1/8 of memory 195 * minfree is 64k bytes, but at most 1/2 of desfree 196 */ 197 #define LOTSFREE (512 * 1024) 198 #define LOTSFREEFRACT 4 199 #define DESFREE (200 * 1024) 200 #define DESFREEFRACT 8 201 #define MINFREE (64 * 1024) 202 #define MINFREEFRACT 2 203 204 /* 205 * There are two clock hands, initially separated by HANDSPREAD bytes 206 * (but at most all of user memory). The amount of time to reclaim 207 * a page once the pageout process examines it increases with this 208 * distance and decreases as the scan rate rises. 209 */ 210 #define HANDSPREAD (2 * 1024 * 1024) 211 212 /* 213 * The number of times per second to recompute the desired paging rate 214 * and poke the pagedaemon. 215 */ 216 #define RATETOSCHEDPAGING 4 217 218 /* 219 * Believed threshold (in megabytes) for which interleaved 220 * swapping area is desirable. 221 */ 222 #define LOTSOFMEM 2 223 224 #define mapin(pte, v, pfnum, prot) \ 225 (*(int *)(pte) = ((pfnum) << PG_SHIFT) | (prot), MachTLBFlushAddr(v)) 226 227 /* 228 * Mach derived constants 229 */ 230 231 /* user/kernel map constants */ 232 #define VM_MIN_ADDRESS ((vm_offset_t)0x1000) 233 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x80000000) 234 #define VM_MAX_ADDRESS ((vm_offset_t)0x80000000) 235 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0xC0000000) 236 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xFFFFC000) 237 238 /* virtual sizes (bytes) for various kernel submaps */ 239 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 240 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 241 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 242 243 /* pcb base */ 244 #define pcbb(p) ((u_int)(p)->p_addr) 245