1 /* $NetBSD: vmparam.h,v 1.1.1.1 1995/03/26 07:12:07 leo 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 45 #ifndef _MACHINE_VMPARAM_H_ 46 #define _MACHINE_VMPARAM_H_ 47 48 #include <machine/pte.h> 49 50 /* 51 * Machine dependent constants for HP300 52 */ 53 /* 54 * USRTEXT is the start of the user text/data space, while USRSTACK 55 * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are 56 * the number of pages from the beginning of the P0 region to the 57 * beginning of the text and from the beginning of the P1 region to the 58 * beginning of the stack respectively. 59 * 60 * These are a mixture of i386, sun3 and hp settings.. 61 */ 62 63 /* Sun settings. Still hope, that I might get sun3 binaries to work... */ 64 #define USRTEXT 0x2000 65 #define USRSTACK 0x0E000000 66 #define LOWPAGES btoc(USRTEXT) 67 #define KUSER_AREA (-UPAGES*NBPG) 68 /* 69 * Virtual memory related constants, all in bytes 70 */ 71 72 #ifndef MAXTSIZ 73 #define MAXTSIZ (6*1024*1024) /* max text size */ 74 #endif 75 #ifndef DFLDSIZ 76 #define DFLDSIZ (32*1024*1024) /* initial data size limit */ 77 #endif 78 #ifndef MAXDSIZ 79 #define MAXDSIZ (32*1024*1024) /* max data size */ 80 #endif 81 #ifndef DFLSSIZ 82 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 83 #endif 84 #ifndef MAXSSIZ 85 #define MAXSSIZ MAXDSIZ /* max stack size */ 86 #endif 87 88 /* 89 * Default sizes of swap allocation chunks (see dmap.h). 90 * The actual values may be changed in vminit() based on MAXDSIZ. 91 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 92 * DMMIN should be at least ctod(1) so that vtod() works. 93 * vminit() insures this. 94 */ 95 #define DMMIN 32 /* smallest swap allocation */ 96 #define DMMAX NBPG /* largest potential swap allocation */ 97 98 /* 99 * Sizes of the system and user portions of the system page table. 100 */ 101 /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 102 #define SYSPTSIZE (2 * NPTEPG) /* 16mb */ 103 #define USRPTSIZE (1 * NPTEPG) /* 16mb */ 104 105 /* 106 * PTEs for mapping user space into the kernel for phyio operations. 107 * One page is enough to handle 16Mb of simultaneous raw IO operations. 108 */ 109 #ifndef USRIOSIZE 110 #define USRIOSIZE (1 * NPTEPG) /* 16mb */ 111 #endif 112 113 /* 114 * PTEs for system V style shared memory. 115 * This is basically slop for kmempt which we actually allocate (malloc) from. 116 */ 117 #ifndef SHMMAXPGS 118 #define SHMMAXPGS (1 * NPTEPG) /* 16mb */ 119 #endif 120 121 /* 122 * The time for a process to be blocked before being very swappable. 123 * This is a number of seconds which the system takes as being a non-trivial 124 * amount of real time. You probably shouldn't change this; 125 * it is used in subtle ways (fractions and multiples of it are, that is, like 126 * half of a ``long time'', almost a long time, etc.) 127 * It is related to human patience and other factors which don't really 128 * change over time. 129 */ 130 #define MAXSLP 20 131 132 /* 133 * A swapped in process is given a small amount of core without being bothered 134 * by the page replacement algorithm. Basically this says that if you are 135 * swapped in you deserve some resources. We protect the last SAFERSS 136 * pages against paging and will just swap you out rather than paging you. 137 * Note that each process has at least UPAGES+CLSIZE pages which are not 138 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 139 * number just means a swapped in process is given around 25k bytes. 140 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 141 * so we loan each swapped in process memory worth 100$, or just admit 142 * that we don't consider it worthwhile and swap it out to disk which costs 143 * $30/mb or about $0.75. 144 */ 145 #define SAFERSS 4 /* nominal ``small'' resident set size 146 protected against replacement */ 147 148 /* 149 * user/kernel map constants 150 */ 151 #define VM_MIN_ADDRESS ((vm_offset_t)0) 152 #define VM_MAXUSER_ADDRESS ((vm_offset_t)(USRSTACK)) 153 #define VM_MAX_ADDRESS ((vm_offset_t)(0-(UPAGES*NBPG))) 154 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0) 155 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(0-NBPG)) 156 157 /* 158 * virtual sizes (bytes) for various kernel submaps 159 */ 160 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 161 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 162 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 163 164 /* 165 * number of kernel PT pages (initial only, can grow dynamically) 166 */ 167 #define VM_KERNEL_PT_PAGES ((vm_size_t)2) /* XXX: SYSPTSIZE */ 168 #endif /* !_MACHINE_VMPARAM_H_ */ 169