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