vmparam3.h revision 1.12
1/* $NetBSD: vmparam3.h,v 1.12 1995/05/24 20:55:34 gwr Exp $ */ 2 3/* 4 * Copyright (c) 1994 Gordon W. Ross 5 * Copyright (c) 1993 Adam Glass 6 * Copyright (c) 1988 University of Utah. 7 * Copyright (c) 1982, 1986, 1990 The Regents of the University of California. 8 * All rights reserved. 9 * 10 * This code is derived from software contributed to Berkeley by 11 * the Systems Programming Group of the University of Utah Computer 12 * Science Department. 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 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$ 43 * from: @(#)vmparam.h 7.3 (Berkeley) 5/7/91 44 * vmparam.h,v 1.2 1993/05/22 07:58:38 cgd Exp 45 */ 46 47/* 48 * Machine dependent constants for Sun-4c SPARC 49 */ 50 51/* 52 * USRTEXT is the start of the user text/data space, while USRSTACK 53 * is the top (end) of the user stack. 54 */ 55#define USRTEXT NBPG /* Start of user text */ 56#define USRSTACK KERNBASE /* High end of user stack */ 57 58/* 59 * Virtual memory related constants, all in bytes 60 */ 61#ifndef MAXTSIZ 62#define MAXTSIZ (8*1024*1024) /* max text size */ 63#endif 64#ifndef DFLDSIZ 65#define DFLDSIZ (8*1024*1024) /* initial data size limit */ 66#endif 67#ifndef MAXDSIZ 68#define MAXDSIZ (32*1024*1024) /* max data size */ 69#endif 70#ifndef DFLSSIZ 71#define DFLSSIZ (512*1024) /* initial stack size limit */ 72#endif 73#ifndef MAXSSIZ 74#define MAXSSIZ MAXDSIZ /* max stack size */ 75#endif 76 77/* 78 * Default sizes of swap allocation chunks (see dmap.h). 79 * The actual values may be changed in vminit() based on MAXDSIZ. 80 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 81 * DMMIN should be at least ctod(1) so that vtod() works. 82 * vminit() insures this. 83 */ 84#define DMMIN 32 /* smallest swap allocation */ 85#define DMMAX 4096 /* largest potential swap allocation */ 86 87/* 88 * PTEs for mapping user space into the kernel for phyio operations. 89 * [this figure is based on the assumption that you can put ptes in real 90 * memory. this is a false assumption on a sun3] 91 * 92 */ 93#ifndef USRIOSIZE 94#define USRIOSIZE 1 95#endif 96 97/* 98 * The time for a process to be blocked before being very swappable. 99 * This is a number of seconds which the system takes as being a non-trivial 100 * amount of real time. You probably shouldn't change this; 101 * it is used in subtle ways (fractions and multiples of it are, that is, like 102 * half of a ``long time'', almost a long time, etc.) 103 * It is related to human patience and other factors which don't really 104 * change over time. 105 */ 106#define MAXSLP 20 107 108/* 109 * A swapped in process is given a small amount of core without being bothered 110 * by the page replacement algorithm. Basically this says that if you are 111 * swapped in you deserve some resources. We protect the last SAFERSS 112 * pages against paging and will just swap you out rather than paging you. 113 * Note that each process has at least UPAGES+CLSIZE pages which are not 114 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 115 * number just means a swapped in process is given around 25k bytes. 116 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 117 * so we loan each swapped in process memory worth 100$, or just admit 118 * that we don't consider it worthwhile and swap it out to disk which costs 119 * $30/mb or about $0.75. 120 */ 121#define SAFERSS 4 /* nominal ``small'' resident set size 122 protected against replacement */ 123 124#define DVMA_SPACE_SIZE 0x00100000 125#define DVMA_SPACE_START 0x0FD00000 126#define DVMA_SPACE_END 0x0FE00000 /* mon start */ 127 128/* This is where access by other VME masters starts. */ 129#define DVMA_SLAVE_BASE 0x0F000000 130 131/* 132 * Mach derived constants 133 */ 134 135/* user/kernel map constants */ 136#define VM_MIN_ADDRESS ((vm_offset_t)0) 137#define VM_MAX_ADDRESS ((vm_offset_t)KERNBASE) 138#define VM_MAXUSER_ADDRESS ((vm_offset_t)KERNBASE) 139#define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)KERNBASE) 140#define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)DVMA_SPACE_START) 141 142/* virtual sizes (bytes) for various kernel submaps */ 143#define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 144#define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 145#define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 146