1 /* 2 * Copyright (c) 1988 University of Utah. 3 * Copyright (c) 1982, 1986, 1990 The Regents of the University of California. 4 * All rights reserved. 5 * 6 * This code is derived from software contributed to Berkeley by 7 * the Systems Programming Group of the University of Utah Computer 8 * Science Department. 9 * 10 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$ 39 * 40 * @(#)vmparam.h 7.3 (Berkeley) 5/7/91 41 * $Id: vmparam.h,v 1.12 1994/07/02 21:16:36 chopps Exp $ 42 */ 43 #ifndef _MACHINE_VMPARAM_H_ 44 #define _MACHINE_VMPARAM_H_ 45 46 #include <machine/pte.h> 47 48 /* 49 * Machine dependent constants for HP300 50 */ 51 /* 52 * USRTEXT is the start of the user text/data space, while USRSTACK 53 * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are 54 * the number of pages from the beginning of the P0 region to the 55 * beginning of the text and from the beginning of the P1 region to the 56 * beginning of the stack respectively. 57 * 58 * These are a mixture of i386, sun3 and hp settings.. 59 */ 60 61 /* Sun settings. Still hope, that I might get sun3 binaries to work... */ 62 #define USRTEXT 0x2000 63 #define USRSTACK 0x0E000000 64 #define LOWPAGES btoc(USRTEXT) 65 #define KUSER_AREA (-UPAGES*NBPG) 66 /* 67 * Virtual memory related constants, all in bytes 68 */ 69 70 #ifndef MAXTSIZ 71 #define MAXTSIZ (6*1024*1024) /* max text size */ 72 #endif 73 #ifndef DFLDSIZ 74 #define DFLDSIZ (32*1024*1024) /* initial data size limit */ 75 #endif 76 #ifndef MAXDSIZ 77 #define MAXDSIZ (32*1024*1024) /* max data size */ 78 #endif 79 #ifndef DFLSSIZ 80 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 81 #endif 82 #ifndef MAXSSIZ 83 #define MAXSSIZ MAXDSIZ /* max stack size */ 84 #endif 85 86 /* 87 * Default sizes of swap allocation chunks (see dmap.h). 88 * The actual values may be changed in vminit() based on MAXDSIZ. 89 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 90 * DMMIN should be at least ctod(1) so that vtod() works. 91 * vminit() insures this. 92 */ 93 #define DMMIN 32 /* smallest swap allocation */ 94 #define DMMAX NBPG /* largest potential swap allocation */ 95 96 /* 97 * Sizes of the system and user portions of the system page table. 98 */ 99 /* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 100 #define SYSPTSIZE (2 * NPTEPG) /* 16mb */ 101 #define USRPTSIZE (1 * NPTEPG) /* 16mb */ 102 103 /* 104 * PTEs for mapping user space into the kernel for phyio operations. 105 * One page is enough to handle 16Mb of simultaneous raw IO operations. 106 */ 107 #ifndef USRIOSIZE 108 #define USRIOSIZE (1 * NPTEPG) /* 16mb */ 109 #endif 110 111 /* 112 * PTEs for system V style shared memory. 113 * This is basically slop for kmempt which we actually allocate (malloc) from. 114 */ 115 #ifndef SHMMAXPGS 116 #define SHMMAXPGS (1 * NPTEPG) /* 16mb */ 117 #endif 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 #define MAXSLP 20 129 130 /* 131 * A swapped in process is given a small amount of core without being bothered 132 * by the page replacement algorithm. Basically this says that if you are 133 * swapped in you deserve some resources. We protect the last SAFERSS 134 * pages against paging and will just swap you out rather than paging you. 135 * Note that each process has at least UPAGES+CLSIZE pages which are not 136 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 137 * number just means a swapped in process is given around 25k bytes. 138 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 139 * so we loan each swapped in process memory worth 100$, or just admit 140 * that we don't consider it worthwhile and swap it out to disk which costs 141 * $30/mb or about $0.75. 142 */ 143 #define SAFERSS 4 /* nominal ``small'' resident set size 144 protected against replacement */ 145 146 /* 147 * user/kernel map constants 148 */ 149 #define VM_MIN_ADDRESS ((vm_offset_t)0) 150 #define VM_MAXUSER_ADDRESS ((vm_offset_t)(USRSTACK)) 151 #define VM_MAX_ADDRESS ((vm_offset_t)(0-(UPAGES*NBPG))) 152 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0) 153 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(0-NBPG)) 154 155 /* 156 * virtual sizes (bytes) for various kernel submaps 157 */ 158 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 159 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 160 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 161 162 /* 163 * number of kernel PT pages (initial only, can grow dynamically) 164 */ 165 #define VM_KERNEL_PT_PAGES ((vm_size_t)2) /* XXX: SYSPTSIZE */ 166 #endif /* !_MACHINE_VMPARAM_H_ */ 167