1 /* $NetBSD: vmparam.h,v 1.15 1997/07/12 16:20:38 perry 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 (8*1024*1024) /* max text size */ 69 #endif 70 #ifndef MAXDSIZ 71 #define MAXDSIZ (24*1024*1024) /* max data size */ 72 #endif 73 #ifndef MAXSSIZ 74 #define MAXSSIZ (8*1024*1024) /* max stack size */ 75 #endif 76 #ifndef DFLDSIZ 77 #define DFLDSIZ (16*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 * All mmap()'ed data will be mapped above MAXDSIZ. This means that 85 * pte space must be allocated for (possible) mmap()'ed data. 86 * Note: This is just a hint, if we mmap() more than this the page 87 * table will be expanded. (at the cost of speed). 88 */ 89 #define MMAPSPACE (24*1024*1024) 90 91 /* 92 * Size of shared memory map 93 */ 94 95 #ifndef SHMMAXPGS 96 #define SHMMAXPGS 64 /* XXXX should be 1024 */ 97 #endif 98 99 /* 100 * Size of User Raw I/O map 101 */ 102 #define USRIOSIZE 300 103 104 /* 105 * The time for a process to be blocked before being very swappable. 106 * This is a number of seconds which the system takes as being a non-trivial 107 * amount of real time. You probably shouldn't change this; 108 * it is used in subtle ways (fractions and multiples of it are, that is, like 109 * half of a ``long time'', almost a long time, etc.) 110 * It is related to human patience and other factors which don't really 111 * change over time. 112 */ 113 114 #define MAXSLP 20 115 116 /* 117 * A swapped in process is given a small amount of core without being bothered 118 * by the page replacement algorithm. Basically this says that if you are 119 * swapped in you deserve some resources. We protect the last SAFERSS 120 * pages against paging and will just swap you out rather than paging you. 121 * Note that each process has at least UPAGES+CLSIZE pages which are not 122 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 123 * number just means a swapped in process is given around 25k bytes. 124 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 125 * so we loan each swapped in process memory worth 100$, or just admit 126 * that we don't consider it worthwhile and swap it out to disk which costs 127 * $30/mb or about $0.75. 128 * Update: memory prices have changed recently (9/96). At the current 129 * value of $6 per megabyte, we lend each swapped in process memory worth 130 * $0.15, or just admit that we don't consider it worthwhile and swap it out 131 * to disk which costs $0.20/MB, or just under half a cent. 132 */ 133 134 #define SAFERSS 8 /* nominal ``small'' resident set size 135 protected against replacement */ 136 137 #define mapin(pte, v, pfnum, prot) \ 138 {(*(int *)(pte) = ((pfnum)<<PGSHIFT) | (prot)) ; } 139 140 /* 141 * Mach derived constants 142 */ 143 144 /* user/kernel map constants */ 145 #define VM_MIN_ADDRESS ((vm_offset_t)0) 146 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x7FFFE000) 147 #define VM_MAX_ADDRESS ((vm_offset_t)0xC0000000) 148 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0x80000000) 149 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(VM_MIN_KERNEL_ADDRESS+\ 150 (VM_KERNEL_PT_PAGES*0x10000))) 151 152 /* virtual sizes (bytes) for various kernel submaps */ 153 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 154 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 155 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 156 157 /* pcb base */ 158 #define pcbb(p) ((u_int)(p)->p_addr) 159 160