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