1 /* $NetBSD: vmparam.h,v 1.9 1998/08/22 10:55:34 scw 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 #ifndef _MVME68K_VMPARAM_H_ 46 #define _MVME68K_VMPARAM_H_ 47 48 /* 49 * Machine dependent constants for MVME68K 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 * NOTE: the ONLY reason that HIGHPAGES is 0x100 instead of UPAGES (3) 60 * is for HPUX compatibility. Why?? Because HPUX's debuggers 61 * have the user's stack hard-wired at FFF00000 for post-mortems, 62 * and we must be compatible... 63 */ 64 #define USRTEXT 8192 /* Must equal __LDPGSZ */ 65 #define USRSTACK (-HIGHPAGES*NBPG) /* Start of user stack */ 66 #define BTOPUSRSTACK (0x100000-HIGHPAGES) /* btop(USRSTACK) */ 67 #define P1PAGES 0x100000 68 #define LOWPAGES 0 69 #define HIGHPAGES (0x100000/NBPG) 70 71 /* 72 * Virtual memory related constants, all in bytes 73 */ 74 #ifndef MAXTSIZ 75 #define MAXTSIZ (8*1024*1024) /* max text size */ 76 #endif 77 #ifndef DFLDSIZ 78 #define DFLDSIZ (16*1024*1024) /* initial data size limit */ 79 #endif 80 #ifndef MAXDSIZ 81 #define MAXDSIZ (64*1024*1024) /* max data size */ 82 #endif 83 #ifndef DFLSSIZ 84 #define DFLSSIZ (512*1024) /* initial stack size limit */ 85 #endif 86 #ifndef MAXSSIZ 87 #define MAXSSIZ MAXDSIZ /* max stack size */ 88 #endif 89 90 /* 91 * Sizes of the system and user portions of the system page table. 92 */ 93 /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 94 #define SYSPTSIZE (2 * NPTEPG) /* 8mb */ 95 #define USRPTSIZE (1 * NPTEPG) /* 4mb */ 96 97 /* 98 * PTEs for mapping user space into the kernel for phyio operations. 99 * One page is enough to handle 4Mb of simultaneous raw IO operations. 100 */ 101 #ifndef USRIOSIZE 102 #define USRIOSIZE (1 * NPTEPG) /* 4mb */ 103 #endif 104 105 /* 106 * PTEs for system V style shared memory. 107 * This is basically slop for kmempt which we actually allocate (malloc) from. 108 */ 109 #ifndef SHMMAXPGS 110 #define SHMMAXPGS 1024 /* 4mb */ 111 #endif 112 113 /* 114 * Boundary at which to place first MAPMEM segment if not explicitly 115 * specified. Should be a power of two. This allows some slop for 116 * the data segment to grow underneath the first mapped segment. 117 */ 118 #define MMSEG 0x200000 119 120 /* 121 * The size of the clock loop. 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 #define MAXSLP 20 135 136 /* 137 * A swapped in process is given a small amount of core without being bothered 138 * by the page replacement algorithm. Basically this says that if you are 139 * swapped in you deserve some resources. We protect the last SAFERSS 140 * pages against paging and will just swap you out rather than paging you. 141 * Note that each process has at least UPAGES+CLSIZE pages which are not 142 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 143 * number just means a swapped in process is given around 25k bytes. 144 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 145 * so we loan each swapped in process memory worth 100$, or just admit 146 * that we don't consider it worthwhile and swap it out to disk which costs 147 * $30/mb or about $0.75. 148 * Update: memory prices have changed recently (9/96). At the current 149 * value of $6 per megabyte, we lend each swapped in process memory worth 150 * $0.15, or just admit that we don't consider it worthwhile and swap it out 151 * to disk which costs $0.20/MB, or just under half a cent. 152 */ 153 #define SAFERSS 4 /* nominal ``small'' resident set size 154 protected against replacement */ 155 156 /* 157 * DISKRPM is used to estimate the number of paging i/o operations 158 * which one can expect from a single disk controller. 159 */ 160 #define DISKRPM 60 161 162 /* 163 * Klustering constants. Klustering is the gathering 164 * of pages together for pagein/pageout, while clustering 165 * is the treatment of hardware page size as though it were 166 * larger than it really is. 167 * 168 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 169 * units. Note that ctod(KLMAX*CLSIZE) must be <= DMMIN in dmap.h. 170 * ctob(KLMAX) should also be less than MAXPHYS (in vm_swp.c) 171 * unless you like "big push" panics. 172 */ 173 174 #define KLMAX (4/CLSIZE) 175 #define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 176 #define KLIN (4/CLSIZE) /* default data/stack in klust */ 177 #define KLTXT (4/CLSIZE) /* default text in klust */ 178 #define KLOUT (4/CLSIZE) 179 180 /* 181 * KLSDIST is the advance or retard of the fifo reclaim for sequential 182 * processes data space. 183 */ 184 #define KLSDIST 3 /* klusters advance/retard for seq. fifo */ 185 186 /* 187 * Paging thresholds (see vm_sched.c). 188 * Strategy of 1/19/85: 189 * lotsfree is 512k bytes, but at most 1/4 of memory 190 * desfree is 200k bytes, but at most 1/8 of memory 191 */ 192 #define LOTSFREE (512 * 1024) 193 #define LOTSFREEFRACT 4 194 #define DESFREE (200 * 1024) 195 #define DESFREEFRACT 8 196 197 /* 198 * There are two clock hands, initially separated by HANDSPREAD bytes 199 * (but at most all of user memory). The amount of time to reclaim 200 * a page once the pageout process examines it increases with this 201 * distance and decreases as the scan rate rises. 202 */ 203 #define HANDSPREAD (2 * 1024 * 1024) 204 205 /* 206 * The number of times per second to recompute the desired paging rate 207 * and poke the pagedaemon. 208 */ 209 #define RATETOSCHEDPAGING 4 210 211 /* 212 * Believed threshold (in megabytes) for which interleaved 213 * swapping area is desirable. 214 */ 215 #define LOTSOFMEM 2 216 217 /* 218 * Mach derived constants 219 */ 220 221 /* user/kernel map constants */ 222 #define VM_MIN_ADDRESS ((vaddr_t)0) 223 #define VM_MAXUSER_ADDRESS ((vaddr_t)0xFFF00000) 224 #define VM_MAX_ADDRESS ((vaddr_t)0xFFF00000) 225 #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)0) 226 #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)0xFFFFF000) 227 228 /* virtual sizes (bytes) for various kernel submaps */ 229 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 230 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 231 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 232 233 /* # of kernel PT pages (initial only, can grow dynamically) */ 234 #define VM_KERNEL_PT_PAGES ((vsize_t)2) /* XXX: SYSPTSIZE */ 235 236 /* pcb base */ 237 #define pcbb(p) ((u_int)(p)->p_addr) 238 239 /* Use new VM page bootstrap interface. */ 240 #define MACHINE_NEW_NONCONTIG 241 242 /* 243 * Constants which control the way the VM system deals with memory segments. 244 * The mvme68k port has two physical memory segments: 1 for onboard RAM 245 * and another for contiguous VMEbus RAM. 246 */ 247 #define VM_PHYSSEG_MAX 2 248 #define VM_PHYSSEG_STRAT VM_PSTRAT_RANDOM 249 #define VM_PHYSSEG_NOADD 250 251 #define VM_NFREELIST 2 252 #define VM_FREELIST_DEFAULT 0 253 #define VM_FREELIST_VMEMEM 1 254 255 /* 256 * pmap-specific data stored in the vm_physmem[] array. 257 */ 258 struct pmap_physseg { 259 struct pv_entry *pvent; /* pv table for this seg */ 260 char *attrs; /* page attributes for this seg */ 261 }; 262 263 #endif /* _MVME68K_VMPARAM_H_ */ 264