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