1 /* $NetBSD: vmparam.h,v 1.4 1994/10/26 08:02:36 cgd Exp $ */ 2 3 /*- 4 * Copyright (c) 1990 The Regents of the University of California. 5 * All rights reserved. 6 * 7 * This code is derived from software contributed to Berkeley by 8 * William Jolitz. 9 * 10 * Slightly modified for the VAX port /IC 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 * @(#)vmparam.h 5.9 (Berkeley) 5/12/91 41 */ 42 #ifndef ASSEMBLER 43 #include <vm/vm_param.h> 44 #endif 45 46 /* 47 * Machine dependent constants for VAX. 48 */ 49 50 /* 51 * Virtual address space arrangement. On 386, both user and kernel 52 * share the address space, not unlike the vax. 53 * USRTEXT is the start of the user text/data space, while USRSTACK 54 * is the top (end) of the user stack. Immediately above the user stack 55 * resides the user structure, which is UPAGES long and contains the 56 * kernel stack. 57 * 58 */ 59 60 #define USRTEXT 0 61 #define USRSTACK 0x7fffe000 62 63 /* 64 * Virtual memory related constants, all in bytes 65 */ 66 67 #ifndef MAXTSIZ 68 #define MAXTSIZ (4*1024*1024) /* max text size */ 69 #endif 70 #ifndef MAXDSIZ 71 #define MAXDSIZ (10*1024*1024) /* max data size */ 72 #endif 73 #ifndef MAXSSIZ 74 #define MAXSSIZ (2*1024*1024) /* max stack size */ 75 #endif 76 #ifndef DFLDSIZ 77 #define DFLDSIZ (4*1024*1024) /* initial data size limit */ 78 #endif 79 #ifndef DFLSSIZ 80 #define DFLSSIZ (512*1024) /* initial stack size limit */ 81 #endif 82 83 #define PxTOP0(x) ((x&0x40000000) ? \ 84 (x+MAXTSIZ+MAXDSIZ+MAXSSIZ-0x80000000): \ 85 (x&0x7fffffff)) 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 * We can have at most maxproc userpt on syspt. 108 * Ptsizes are in pte:s. 109 */ 110 /* XXX Text size is already set to a predefined size, why alloc 111 more page tables for it than needed??? */ 112 113 #define USRPTSIZE ((MAXTSIZ+MAXDSIZ+MAXSSIZ)>>9) /* PTEs */ 114 #define SYSPTSIZE ((((USRPTSIZE>>9)+UPAGES)*maxproc)+120*1024) 115 116 /* 117 * The time for a process to be blocked before being very swappable. 118 * This is a number of seconds which the system takes as being a non-trivial 119 * amount of real time. You probably shouldn't change this; 120 * it is used in subtle ways (fractions and multiples of it are, that is, like 121 * half of a ``long time'', almost a long time, etc.) 122 * It is related to human patience and other factors which don't really 123 * change over time. 124 */ 125 126 #define MAXSLP 20 127 128 /* 129 * A swapped in process is given a small amount of core without being bothered 130 * by the page replacement algorithm. Basically this says that if you are 131 * swapped in you deserve some resources. We protect the last SAFERSS 132 * pages against paging and will just swap you out rather than paging you. 133 * Note that each process has at least UPAGES+CLSIZE pages which are not 134 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 135 * number just means a swapped in process is given around 25k bytes. 136 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 137 * so we loan each swapped in process memory worth 100$, or just admit 138 * that we don't consider it worthwhile and swap it out to disk which costs 139 * $30/mb or about $0.75. 140 */ 141 142 #define SAFERSS 8 /* nominal ``small'' resident set size 143 protected against replacement */ 144 145 /* 146 * Paging thresholds (see vm_sched.c). 147 * Strategy of 1/19/85: 148 * lotsfree is 512k bytes, but at most 1/4 of memory 149 * desfree is 200k bytes, but at most 1/8 of memory 150 * minfree is 64k bytes, but at most 1/2 of desfree 151 */ 152 /* 153 #define LOTSFREE (512 * 1024) 154 #define LOTSFREEFRACT 4 155 #define DESFREE (200 * 1024) 156 #define DESFREEFRACT 8 157 #define MINFREE (64 * 1024) 158 #define MINFREEFRACT 2 159 */ 160 161 /* 162 * There are two clock hands, initially separated by HANDSPREAD bytes 163 * (but at most all of user memory). The amount of time to reclaim 164 * a page once the pageout process examines it increases with this 165 * distance and decreases as the scan rate rises. 166 */ 167 168 #define HANDSPREAD (2 * 1024 * 1024) 169 170 /* 171 * The number of times per second to recompute the desired paging rate 172 * and poke the pagedaemon. 173 */ 174 175 #define RATETOSCHEDPAGING 4 176 177 /* 178 * Believed threshold (in megabytes) for which interleaved 179 * swapping area is desirable. 180 */ 181 182 #define LOTSOFMEM 2 183 184 #define mapin(pte, v, pfnum, prot) \ 185 {(*(int *)(pte) = ((pfnum)<<PGSHIFT) | (prot)) ; } 186 187 /* 188 * Mach derived constants 189 */ 190 191 /* user/kernel map constants */ 192 #define VM_MIN_ADDRESS ((vm_offset_t)0) 193 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x80000000) 194 #define VM_MAX_ADDRESS ((vm_offset_t)0xC0000000) 195 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0x80000000) 196 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(VM_MIN_KERNEL_ADDRESS+\ 197 (VM_KERNEL_PT_PAGES*0x10000))) 198 199 /* virtual sizes (bytes) for various kernel submaps */ 200 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 201 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 202 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 203 204 /* pcb base */ 205 #define pcbb(p) ((u_int)(p)->p_addr) 206 207