1 /* $NetBSD: vmparam.h,v 1.28 1999/12/12 14:39:19 ragge Exp $ */ 2 3 /*- 4 * Copyright (c) 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 * William Jolitz. 9 * 10 * Slightly modified for the VAX port /IC 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 * @(#)vmparam.h 5.9 (Berkeley) 5/12/91 41 */ 42 #ifndef _VMPARAM_H_ 43 #define _VMPARAM_H_ 44 45 /* 46 * Machine dependent constants for VAX. 47 */ 48 49 /* 50 * USRTEXT is the start of the user text/data space, while USRSTACK 51 * is the top (end) of the user stack. Immediately above the user stack 52 * resides kernel. 53 * 54 */ 55 56 #define USRTEXT NBPG 57 #define USRSTACK KERNBASE 58 59 /* 60 * Virtual memory related constants, all in bytes 61 */ 62 63 #ifndef MAXTSIZ 64 #define MAXTSIZ (8*1024*1024) /* max text size */ 65 #endif 66 #ifndef MAXDSIZ 67 #define MAXDSIZ (24*1024*1024) /* max data size */ 68 #endif 69 #ifndef MAXSSIZ 70 #define MAXSSIZ (8*1024*1024) /* max stack size */ 71 #endif 72 #ifndef DFLDSIZ 73 #define DFLDSIZ (16*1024*1024) /* initial data size limit */ 74 #endif 75 #ifndef DFLSSIZ 76 #define DFLSSIZ (512*1024) /* initial stack size limit */ 77 #endif 78 79 /* 80 * All mmap()'ed data will be mapped above MAXDSIZ. This means that 81 * pte space must be allocated for (possible) mmap()'ed data. 82 * Note: This is just a hint, if we mmap() more than this the page 83 * table will be expanded. (at the cost of speed). 84 */ 85 #define MMAPSPACE (8*1024*1024) 86 87 /* 88 * Size of shared memory map 89 */ 90 91 #ifndef SHMMAXPGS 92 #define SHMMAXPGS 64 /* XXXX should be 1024 */ 93 #endif 94 95 /* 96 * The time for a process to be blocked before being very swappable. 97 * This is a number of seconds which the system takes as being a non-trivial 98 * amount of real time. You probably shouldn't change this; 99 * it is used in subtle ways (fractions and multiples of it are, that is, like 100 * half of a ``long time'', almost a long time, etc.) 101 * It is related to human patience and other factors which don't really 102 * change over time. 103 */ 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 * Update: memory prices have changed recently (9/96). At the current 120 * value of $6 per megabyte, we lend each swapped in process memory worth 121 * $0.15, or just admit that we don't consider it worthwhile and swap it out 122 * to disk which costs $0.20/MB, or just under half a cent. 123 */ 124 125 #define SAFERSS 8 /* nominal ``small'' resident set size 126 protected against replacement */ 127 #define VM_PHYSSEG_MAX 1 128 #define VM_PHYSSEG_NOADD 129 #define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH /* XXX */ 130 131 #define VM_NFREELIST 1 132 #define VM_FREELIST_DEFAULT 0 133 134 struct pmap_physseg { 135 int dummy; 136 }; 137 138 /* MD round macros */ 139 #define vax_round_page(x) (((vaddr_t)(x) + VAX_PGOFSET) & ~VAX_PGOFSET) 140 #define vax_trunc_page(x) ((vaddr_t)(x) & ~VAX_PGOFSET) 141 142 /* 143 * Mach derived constants 144 */ 145 146 /* user/kernel map constants */ 147 #define VM_MIN_ADDRESS ((vm_offset_t)0) 148 #define VM_MAXUSER_ADDRESS ((vm_offset_t)KERNBASE) 149 #define VM_MAX_ADDRESS ((vm_offset_t)KERNBASE) 150 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)KERNBASE) 151 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(0xC0000000)) 152 153 /* virtual sizes (bytes) for various kernel submaps */ 154 #define VM_KMEM_SIZE (NKMEMCLUSTERS * NBPG) 155 156 #endif 157