vmparam.h revision 1.2.2.2
1 1.2.2.2 ragge /*- 2 1.2.2.2 ragge * Copyright (c) 1990 The Regents of the University of California. 3 1.2.2.2 ragge * All rights reserved. 4 1.2.2.2 ragge * 5 1.2.2.2 ragge * This code is derived from software contributed to Berkeley by 6 1.2.2.2 ragge * William Jolitz. 7 1.2.2.2 ragge * 8 1.2.2.2 ragge * Slightly modified for the VAX port /IC 9 1.2.2.2 ragge * 10 1.2.2.2 ragge * Redistribution and use in source and binary forms, with or without 11 1.2.2.2 ragge * modification, are permitted provided that the following conditions 12 1.2.2.2 ragge * are met: 13 1.2.2.2 ragge * 1. Redistributions of source code must retain the above copyright 14 1.2.2.2 ragge * notice, this list of conditions and the following disclaimer. 15 1.2.2.2 ragge * 2. Redistributions in binary form must reproduce the above copyright 16 1.2.2.2 ragge * notice, this list of conditions and the following disclaimer in the 17 1.2.2.2 ragge * documentation and/or other materials provided with the distribution. 18 1.2.2.2 ragge * 3. All advertising materials mentioning features or use of this software 19 1.2.2.2 ragge * must display the following acknowledgement: 20 1.2.2.2 ragge * This product includes software developed by the University of 21 1.2.2.2 ragge * California, Berkeley and its contributors. 22 1.2.2.2 ragge * 4. Neither the name of the University nor the names of its contributors 23 1.2.2.2 ragge * may be used to endorse or promote products derived from this software 24 1.2.2.2 ragge * without specific prior written permission. 25 1.2.2.2 ragge * 26 1.2.2.2 ragge * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 1.2.2.2 ragge * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 1.2.2.2 ragge * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 1.2.2.2 ragge * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 1.2.2.2 ragge * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 1.2.2.2 ragge * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 1.2.2.2 ragge * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 1.2.2.2 ragge * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 1.2.2.2 ragge * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 1.2.2.2 ragge * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 1.2.2.2 ragge * SUCH DAMAGE. 37 1.2.2.2 ragge * 38 1.2.2.2 ragge * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91 39 1.2.2.2 ragge * $Id: vmparam.h,v 1.2.2.2 1994/08/16 23:41:58 ragge Exp $ 40 1.2.2.2 ragge */ 41 1.2.2.2 ragge #ifndef ASSEMBLER 42 1.2.2.2 ragge #include <vm/vm_param.h> 43 1.2.2.2 ragge #endif 44 1.2.2.2 ragge 45 1.2.2.2 ragge /* 46 1.2.2.2 ragge * Machine dependent constants for VAX. 47 1.2.2.2 ragge */ 48 1.2.2.2 ragge 49 1.2.2.2 ragge /* 50 1.2.2.2 ragge * Virtual address space arrangement. On 386, both user and kernel 51 1.2.2.2 ragge * share the address space, not unlike the vax. 52 1.2.2.2 ragge * USRTEXT is the start of the user text/data space, while USRSTACK 53 1.2.2.2 ragge * is the top (end) of the user stack. Immediately above the user stack 54 1.2.2.2 ragge * resides the user structure, which is UPAGES long and contains the 55 1.2.2.2 ragge * kernel stack. 56 1.2.2.2 ragge * 57 1.2.2.2 ragge */ 58 1.2.2.2 ragge 59 1.2.2.2 ragge #define USRTEXT 0 60 1.2.2.2 ragge #define USRSTACK 0x80000000 61 1.2.2.2 ragge 62 1.2.2.2 ragge /* 63 1.2.2.2 ragge * Virtual memory related constants, all in bytes 64 1.2.2.2 ragge */ 65 1.2.2.2 ragge 66 1.2.2.2 ragge #ifndef MAXTSIZ 67 1.2.2.2 ragge #define MAXTSIZ (4*1024*1024) /* max text size */ 68 1.2.2.2 ragge #endif 69 1.2.2.2 ragge #ifndef MAXDSIZ 70 1.2.2.2 ragge #define MAXDSIZ (10*1024*1024) /* max data size */ 71 1.2.2.2 ragge #endif 72 1.2.2.2 ragge #ifndef MAXSSIZ 73 1.2.2.2 ragge #define MAXSSIZ (2*1024*1024) /* max stack size */ 74 1.2.2.2 ragge #endif 75 1.2.2.2 ragge #ifndef DFLDSIZ 76 1.2.2.2 ragge #define DFLDSIZ (4*1024*1024) /* initial data size limit */ 77 1.2.2.2 ragge #endif 78 1.2.2.2 ragge #ifndef DFLSSIZ 79 1.2.2.2 ragge #define DFLSSIZ (512*1024) /* initial stack size limit */ 80 1.2.2.2 ragge #endif 81 1.2.2.2 ragge 82 1.2.2.2 ragge /* (We think) the page table will only need to grow this much */ 83 1.2.2.2 ragge #define VAX_MAX_PT_SIZE ((MAXTSIZ+MAXDSIZ+MAXSSIZ)>>7) 84 1.2.2.2 ragge /* XXX Text size is already set to a predefined size, why alloc 85 1.2.2.2 ragge more page tables for it than needed??? */ 86 1.2.2.2 ragge 87 1.2.2.2 ragge /* 88 1.2.2.2 ragge * Default sizes of swap allocation chunks (see dmap.h). 89 1.2.2.2 ragge * The actual values may be changed in vminit() based on MAXDSIZ. 90 1.2.2.2 ragge * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 91 1.2.2.2 ragge */ 92 1.2.2.2 ragge 93 1.2.2.2 ragge #define DMMIN 32 /* smallest swap allocation */ 94 1.2.2.2 ragge #define DMMAX 4096 /* largest potential swap allocation */ 95 1.2.2.2 ragge #define DMTEXT 1024 /* swap allocation for text */ 96 1.2.2.2 ragge 97 1.2.2.2 ragge /* 98 1.2.2.2 ragge * Size of shared memory map 99 1.2.2.2 ragge */ 100 1.2.2.2 ragge 101 1.2.2.2 ragge #ifndef SHMMAXPGS 102 1.2.2.2 ragge #define SHMMAXPGS 64 /* XXXX should be 1024 */ 103 1.2.2.2 ragge #endif 104 1.2.2.2 ragge 105 1.2.2.2 ragge /* 106 1.2.2.2 ragge * Sizes of the system and user portions of the system page table. 107 1.2.2.2 ragge */ 108 1.2.2.2 ragge /* 109 1.2.2.2 ragge 110 1.2.2.2 ragge #define SYSPTSIZE (2*NPTEPG) 111 1.2.2.2 ragge #define USRPTSIZE (2*NPTEPG) 112 1.2.2.2 ragge 113 1.2.2.2 ragge */ 114 1.2.2.2 ragge /* 115 1.2.2.2 ragge * Size of User Raw I/O map 116 1.2.2.2 ragge */ 117 1.2.2.2 ragge /* #define USRIOSIZE 300 */ 118 1.2.2.2 ragge 119 1.2.2.2 ragge /* 120 1.2.2.2 ragge * The size of the clock loop. 121 1.2.2.2 ragge */ 122 1.2.2.2 ragge 123 1.2.2.2 ragge /* #define LOOPPAGES (maxfree - firstfree) */ 124 1.2.2.2 ragge 125 1.2.2.2 ragge /* 126 1.2.2.2 ragge * The time for a process to be blocked before being very swappable. 127 1.2.2.2 ragge * This is a number of seconds which the system takes as being a non-trivial 128 1.2.2.2 ragge * amount of real time. You probably shouldn't change this; 129 1.2.2.2 ragge * it is used in subtle ways (fractions and multiples of it are, that is, like 130 1.2.2.2 ragge * half of a ``long time'', almost a long time, etc.) 131 1.2.2.2 ragge * It is related to human patience and other factors which don't really 132 1.2.2.2 ragge * change over time. 133 1.2.2.2 ragge */ 134 1.2.2.2 ragge 135 1.2.2.2 ragge #define MAXSLP 20 136 1.2.2.2 ragge 137 1.2.2.2 ragge /* 138 1.2.2.2 ragge * A swapped in process is given a small amount of core without being bothered 139 1.2.2.2 ragge * by the page replacement algorithm. Basically this says that if you are 140 1.2.2.2 ragge * swapped in you deserve some resources. We protect the last SAFERSS 141 1.2.2.2 ragge * pages against paging and will just swap you out rather than paging you. 142 1.2.2.2 ragge * Note that each process has at least UPAGES+CLSIZE pages which are not 143 1.2.2.2 ragge * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 144 1.2.2.2 ragge * number just means a swapped in process is given around 25k bytes. 145 1.2.2.2 ragge * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 146 1.2.2.2 ragge * so we loan each swapped in process memory worth 100$, or just admit 147 1.2.2.2 ragge * that we don't consider it worthwhile and swap it out to disk which costs 148 1.2.2.2 ragge * $30/mb or about $0.75. 149 1.2.2.2 ragge */ 150 1.2.2.2 ragge 151 1.2.2.2 ragge #define SAFERSS 8 /* nominal ``small'' resident set size 152 1.2.2.2 ragge protected against replacement */ 153 1.2.2.2 ragge 154 1.2.2.2 ragge /* 155 1.2.2.2 ragge * DISKRPM is used to estimate the number of paging i/o operations 156 1.2.2.2 ragge * which one can expect from a single disk controller. 157 1.2.2.2 ragge */ 158 1.2.2.2 ragge 159 1.2.2.2 ragge /* #define DISKRPM 60 */ 160 1.2.2.2 ragge 161 1.2.2.2 ragge /* 162 1.2.2.2 ragge * Klustering constants. Klustering is the gathering 163 1.2.2.2 ragge * of pages together for pagein/pageout, while clustering 164 1.2.2.2 ragge * is the treatment of hardware page size as though it were 165 1.2.2.2 ragge * larger than it really is. 166 1.2.2.2 ragge * 167 1.2.2.2 ragge * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 168 1.2.2.2 ragge * units. Note that KLMAX*CLSIZE must be <= DMMIN in dmap.h. 169 1.2.2.2 ragge */ 170 1.2.2.2 ragge 171 1.2.2.2 ragge /*#define KLMAX (4/CLSIZE) /* */ 172 1.2.2.2 ragge /*#define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 173 1.2.2.2 ragge /*#define KLIN (4/CLSIZE) /* default data/stack in klust */ 174 1.2.2.2 ragge /*#define KLTXT (4/CLSIZE) /* default text in klust */ 175 1.2.2.2 ragge /*#define KLOUT (4/CLSIZE) /* */ 176 1.2.2.2 ragge 177 1.2.2.2 ragge /* 178 1.2.2.2 ragge * KLSDIST is the advance or retard of the fifo reclaim for sequential 179 1.2.2.2 ragge * processes data space. 180 1.2.2.2 ragge */ 181 1.2.2.2 ragge 182 1.2.2.2 ragge /*#define KLSDIST 3 /* klusters advance/retard for seq. fifo */ 183 1.2.2.2 ragge 184 1.2.2.2 ragge /* 185 1.2.2.2 ragge * Paging thresholds (see vm_sched.c). 186 1.2.2.2 ragge * Strategy of 1/19/85: 187 1.2.2.2 ragge * lotsfree is 512k bytes, but at most 1/4 of memory 188 1.2.2.2 ragge * desfree is 200k bytes, but at most 1/8 of memory 189 1.2.2.2 ragge * minfree is 64k bytes, but at most 1/2 of desfree 190 1.2.2.2 ragge */ 191 1.2.2.2 ragge 192 1.2.2.2 ragge #define LOTSFREE (512 * 1024) 193 1.2.2.2 ragge #define LOTSFREEFRACT 4 194 1.2.2.2 ragge #define DESFREE (200 * 1024) 195 1.2.2.2 ragge #define DESFREEFRACT 8 196 1.2.2.2 ragge #define MINFREE (64 * 1024) 197 1.2.2.2 ragge #define MINFREEFRACT 2 198 1.2.2.2 ragge 199 1.2.2.2 ragge /* 200 1.2.2.2 ragge * There are two clock hands, initially separated by HANDSPREAD bytes 201 1.2.2.2 ragge * (but at most all of user memory). The amount of time to reclaim 202 1.2.2.2 ragge * a page once the pageout process examines it increases with this 203 1.2.2.2 ragge * distance and decreases as the scan rate rises. 204 1.2.2.2 ragge */ 205 1.2.2.2 ragge 206 1.2.2.2 ragge #define HANDSPREAD (2 * 1024 * 1024) 207 1.2.2.2 ragge 208 1.2.2.2 ragge /* 209 1.2.2.2 ragge * The number of times per second to recompute the desired paging rate 210 1.2.2.2 ragge * and poke the pagedaemon. 211 1.2.2.2 ragge */ 212 1.2.2.2 ragge 213 1.2.2.2 ragge #define RATETOSCHEDPAGING 4 214 1.2.2.2 ragge 215 1.2.2.2 ragge /* 216 1.2.2.2 ragge * Believed threshold (in megabytes) for which interleaved 217 1.2.2.2 ragge * swapping area is desirable. 218 1.2.2.2 ragge */ 219 1.2.2.2 ragge 220 1.2.2.2 ragge #define LOTSOFMEM 2 221 1.2.2.2 ragge 222 1.2.2.2 ragge #define mapin(pte, v, pfnum, prot) \ 223 1.2.2.2 ragge {(*(int *)(pte) = ((pfnum)<<PGSHIFT) | (prot)) ; } 224 1.2.2.2 ragge 225 1.2.2.2 ragge /* 226 1.2.2.2 ragge * Mach derived constants 227 1.2.2.2 ragge */ 228 1.2.2.2 ragge 229 1.2.2.2 ragge /* # of kernel PT pages */ 230 1.2.2.2 ragge 231 1.2.2.2 ragge #define VM_KERNEL_PT_PAGES 2*1024 /* XXX: SYSPTSIZE */ 232 1.2.2.2 ragge /* Will give this # times 64 */ 233 1.2.2.2 ragge /* kilobytes virtual memory */ 234 1.2.2.2 ragge 235 1.2.2.2 ragge /* user/kernel map constants */ 236 1.2.2.2 ragge #define VM_MIN_ADDRESS ((vm_offset_t)0) 237 1.2.2.2 ragge #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x80000000) 238 1.2.2.2 ragge #define VM_MAX_ADDRESS ((vm_offset_t)0xC0000000) 239 1.2.2.2 ragge #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0x80000000) 240 1.2.2.2 ragge #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(VM_MIN_KERNEL_ADDRESS+\ 241 1.2.2.2 ragge (VM_KERNEL_PT_PAGES*0x10000))) 242 1.2.2.2 ragge 243 1.2.2.2 ragge /* virtual sizes (bytes) for various kernel submaps */ 244 1.2.2.2 ragge #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 245 1.2.2.2 ragge #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 246 1.2.2.2 ragge #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 247 1.2.2.2 ragge 248 1.2.2.2 ragge /* pcb base */ 249 1.2.2.2 ragge #define pcbb(p) ((u_int)(p)->p_addr) 250 1.2.2.2 ragge 251
Indexes created Tue Oct 14 21:09:58 GMT 2025