1 /* $NetBSD: vmparam.h,v 1.9 1997/06/12 15:09:30 mrg 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 mac68k -- mostly derived from hp300. 81 */ 82 83 /* 84 * USRTEXT is the start of the user text/data space, while USRSTACK 85 * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are 86 * the number of pages from the beginning of the P0 region to the 87 * beginning of the text and from the beginning of the P1 region to the 88 * beginning of the stack respectively. 89 * 90 * NOTE: HP300 uses HIGHPAGES == (0x100000/NBPG) for HP/UX compatibility. 91 * Do we care? Obviously not at the moment. 92 */ 93 #define USRTEXT 8192 94 #define USRSTACK (-HIGHPAGES*NBPG) /* Start of user stack */ 95 #define BTOPUSRSTACK (0x100000-HIGHPAGES) /* btop(USRSTACK) */ 96 #define P1PAGES 0x100000 97 #define LOWPAGES 0 98 #define HIGHPAGES 3 /* UPAGES */ 99 100 /* 101 * Virtual memory related constants, all in bytes 102 */ 103 #ifndef MAXTSIZ 104 #define MAXTSIZ (8*1024*1024) /* max text size */ 105 #endif 106 #ifndef DFLDSIZ 107 #define DFLDSIZ (16*1024*1024) /* initial data size limit */ 108 #endif 109 #ifndef MAXDSIZ 110 #define MAXDSIZ (64*1024*1024) /* max data size */ 111 #endif 112 #ifndef DFLSSIZ 113 #define DFLSSIZ (512*1024) /* initial stack size limit */ 114 #endif 115 #ifndef MAXSSIZ 116 #define MAXSSIZ MAXDSIZ /* max stack size */ 117 #endif 118 119 /* 120 * Sizes of the system and user portions of the system page table. 121 */ 122 /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 123 #define SYSPTSIZE (2 * NPTEPG) /* 8mb */ 124 #define USRPTSIZE (1 * NPTEPG) /* 4mb */ 125 126 /* 127 * PTEs for mapping user space into the kernel for phyio operations. 128 * One page is enough to handle 4Mb of simultaneous raw IO operations. 129 */ 130 #ifndef USRIOSIZE 131 #define USRIOSIZE (1 * NPTEPG) /* 4mb */ 132 #endif 133 134 /* 135 * PTEs for system V style shared memory. 136 * This is basically slop for kmempt which we actually allocate (malloc) from. 137 */ 138 #ifndef SHMMAXPGS 139 #define SHMMAXPGS 1024 /* 4mb */ 140 #endif 141 142 /* 143 * Boundary at which to place first MAPMEM segment if not explicitly 144 * specified. Should be a power of two. This allows some slop for 145 * the data segment to grow underneath the first mapped segment. 146 */ 147 #define MMSEG 0x200000 148 149 /* 150 * The size of the clock loop. 151 */ 152 #define LOOPPAGES (maxfree - firstfree) 153 154 /* 155 * The time for a process to be blocked before being very swappable. 156 * This is a number of seconds which the system takes as being a non-trivial 157 * amount of real time. You probably shouldn't change this; 158 * it is used in subtle ways (fractions and multiples of it are, that is, like 159 * half of a ``long time'', almost a long time, etc.) 160 * It is related to human patience and other factors which don't really 161 * change over time. 162 */ 163 #define MAXSLP 20 164 165 /* 166 * A swapped in process is given a small amount of core without being bothered 167 * by the page replacement algorithm. Basically this says that if you are 168 * swapped in you deserve some resources. We protect the last SAFERSS 169 * pages against paging and will just swap you out rather than paging you. 170 * Note that each process has at least UPAGES+CLSIZE pages which are not 171 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 172 * number just means a swapped in process is given around 25k bytes. 173 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 174 * so we loan each swapped in process memory worth 100$, or just admit 175 * that we don't consider it worthwhile and swap it out to disk which costs 176 * $30/mb or about $0.75. 177 */ 178 #define SAFERSS 4 /* nominal ``small'' resident set size 179 protected against replacement */ 180 181 /* 182 * DISKRPM is used to estimate the number of paging i/o operations 183 * which one can expect from a single disk controller. 184 */ 185 #define DISKRPM 3600 186 187 /* 188 * Klustering constants. Klustering is the gathering 189 * of pages together for pagein/pageout, while clustering 190 * is the treatment of hardware page size as though it were 191 * larger than it really is. 192 * 193 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 194 * units. Note that ctod(KLMAX*CLSIZE) must be <= DMMIN in dmap.h. 195 * ctob(KLMAX) should also be less than MAXPHYS (in vm_swp.c) 196 * unless you like "big push" panics. 197 */ 198 199 #define KLMAX (4/CLSIZE) 200 #define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 201 #define KLIN (4/CLSIZE) /* default data/stack in klust */ 202 #define KLTXT (4/CLSIZE) /* default text in klust */ 203 #define KLOUT (4/CLSIZE) 204 205 /* 206 * KLSDIST is the advance or retard of the fifo reclaim for sequential 207 * processes data space. 208 */ 209 #define KLSDIST 3 /* klusters advance/retard for seq. fifo */ 210 211 /* 212 * Paging thresholds (see vm_sched.c). 213 * Strategy of 1/19/85: 214 * lotsfree is 512k bytes, but at most 1/4 of memory 215 * desfree is 200k bytes, but at most 1/8 of memory 216 * Are these still valid in 1995? 217 */ 218 #define LOTSFREE (512 * 1024) 219 #define LOTSFREEFRACT 4 220 #define DESFREE (200 * 1024) 221 #define DESFREEFRACT 8 222 223 /* 224 * There are two clock hands, initially separated by HANDSPREAD bytes 225 * (but at most all of user memory). The amount of time to reclaim 226 * a page once the pageout process examines it increases with this 227 * distance and decreases as the scan rate rises. 228 */ 229 #define HANDSPREAD (2 * 1024 * 1024) 230 231 /* 232 * The number of times per second to recompute the desired paging rate 233 * and poke the pagedaemon. 234 */ 235 #define RATETOSCHEDPAGING 4 236 237 /* 238 * Believed threshold (in megabytes) for which interleaved 239 * swapping area is desirable. 240 */ 241 #define LOTSOFMEM 2 242 243 /* 244 * Mach derived constants 245 */ 246 247 /* user/kernel map constants */ 248 #define VM_MIN_ADDRESS ((vm_offset_t)0) 249 #define VM_MAXUSER_ADDRESS ((vm_offset_t)(USRSTACK)) 250 #define VM_MAX_ADDRESS ((vm_offset_t)(0-(UPAGES*NBPG))) 251 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0) 252 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(0-NBPG)) 253 254 /* virtual sizes (bytes) for various kernel submaps */ 255 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 256 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 257 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 258 259 #define MACHINE_NONCONTIG /* VM <=> pmap interface modifier */ 260 261 /* # of kernel PT pages (initial only, can grow dynamically) */ 262 #define VM_KERNEL_PT_PAGES ((vm_size_t)2) /* XXX: SYSPTSIZE */ 263 264 /* pcb base */ 265 #define pcbb(p) ((u_int)(p)->p_addr) 266