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