1 /*- 2 * Copyright (c) 1990 The Regents of the University of California. 3 * All rights reserved. 4 * 5 * This code is derived from software contributed to Berkeley by 6 * William Jolitz. 7 * 8 * Slightly modified for the VAX port /IC 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: @(#)vmparam.h 5.9 (Berkeley) 5/12/91 39 * $Id: vmparam.h,v 1.2 1994/08/16 23:41:57 ragge Exp $ 40 */ 41 #ifndef ASSEMBLER 42 #include <vm/vm_param.h> 43 #endif 44 45 /* 46 * Machine dependent constants for VAX. 47 */ 48 49 /* 50 * Virtual address space arrangement. On 386, both user and kernel 51 * share the address space, not unlike the vax. 52 * USRTEXT is the start of the user text/data space, while USRSTACK 53 * is the top (end) of the user stack. Immediately above the user stack 54 * resides the user structure, which is UPAGES long and contains the 55 * kernel stack. 56 * 57 */ 58 59 #define USRTEXT 0 60 #define USRSTACK 0x80000000 61 62 /* 63 * Virtual memory related constants, all in bytes 64 */ 65 66 #ifndef MAXTSIZ 67 #define MAXTSIZ (4*1024*1024) /* max text size */ 68 #endif 69 #ifndef MAXDSIZ 70 #define MAXDSIZ (10*1024*1024) /* max data size */ 71 #endif 72 #ifndef MAXSSIZ 73 #define MAXSSIZ (2*1024*1024) /* max stack size */ 74 #endif 75 #ifndef DFLDSIZ 76 #define DFLDSIZ (4*1024*1024) /* initial data size limit */ 77 #endif 78 #ifndef DFLSSIZ 79 #define DFLSSIZ (512*1024) /* initial stack size limit */ 80 #endif 81 82 /* (We think) the page table will only need to grow this much */ 83 #define VAX_MAX_PT_SIZE ((MAXTSIZ+MAXDSIZ+MAXSSIZ)>>7) 84 /* XXX Text size is already set to a predefined size, why alloc 85 more page tables for it than needed??? */ 86 87 /* 88 * Default sizes of swap allocation chunks (see dmap.h). 89 * The actual values may be changed in vminit() based on MAXDSIZ. 90 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 91 */ 92 93 #define DMMIN 32 /* smallest swap allocation */ 94 #define DMMAX 4096 /* largest potential swap allocation */ 95 #define DMTEXT 1024 /* swap allocation for text */ 96 97 /* 98 * Size of shared memory map 99 */ 100 101 #ifndef SHMMAXPGS 102 #define SHMMAXPGS 64 /* XXXX should be 1024 */ 103 #endif 104 105 /* 106 * Sizes of the system and user portions of the system page table. 107 */ 108 /* 109 110 #define SYSPTSIZE (2*NPTEPG) 111 #define USRPTSIZE (2*NPTEPG) 112 113 */ 114 /* 115 * Size of User Raw I/O map 116 */ 117 /* #define USRIOSIZE 300 */ 118 119 /* 120 * The size of the clock loop. 121 */ 122 123 /* #define LOOPPAGES (maxfree - firstfree) */ 124 125 /* 126 * The time for a process to be blocked before being very swappable. 127 * This is a number of seconds which the system takes as being a non-trivial 128 * amount of real time. You probably shouldn't change this; 129 * it is used in subtle ways (fractions and multiples of it are, that is, like 130 * half of a ``long time'', almost a long time, etc.) 131 * It is related to human patience and other factors which don't really 132 * change over time. 133 */ 134 135 #define MAXSLP 20 136 137 /* 138 * A swapped in process is given a small amount of core without being bothered 139 * by the page replacement algorithm. Basically this says that if you are 140 * swapped in you deserve some resources. We protect the last SAFERSS 141 * pages against paging and will just swap you out rather than paging you. 142 * Note that each process has at least UPAGES+CLSIZE pages which are not 143 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 144 * number just means a swapped in process is given around 25k bytes. 145 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 146 * so we loan each swapped in process memory worth 100$, or just admit 147 * that we don't consider it worthwhile and swap it out to disk which costs 148 * $30/mb or about $0.75. 149 */ 150 151 #define SAFERSS 8 /* nominal ``small'' resident set size 152 protected against replacement */ 153 154 /* 155 * DISKRPM is used to estimate the number of paging i/o operations 156 * which one can expect from a single disk controller. 157 */ 158 159 /* #define DISKRPM 60 */ 160 161 /* 162 * Klustering constants. Klustering is the gathering 163 * of pages together for pagein/pageout, while clustering 164 * is the treatment of hardware page size as though it were 165 * larger than it really is. 166 * 167 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 168 * units. Note that KLMAX*CLSIZE must be <= DMMIN in dmap.h. 169 */ 170 171 /*#define KLMAX (4/CLSIZE) /* */ 172 /*#define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 173 /*#define KLIN (4/CLSIZE) /* default data/stack in klust */ 174 /*#define KLTXT (4/CLSIZE) /* default text in klust */ 175 /*#define KLOUT (4/CLSIZE) /* */ 176 177 /* 178 * KLSDIST is the advance or retard of the fifo reclaim for sequential 179 * processes data space. 180 */ 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 * minfree is 64k bytes, but at most 1/2 of desfree 190 */ 191 192 #define LOTSFREE (512 * 1024) 193 #define LOTSFREEFRACT 4 194 #define DESFREE (200 * 1024) 195 #define DESFREEFRACT 8 196 #define MINFREE (64 * 1024) 197 #define MINFREEFRACT 2 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 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 213 #define RATETOSCHEDPAGING 4 214 215 /* 216 * Believed threshold (in megabytes) for which interleaved 217 * swapping area is desirable. 218 */ 219 220 #define LOTSOFMEM 2 221 222 #define mapin(pte, v, pfnum, prot) \ 223 {(*(int *)(pte) = ((pfnum)<<PGSHIFT) | (prot)) ; } 224 225 /* 226 * Mach derived constants 227 */ 228 229 /* # of kernel PT pages */ 230 231 #define VM_KERNEL_PT_PAGES 2*1024 /* XXX: SYSPTSIZE */ 232 /* Will give this # times 64 */ 233 /* kilobytes virtual memory */ 234 235 /* user/kernel map constants */ 236 #define VM_MIN_ADDRESS ((vm_offset_t)0) 237 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x80000000) 238 #define VM_MAX_ADDRESS ((vm_offset_t)0xC0000000) 239 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0x80000000) 240 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(VM_MIN_KERNEL_ADDRESS+\ 241 (VM_KERNEL_PT_PAGES*0x10000))) 242 243 /* virtual sizes (bytes) for various kernel submaps */ 244 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 245 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 246 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 247 248 /* pcb base */ 249 #define pcbb(p) ((u_int)(p)->p_addr) 250 251