1 /* $NetBSD: vmparam3x.h,v 1.2 1997/06/12 15:09:39 mrg 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 * from: @(#)vmparam.h 7.3 (Berkeley) 5/7/91 42 * vmparam.h,v 1.2 1993/05/22 07:58:38 cgd Exp 43 */ 44 45 /* 46 * Machine dependent constants for Sun3x 47 */ 48 49 /* 50 * USRTEXT is the start of the user text/data space, while 51 * USRSTACK is the top (end) of the user stack. 52 */ 53 #define USRTEXT NBPG /* Start of user text */ 54 #define USRSTACK KERNBASE /* High end of user stack */ 55 56 /* 57 * Virtual memory related constants, all in bytes 58 */ 59 #ifndef MAXTSIZ 60 #define MAXTSIZ (8*1024*1024) /* max text size */ 61 #endif 62 #ifndef DFLDSIZ 63 #define DFLDSIZ (32*1024*1024) /* initial data size limit */ 64 #endif 65 #ifndef MAXDSIZ 66 #define MAXDSIZ (128*1024*1024) /* max data size */ 67 #endif 68 #ifndef DFLSSIZ 69 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 70 #endif 71 #ifndef MAXSSIZ 72 #define MAXSSIZ (32*1024*1024) /* max stack size */ 73 #endif 74 75 /* 76 * PTEs for mapping user space into the kernel for phyio operations. 77 * The actual limitation for physio requests will be the DVMA space, 78 * and that is fixed by hardware design at 16MB. We could make the 79 * physio map larger than that, but it would not buy us much. 80 */ 81 #ifndef USRIOSIZE 82 #define USRIOSIZE 2048 /* 16 MB */ 83 #endif 84 85 /* 86 * PTEs for system V style shared memory. 87 * This is basically slop for kmempt which we actually allocate (malloc) from. 88 */ 89 #ifndef SHMMAXPGS 90 #define SHMMAXPGS 2048 /* 16 MB */ 91 #endif 92 93 /* 94 * The time for a process to be blocked before being very swappable. 95 * This is a number of seconds which the system takes as being a non-trivial 96 * amount of real time. You probably shouldn't change this; 97 * it is used in subtle ways (fractions and multiples of it are, that is, like 98 * half of a ``long time'', almost a long time, etc.) 99 * It is related to human patience and other factors which don't really 100 * change over time. 101 */ 102 #define MAXSLP 20 103 104 /* 105 * A swapped in process is given a small amount of core without being bothered 106 * by the page replacement algorithm. Basically this says that if you are 107 * swapped in you deserve some resources. We protect the last SAFERSS 108 * pages against paging and will just swap you out rather than paging you. 109 * Note that each process has at least UPAGES+CLSIZE pages which are not 110 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 111 * number just means a swapped in process is given around 25k bytes. 112 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 113 * so we loan each swapped in process memory worth 100$, or just admit 114 * that we don't consider it worthwhile and swap it out to disk which costs 115 * $30/mb or about $0.75. 116 */ 117 #define SAFERSS 4 /* nominal ``small'' resident set size 118 protected against replacement */ 119 120 /* 121 * Mach-derived constants, virtual memory map: 122 * 123 * 0000.0000 user space 124 * F800.0000 kernel space 125 * FE00.0000 monitor map (devices) 126 * FF00.0000 DVMA space 127 */ 128 129 /* user/kernel map constants */ 130 #define VM_MIN_ADDRESS ((vm_offset_t)0) 131 #define VM_MAX_ADDRESS ((vm_offset_t)KERNBASE) 132 #define VM_MAXUSER_ADDRESS ((vm_offset_t)KERNBASE) 133 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)KERNBASE) 134 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)KERN_END) 135 136 /* virtual sizes (bytes) for various kernel submaps */ 137 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 138 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 139 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 140 141 #define MACHINE_NONCONTIG /* VM <=> pmap interface modifier */ 142