1 /* $NetBSD: vmparam.h,v 1.8 1997/07/12 16:19:28 perry 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 DEC Station 3100. 47 */ 48 /* 49 * USRTEXT is the start of the user text/data space, while USRSTACK 50 * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are 51 * the number of pages from the beginning of the P0 region to the 52 * beginning of the text and from the beginning of the P1 region to the 53 * beginning of the stack respectively. 54 */ 55 #define USRTEXT 0x00001000 56 #define USRSTACK 0x80000000 /* Start of user stack */ 57 #define BTOPUSRSTACK 0x80000 /* btop(USRSTACK) */ 58 #define LOWPAGES 0x00001 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 (256*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 (32*1024*1024) /* max stack size */ 78 #endif 79 80 /* 81 * Sizes of the system and user portions of the system page table. 82 */ 83 /* SYSPTSIZE IS SILLY; (really number of buffers for I/O) */ 84 #define SYSPTSIZE 1228 85 #define USRPTSIZE 1024 86 87 /* 88 * PTEs for mapping user space into the kernel for phyio operations. 89 * 16 pte's are enough to cover 8 disks * MAXBSIZE. 90 */ 91 #ifndef USRIOSIZE 92 #define USRIOSIZE 32 93 #endif 94 95 /* 96 * PTEs for system V style shared memory. 97 * This is basically slop for kmempt which we actually allocate (malloc) from. 98 */ 99 #ifndef SHMMAXPGS 100 #define SHMMAXPGS 1024 /* 4mb */ 101 #endif 102 103 /* 104 * Boundary at which to place first MAPMEM segment if not explicitly 105 * specified. Should be a power of two. This allows some slop for 106 * the data segment to grow underneath the first mapped segment. 107 */ 108 #define MMSEG 0x200000 109 110 /* 111 * The size of the clock loop. 112 */ 113 #define LOOPPAGES (maxfree - firstfree) 114 115 /* 116 * The time for a process to be blocked before being very swappable. 117 * This is a number of seconds which the system takes as being a non-trivial 118 * amount of real time. You probably shouldn't change this; 119 * it is used in subtle ways (fractions and multiples of it are, that is, like 120 * half of a ``long time'', almost a long time, etc.) 121 * It is related to human patience and other factors which don't really 122 * change over time. 123 */ 124 #define MAXSLP 20 125 126 /* 127 * A swapped in process is given a small amount of core without being bothered 128 * by the page replacement algorithm. Basically this says that if you are 129 * swapped in you deserve some resources. We protect the last SAFERSS 130 * pages against paging and will just swap you out rather than paging you. 131 * Note that each process has at least UPAGES+CLSIZE pages which are not 132 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 133 * number just means a swapped in process is given around 25k bytes. 134 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 135 * so we loan each swapped in process memory worth 100$, or just admit 136 * that we don't consider it worthwhile and swap it out to disk which costs 137 * $30/mb or about $0.75. 138 * Update: memory prices have changed recently (9/96). At the current 139 * value of $6 per megabyte, we lend each swapped in process memory worth 140 * $0.15, or just admit that we don't consider it worthwhile and swap it out 141 * to disk which costs $0.20/MB, or just under half a cent. 142 */ 143 #define SAFERSS 4 /* nominal ``small'' resident set size 144 protected against replacement */ 145 146 /* 147 * DISKRPM is used to estimate the number of paging i/o operations 148 * which one can expect from a single disk controller. 149 */ 150 #define DISKRPM 60 151 152 /* 153 * Klustering constants. Klustering is the gathering 154 * of pages together for pagein/pageout, while clustering 155 * is the treatment of hardware page size as though it were 156 * larger than it really is. 157 * 158 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 159 * units. Note that ctod(KLMAX*CLSIZE) must be <= DMMIN in dmap.h. 160 * ctob(KLMAX) should also be less than MAXPHYS (in vm_swp.c) 161 * unless you like "big push" panics. 162 */ 163 164 #ifdef notdef /* XXX */ 165 #define KLMAX (4/CLSIZE) 166 #define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 167 #define KLIN (4/CLSIZE) /* default data/stack in klust */ 168 #define KLTXT (4/CLSIZE) /* default text in klust */ 169 #define KLOUT (4/CLSIZE) 170 #else 171 #define KLMAX (1/CLSIZE) 172 #define KLSEQL (1/CLSIZE) 173 #define KLIN (1/CLSIZE) 174 #define KLTXT (1/CLSIZE) 175 #define KLOUT (1/CLSIZE) 176 #endif 177 178 /* 179 * KLSDIST is the advance or retard of the fifo reclaim for sequential 180 * processes data space. 181 */ 182 #define KLSDIST 3 /* klusters advance/retard for seq. fifo */ 183 184 /* 185 * Paging thresholds (see vm_sched.c). 186 * Strategy of 1/19/85: 187 * lotsfree is 512k bytes, but at most 1/4 of memory 188 * desfree is 200k bytes, but at most 1/8 of memory 189 */ 190 #define LOTSFREE (512 * 1024) 191 #define LOTSFREEFRACT 4 192 #define DESFREE (200 * 1024) 193 #define DESFREEFRACT 8 194 195 /* 196 * There are two clock hands, initially separated by HANDSPREAD bytes 197 * (but at most all of user memory). The amount of time to reclaim 198 * a page once the pageout process examines it increases with this 199 * distance and decreases as the scan rate rises. 200 */ 201 #define HANDSPREAD (2 * 1024 * 1024) 202 203 /* 204 * The number of times per second to recompute the desired paging rate 205 * and poke the pagedaemon. 206 */ 207 #define RATETOSCHEDPAGING 4 208 209 /* 210 * Believed threshold (in megabytes) for which interleaved 211 * swapping area is desirable. 212 */ 213 #define LOTSOFMEM 2 214 215 #define mapin(pte, v, pfnum, prot) \ 216 (*(int *)(pte) = ((pfnum) << PG_SHIFT) | (prot), MachTLBFlushAddr(v)) 217 218 /* 219 * Mach derived constants 220 */ 221 222 /* user/kernel map constants */ 223 #define VM_MIN_ADDRESS ((vm_offset_t)0x00000000) 224 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x80000000) 225 #define VM_MAX_ADDRESS ((vm_offset_t)0x80000000) 226 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0xC0000000) 227 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xFFFFC000) 228 229 /* virtual sizes (bytes) for various kernel submaps */ 230 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 231 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 232 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 233 234 /* pcb base */ 235 #define pcbb(p) ((u_int)(p)->p_addr) 236