1 /* $NetBSD: vmparam.h,v 1.6 1994/10/26 08:46:52 cgd Exp $ */ 2 3 /* 4 * Copyright (c) 1988 University of Utah. 5 * Copyright (c) 1982, 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 /*- 41 * Copyright (C) 1993 Allen K. Briggs, Chris P. Caputo, 42 * Michael L. Finch, Bradley A. Grantham, and 43 * Lawrence A. Kesteloot 44 * All rights reserved. 45 * 46 * Redistribution and use in source and binary forms, with or without 47 * modification, are permitted provided that the following conditions 48 * are met: 49 * 1. Redistributions of source code must retain the above copyright 50 * notice, this list of conditions and the following disclaimer. 51 * 2. Redistributions in binary form must reproduce the above copyright 52 * notice, this list of conditions and the following disclaimer in the 53 * documentation and/or other materials provided with the distribution. 54 * 3. All advertising materials mentioning features or use of this software 55 * must display the following acknowledgement: 56 * This product includes software developed by the Alice Group. 57 * 4. The names of the Alice Group or any of its members may not be used 58 * to endorse or promote products derived from this software without 59 * specific prior written permission. 60 * 61 * THIS SOFTWARE IS PROVIDED BY THE ALICE GROUP ``AS IS'' AND ANY EXPRESS OR 62 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 63 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 64 * IN NO EVENT SHALL THE ALICE GROUP BE LIABLE FOR ANY DIRECT, INDIRECT, 65 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 66 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 67 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 68 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 69 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 70 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 71 * 72 */ 73 /* 74 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$ 75 * 76 * @(#)vmparam.h 7.3 (Berkeley) 5/7/91 77 */ 78 79 /* 80 * Machine dependent constants for HP300 81 ALICE 82 BG -- Sat May 23 23:45:21 EDT 1992 83 You'd like to think that, wouldn't you? Well it's NOT an hp300! 84 It's a mac68k! And therefore I am changing it. 85 */ 86 87 /* 88 * USRTEXT is the start of the user text/data space, while USRSTACK 89 * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are 90 * the number of pages from the beginning of the P0 region to the 91 * beginning of the text and from the beginning of the P1 region to the 92 * beginning of the stack respectively. 93 * 94 */ 95 #define USRTEXT 8192 96 #define USRSTACK (-HIGHPAGES*NBPG) /* Start of user stack */ 97 /* -1048576 */ 98 #define BTOPUSRSTACK (0x100000-HIGHPAGES) /* btop(USRSTACK) */ 99 #define P1PAGES 0x100000 100 #define LOWPAGES 0 101 #define HIGHPAGES 3 /* UPAGES. */ 102 103 /* 104 * Virtual memory related constants, all in bytes 105 */ 106 #ifndef MAXTSIZ 107 #define MAXTSIZ (6*1024*1024) /* max text size */ 108 #endif 109 #ifndef DFLDSIZ 110 #define DFLDSIZ (8*1024*1024) /* initial data size limit */ 111 #endif 112 #ifndef MAXDSIZ 113 #define MAXDSIZ (16*1024*1024) /* max data size */ 114 #endif 115 #ifndef DFLSSIZ 116 #define DFLSSIZ (512*1024) /* initial stack size limit */ 117 #endif 118 #ifndef MAXSSIZ 119 #define MAXSSIZ MAXDSIZ /* max stack size */ 120 #endif 121 122 /* 123 * Default sizes of swap allocation chunks (see dmap.h). 124 * The actual values may be changed in vminit() based on MAXDSIZ. 125 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 126 * DMMIN should be at least ctod(1) so that vtod() works. 127 * vminit() insures this. 128 */ 129 #define DMMIN 32 /* smallest swap allocation */ 130 #define DMMAX 4096 /* largest potential swap allocation */ 131 132 /* 133 * Sizes of the system and user portions of the system page table. 134 */ 135 /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 136 #define SYSPTSIZE (2 * NPTEPG) /* 8mb */ 137 #define USRPTSIZE (2 * NPTEPG) /* 8mb */ 138 139 /* 140 * PTEs for mapping user space into the kernel for phyio operations. 141 * One page is enough to handle 4Mb of simultaneous raw IO operations. 142 */ 143 #ifndef USRIOSIZE 144 #define USRIOSIZE (1 * NPTEPG) /* 4mb */ 145 #endif 146 147 /* 148 * PTEs for system V style shared memory. 149 * This is basically slop for kmempt which we actually allocate (malloc) from. 150 */ 151 #ifndef SHMMAXPGS 152 #define SHMMAXPGS 1024 /* 4mb */ 153 #endif 154 155 /* 156 * Boundary at which to place first MAPMEM segment if not explicitly 157 * specified. Should be a power of two. This allows some slop for 158 * the data segment to grow underneath the first mapped segment. 159 */ 160 #define MMSEG 0x200000 161 162 /* 163 * The size of the clock loop. 164 */ 165 #define LOOPPAGES (maxfree - firstfree) 166 167 /* 168 * The time for a process to be blocked before being very swappable. 169 * This is a number of seconds which the system takes as being a non-trivial 170 * amount of real time. You probably shouldn't change this; 171 * it is used in subtle ways (fractions and multiples of it are, that is, like 172 * half of a ``long time'', almost a long time, etc.) 173 * It is related to human patience and other factors which don't really 174 * change over time. 175 */ 176 #define MAXSLP 20 177 178 /* 179 * A swapped in process is given a small amount of core without being bothered 180 * by the page replacement algorithm. Basically this says that if you are 181 * swapped in you deserve some resources. We protect the last SAFERSS 182 * pages against paging and will just swap you out rather than paging you. 183 * Note that each process has at least UPAGES+CLSIZE pages which are not 184 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 185 * number just means a swapped in process is given around 25k bytes. 186 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 187 * so we loan each swapped in process memory worth 100$, or just admit 188 * that we don't consider it worthwhile and swap it out to disk which costs 189 * $30/mb or about $0.75. 190 */ 191 #define SAFERSS 4 /* nominal ``small'' resident set size 192 protected against replacement */ 193 194 /* 195 * DISKRPM is used to estimate the number of paging i/o operations 196 * which one can expect from a single disk controller. 197 */ 198 #define DISKRPM 3600 199 200 /* 201 * Klustering constants. Klustering is the gathering 202 * of pages together for pagein/pageout, while clustering 203 * is the treatment of hardware page size as though it were 204 * larger than it really is. 205 * 206 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 207 * units. Note that ctod(KLMAX*CLSIZE) must be <= DMMIN in dmap.h. 208 * ctob(KLMAX) should also be less than MAXPHYS (in vm_swp.c) 209 * unless you like "big push" panics. 210 */ 211 212 #define KLMAX (4/CLSIZE) 213 #define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 214 #define KLIN (4/CLSIZE) /* default data/stack in klust */ 215 #define KLTXT (4/CLSIZE) /* default text in klust */ 216 #define KLOUT (4/CLSIZE) 217 218 /* 219 * KLSDIST is the advance or retard of the fifo reclaim for sequential 220 * processes data space. 221 */ 222 #define KLSDIST 3 /* klusters advance/retard for seq. fifo */ 223 224 /* 225 * Paging thresholds (see vm_sched.c). 226 * Strategy of 1/19/85: 227 * lotsfree is 512k bytes, but at most 1/4 of memory 228 * desfree is 200k bytes, but at most 1/8 of memory 229 * minfree is 64k bytes, but at most 1/2 of desfree 230 */ 231 /* ALICE 05/23/92 BG -- I think we had better look these over carefully. */ 232 #define LOTSFREE (512 * 1024) 233 #define LOTSFREEFRACT 4 234 #define DESFREE (200 * 1024) 235 #define DESFREEFRACT 8 236 237 /* 238 * There are two clock hands, initially separated by HANDSPREAD bytes 239 * (but at most all of user memory). The amount of time to reclaim 240 * a page once the pageout process examines it increases with this 241 * distance and decreases as the scan rate rises. 242 */ 243 #define HANDSPREAD (2 * 1024 * 1024) 244 245 /* 246 * The number of times per second to recompute the desired paging rate 247 * and poke the pagedaemon. 248 */ 249 #define RATETOSCHEDPAGING 4 250 251 /* 252 * Believed threshold (in megabytes) for which interleaved 253 * swapping area is desirable. 254 */ 255 /* ALICE 05/23/92 BG -- This should be higher. How high, I don't know. */ 256 #define LOTSOFMEM 2 257 258 #define mapin(pte, v, pfnum, prot) \ 259 (*(u_int *)(pte) = ((pfnum) << PGSHIFT) | (prot), TBIS((caddr_t)(v))) 260 261 /* 262 * Mach derived constants 263 */ 264 265 /* user/kernel map constants */ 266 #define VM_MIN_ADDRESS ((vm_offset_t)0) 267 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0xFFFFD000) 268 /* Note that this goes as high as USRSTACK. If USRSTACK goes higher, */ 269 /* this constant really should, too. */ 270 #define VM_MAX_ADDRESS ((vm_offset_t)0xFFFFD000) 271 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0) 272 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xFFFFF000) 273 274 /* virtual sizes (bytes) for various kernel submaps */ 275 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 276 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 277 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 278 279 /* # of kernel PT pages (initial only, can grow dynamically) */ 280 #define VM_KERNEL_PT_PAGES ((vm_size_t)2) /* XXX: SYSPTSIZE */ 281 282 /* pcb base */ 283 #define pcbb(p) ((u_int)(p)->p_addr) 284