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