vmparam.h revision 1.3
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.3 1994/04/18 07:17:45 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 * Size of shared memory map 91 */ 92#ifndef SHMMAXPGS 93#define SHMMAXPGS 1024 94#endif 95 96/* 97 * The time for a process to be blocked before being very swappable. 98 * This is a number of seconds which the system takes as being a non-trivial 99 * amount of real time. You probably shouldn't change this; 100 * it is used in subtle ways (fractions and multiples of it are, that is, like 101 * half of a ``long time'', almost a long time, etc.) 102 * It is related to human patience and other factors which don't really 103 * change over time. 104 */ 105#define MAXSLP 20 106 107/* 108 * A swapped in process is given a small amount of core without being bothered 109 * by the page replacement algorithm. Basically this says that if you are 110 * swapped in you deserve some resources. We protect the last SAFERSS 111 * pages against paging and will just swap you out rather than paging you. 112 * Note that each process has at least UPAGES+CLSIZE pages which are not 113 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 114 * number just means a swapped in process is given around 25k bytes. 115 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 116 * so we loan each swapped in process memory worth 100$, or just admit 117 * that we don't consider it worthwhile and swap it out to disk which costs 118 * $30/mb or about $0.75. 119 */ 120#define SAFERSS 4 /* nominal ``small'' resident set size 121 protected against replacement */ 122 123/* 124 * Mach derived constants 125 */ 126 127/* 128 * User/kernel map constants. Note that sparc/vaddrs.h defines the 129 * IO space virtual base, which must be the same as VM_MAX_KERNEL_ADDRESS: 130 * tread with care. 131 */ 132#define VM_MIN_ADDRESS ((vm_offset_t)0) 133#define VM_MAX_ADDRESS ((vm_offset_t)KERNBASE) 134#define VM_MAXUSER_ADDRESS ((vm_offset_t)KERNBASE) 135#define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)KERNBASE) 136#define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xfe000000) 137 138/* virtual sizes (bytes) for various kernel submaps */ 139#define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 140#define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 141