1 /* $NetBSD: vmparam.h,v 1.20 1998/10/02 19:29:49 is Exp $ */ 2 3 /* 4 * Copyright (c) 1988 University of Utah. 5 * Copyright (c) 1982, 1986, 1990 The Regents of the University of California. 6 * 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 7.3 (Berkeley) 5/7/91 43 */ 44 #ifndef _MACHINE_VMPARAM_H_ 45 #define _MACHINE_VMPARAM_H_ 46 47 #include <machine/pte.h> 48 49 /* 50 * Machine dependent constants for HP300 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 * These are a mixture of i386, sun3 and hp settings.. 60 */ 61 62 /* Sun settings. Still hope, that I might get sun3 binaries to work... */ 63 #define USRTEXT 0x2000 64 #ifndef USRSTACK 65 #define USRSTACK 0x0E000000 66 #endif 67 #define LOWPAGES btoc(USRTEXT) 68 #define KUSER_AREA (-UPAGES*NBPG) 69 /* 70 * Virtual memory related constants, all in bytes 71 */ 72 73 #ifndef MAXTSIZ 74 #define MAXTSIZ (6*1024*1024) /* max text size */ 75 #endif 76 #ifndef DFLDSIZ 77 #define DFLDSIZ (32*1024*1024) /* initial data size limit */ 78 #endif 79 #ifndef MAXDSIZ 80 #define MAXDSIZ (128*1024*1024) /* max data size */ 81 #endif 82 #ifndef DFLSSIZ 83 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 84 #endif 85 #ifndef MAXSSIZ 86 #define MAXSSIZ (32*1024*1024) /* max stack size */ 87 #endif 88 89 /* 90 * Sizes of the system and user portions of the system page table. 91 */ 92 /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 93 #define SYSPTSIZE (2 * NPTEPG) /* 16mb */ 94 #define USRPTSIZE (1 * NPTEPG) /* 16mb */ 95 96 /* 97 * PTEs for mapping user space into the kernel for phyio operations. 98 * One page is enough to handle 16Mb of simultaneous raw IO operations. 99 */ 100 #ifndef USRIOSIZE 101 #define USRIOSIZE (1 * NPTEPG) /* 16mb */ 102 #endif 103 104 /* 105 * PTEs for system V style shared memory. 106 * This is basically slop for kmempt which we actually allocate (malloc) from. 107 */ 108 #ifndef SHMMAXPGS 109 #define SHMMAXPGS (1 * NPTEPG) /* 16mb */ 110 #endif 111 112 /* 113 * The time for a process to be blocked before being very swappable. 114 * This is a number of seconds which the system takes as being a non-trivial 115 * amount of real time. You probably shouldn't change this; 116 * it is used in subtle ways (fractions and multiples of it are, that is, like 117 * half of a ``long time'', almost a long time, etc.) 118 * It is related to human patience and other factors which don't really 119 * change over time. 120 */ 121 #define MAXSLP 20 122 123 /* 124 * A swapped in process is given a small amount of core without being bothered 125 * by the page replacement algorithm. Basically this says that if you are 126 * swapped in you deserve some resources. We protect the last SAFERSS 127 * pages against paging and will just swap you out rather than paging you. 128 * Note that each process has at least UPAGES+CLSIZE pages which are not 129 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 130 * number just means a swapped in process is given around 25k bytes. 131 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 132 * so we loan each swapped in process memory worth 100$, or just admit 133 * that we don't consider it worthwhile and swap it out to disk which costs 134 * $30/mb or about $0.75. 135 * Update: memory prices have changed recently (9/96). At the current 136 * value of $6 per megabyte, we lend each swapped in process memory worth 137 * $0.15, or just admit that we don't consider it worthwhile and swap it out 138 * to disk which costs $0.20/MB, or just under half a cent. 139 */ 140 #define SAFERSS 4 /* nominal ``small'' resident set size 141 protected against replacement */ 142 143 /* 144 * user/kernel map constants 145 */ 146 #define VM_MIN_ADDRESS ((vm_offset_t)0) /* user min */ 147 #define VM_MAX_ADDRESS ((vm_offset_t)(USRSTACK)) /* user max */ 148 #define VM_MAXUSER_ADDRESS ((vm_offset_t)(VM_MAX_ADDRESS)) /* same */ 149 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0) 150 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(0-NBPG)) 151 152 /* 153 * virtual sizes (bytes) for various kernel submaps 154 */ 155 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 156 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 157 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 158 159 /* 160 * Our bootloader currently passes up to 16 segments (but this is variable) 161 * Normally, the biggest of them is used for the kernel, and the kernel 162 * segment is given to VM first. 163 */ 164 #define VM_PHYSSEG_MAX (16) 165 #define VM_PHYSSEG_STRAT VM_PSTRAT_RANDOM 166 #define VM_PHYSSEG_NOADD /* XXX this should be done right later */ 167 168 /* 169 * Allow supporting Zorro-II memory as lower priority: 170 * 171 * - DEFAULT for Zorro-III memory (presumably 32 bit) 172 * - ZORROII for Zorro-II memory (16 bit, Zorro-II DMA) 173 */ 174 175 #define VM_NFREELIST 2 176 #define VM_FREELIST_DEFAULT 0 177 #define VM_FREELIST_ZORROII 1 178 179 /* 180 * pmap-specific data stored in the vm_physmem[] array. 181 */ 182 struct pmap_physseg { 183 struct pv_entry *pvent; /* pv table for this seg */ 184 char *attrs; /* page attributes for this seg */ 185 }; 186 187 /* 188 * number of kernel PT pages (initial only, can grow dynamically) 189 */ 190 #define VM_KERNEL_PT_PAGES ((vm_size_t)4) /* XXX: SYSPTSIZE */ 191 #endif /* !_MACHINE_VMPARAM_H_ */ 192