1 /* $NetBSD: vmparam.h,v 1.12 1996/07/20 17:58:26 ragge 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 _LOCORE 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 0x400 61 #define USRSTACK 0x7fffe000 /* XXX */ 62 63 /* 64 * Virtual memory related constants, all in bytes 65 */ 66 67 #ifndef MAXTSIZ 68 #define MAXTSIZ (6*1024*1024) /* max text size */ 69 #endif 70 #ifndef MAXDSIZ 71 #define MAXDSIZ (16*1024*1024) /* max data size */ 72 #endif 73 #ifndef MAXSSIZ 74 #define MAXSSIZ (16*1024*1024) /* max stack size */ 75 #endif 76 #ifndef DFLDSIZ 77 #define DFLDSIZ (6*1024*1024) /* initial data size limit */ 78 #endif 79 #ifndef DFLSSIZ 80 #define DFLSSIZ (512*1024) /* initial stack size limit */ 81 #endif 82 83 /* 84 * Default sizes of swap allocation chunks (see dmap.h). 85 * The actual values may be changed in vminit() based on MAXDSIZ. 86 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 87 */ 88 89 #define DMMIN 32 /* smallest swap allocation */ 90 #define DMMAX 4096 /* largest potential swap allocation */ 91 #define DMTEXT 1024 /* swap allocation for text */ 92 93 /* 94 * Size of shared memory map 95 */ 96 97 #ifndef SHMMAXPGS 98 #define SHMMAXPGS 64 /* XXXX should be 1024 */ 99 #endif 100 101 /* 102 * Size of User Raw I/O map 103 */ 104 #define USRIOSIZE 300 105 106 /* 107 * Sizes of the system and user portions of the system page table. 108 * USRPTSIZE is maximum possible user virtual memory to be used. 109 * KALLOCMEM is kernel malloc area size. How much needed for each process? 110 * SYSPTSIZE is total size of statically allocated pte. (in physmem) 111 * Ptsizes are in PTEs. 112 */ 113 114 #define USRPTSIZE ((MAXDSIZ >> PGSHIFT) * maxproc) 115 #define KALLOCMEM (((1*1024*1024*maxproc)>>PGSHIFT)/4) 116 #define SYSPTSIZE (((USRPTSIZE * 4) >> PGSHIFT) + UPAGES * maxproc + \ 117 KALLOCMEM) 118 119 /* 120 * The time for a process to be blocked before being very swappable. 121 * This is a number of seconds which the system takes as being a non-trivial 122 * amount of real time. You probably shouldn't change this; 123 * it is used in subtle ways (fractions and multiples of it are, that is, like 124 * half of a ``long time'', almost a long time, etc.) 125 * It is related to human patience and other factors which don't really 126 * change over time. 127 */ 128 129 #define MAXSLP 20 130 131 /* 132 * A swapped in process is given a small amount of core without being bothered 133 * by the page replacement algorithm. Basically this says that if you are 134 * swapped in you deserve some resources. We protect the last SAFERSS 135 * pages against paging and will just swap you out rather than paging you. 136 * Note that each process has at least UPAGES+CLSIZE pages which are not 137 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 138 * number just means a swapped in process is given around 25k bytes. 139 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 140 * so we loan each swapped in process memory worth 100$, or just admit 141 * that we don't consider it worthwhile and swap it out to disk which costs 142 * $30/mb or about $0.75. 143 */ 144 145 #define SAFERSS 8 /* nominal ``small'' resident set size 146 protected against replacement */ 147 148 /* 149 * There are two clock hands, initially separated by HANDSPREAD bytes 150 * (but at most all of user memory). The amount of time to reclaim 151 * a page once the pageout process examines it increases with this 152 * distance and decreases as the scan rate rises. 153 */ 154 155 #define HANDSPREAD (2 * 1024 * 1024) 156 157 /* 158 * The number of times per second to recompute the desired paging rate 159 * and poke the pagedaemon. 160 */ 161 162 #define RATETOSCHEDPAGING 4 163 164 /* 165 * Believed threshold (in megabytes) for which interleaved 166 * swapping area is desirable. 167 */ 168 169 #define LOTSOFMEM 2 170 171 #define mapin(pte, v, pfnum, prot) \ 172 {(*(int *)(pte) = ((pfnum)<<PGSHIFT) | (prot)) ; } 173 174 /* 175 * Mach derived constants 176 */ 177 178 /* user/kernel map constants */ 179 #define VM_MIN_ADDRESS ((vm_offset_t)0) 180 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x7FFFE000) 181 #define VM_MAX_ADDRESS ((vm_offset_t)0xC0000000) 182 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0x80000000) 183 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(VM_MIN_KERNEL_ADDRESS+\ 184 (VM_KERNEL_PT_PAGES*0x10000))) 185 186 /* virtual sizes (bytes) for various kernel submaps */ 187 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 188 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 189 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 190 191 /* pcb base */ 192 #define pcbb(p) ((u_int)(p)->p_addr) 193 194