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