1 /* 2 * Copyright (c) 1992, 1993 3 * The Regents of the University of California. All rights reserved. 4 * 5 * This software was developed by the Computer Systems Engineering group 6 * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 7 * contributed to Berkeley. 8 * 9 * All advertising materials mentioning features or use of this software 10 * must display the following acknowledgement: 11 * This product includes software developed by the University of 12 * California, Lawrence Berkeley Laboratory. 13 * 14 * Redistribution and use in source and binary forms, with or without 15 * modification, are permitted provided that the following conditions 16 * are met: 17 * 1. Redistributions of source code must retain the above copyright 18 * notice, this list of conditions and the following disclaimer. 19 * 2. Redistributions in binary form must reproduce the above copyright 20 * notice, this list of conditions and the following disclaimer in the 21 * documentation and/or other materials provided with the distribution. 22 * 3. All advertising materials mentioning features or use of this software 23 * must display the following acknowledgement: 24 * This product includes software developed by the University of 25 * California, Berkeley and its contributors. 26 * 4. Neither the name of the University nor the names of its contributors 27 * may be used to endorse or promote products derived from this software 28 * without specific prior written permission. 29 * 30 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 33 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 40 * SUCH DAMAGE. 41 * 42 * @(#)vmparam.h 8.1 (Berkeley) 6/11/93 43 * 44 * from: Header: vmparam.h,v 1.8 93/05/25 09:52:16 torek Exp 45 * $Id: vmparam.h,v 1.2 1993/10/11 02:28:31 deraadt Exp $ 46 */ 47 48 /* 49 * Machine dependent constants for Sun-4c SPARC 50 */ 51 52 /* 53 * USRTEXT is the start of the user text/data space, while USRSTACK 54 * is the top (end) of the user stack. 55 */ 56 #define USRTEXT 0x2000 /* Start of user text */ 57 #define USRSTACK KERNBASE /* Start of user stack */ 58 59 /* 60 * Virtual memory related constants, all in bytes 61 */ 62 #ifndef MAXTSIZ 63 #define MAXTSIZ (8*1024*1024) /* max text size */ 64 #endif 65 #ifndef DFLDSIZ 66 #define DFLDSIZ (16*1024*1024) /* initial data size limit */ 67 #endif 68 #ifndef MAXDSIZ 69 #define MAXDSIZ (64*1024*1024) /* max data size */ 70 #endif 71 #ifndef DFLSSIZ 72 #define DFLSSIZ (512*1024) /* initial stack size limit */ 73 #endif 74 #ifndef MAXSSIZ 75 #define MAXSSIZ MAXDSIZ /* max stack size */ 76 #endif 77 78 /* 79 * Default sizes of swap allocation chunks (see dmap.h). 80 * The actual values may be changed in vminit() based on MAXDSIZ. 81 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 82 * DMMIN should be at least ctod(1) so that vtod() works. 83 * vminit() insures this. 84 */ 85 #define DMMIN 32 /* smallest swap allocation */ 86 #define DMMAX 4096 /* largest potential swap allocation */ 87 #define DMTEXT 1024 /* swap allocation for text */ 88 89 /* 90 * The time for a process to be blocked before being very swappable. 91 * This is a number of seconds which the system takes as being a non-trivial 92 * amount of real time. You probably shouldn't change this; 93 * it is used in subtle ways (fractions and multiples of it are, that is, like 94 * half of a ``long time'', almost a long time, etc.) 95 * It is related to human patience and other factors which don't really 96 * change over time. 97 */ 98 #define MAXSLP 20 99 100 /* 101 * A swapped in process is given a small amount of core without being bothered 102 * by the page replacement algorithm. Basically this says that if you are 103 * swapped in you deserve some resources. We protect the last SAFERSS 104 * pages against paging and will just swap you out rather than paging you. 105 * Note that each process has at least UPAGES+CLSIZE pages which are not 106 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 107 * number just means a swapped in process is given around 25k bytes. 108 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 109 * so we loan each swapped in process memory worth 100$, or just admit 110 * that we don't consider it worthwhile and swap it out to disk which costs 111 * $30/mb or about $0.75. 112 */ 113 #define SAFERSS 4 /* nominal ``small'' resident set size 114 protected against replacement */ 115 116 /* 117 * Mach derived constants 118 */ 119 120 /* 121 * User/kernel map constants. Note that sparc/vaddrs.h defines the 122 * IO space virtual base, which must be the same as VM_MAX_KERNEL_ADDRESS: 123 * tread with care. 124 */ 125 #define VM_MIN_ADDRESS ((vm_offset_t)0) 126 #define VM_MAX_ADDRESS ((vm_offset_t)KERNBASE) 127 #define VM_MAXUSER_ADDRESS ((vm_offset_t)KERNBASE) 128 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)KERNBASE) 129 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xfe000000) 130 131 /* virtual sizes (bytes) for various kernel submaps */ 132 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 133 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 134