vmparam.h revision 1.29
1 /* $NetBSD: vmparam.h,v 1.29 1998/08/13 21:36:05 thorpej 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 * Redistribution and use in source and binary forms, with or without 11 * modification, are permitted provided that the following conditions 12 * are met: 13 * 1. Redistributions of source code must retain the above copyright 14 * notice, this list of conditions and the following disclaimer. 15 * 2. Redistributions in binary form must reproduce the above copyright 16 * notice, this list of conditions and the following disclaimer in the 17 * documentation and/or other materials provided with the distribution. 18 * 3. All advertising materials mentioning features or use of this software 19 * must display the following acknowledgement: 20 * This product includes software developed by the University of 21 * California, Berkeley and its contributors. 22 * 4. Neither the name of the University nor the names of its contributors 23 * may be used to endorse or promote products derived from this software 24 * without specific prior written permission. 25 * 26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 36 * SUCH DAMAGE. 37 * 38 * @(#)vmparam.h 5.9 (Berkeley) 5/12/91 39 */ 40 41 #ifndef _VMPARAM_H_ 42 #define _VMPARAM_H_ 43 44 #if defined(_KERNEL) && !defined(_LKM) 45 #include "opt_pmap_new.h" 46 #endif 47 48 /* 49 * Machine dependent constants for 386. 50 */ 51 52 /* 53 * Virtual address space arrangement. On 386, both user and kernel 54 * share the address space, not unlike the vax. 55 * USRTEXT is the start of the user text/data space, while USRSTACK 56 * is the top (end) of the user stack. Immediately above the user stack 57 * resides the user structure, which is UPAGES long and contains the 58 * kernel stack. 59 * 60 * Immediately after the user structure is the page table map, and then 61 * kernal address space. 62 */ 63 #define USRTEXT CLBYTES 64 #define USRSTACK VM_MAXUSER_ADDRESS 65 66 /* 67 * Virtual memory related constants, all in bytes 68 */ 69 #define MAXTSIZ (64*1024*1024) /* max text size */ 70 #ifndef DFLDSIZ 71 #define DFLDSIZ (128*1024*1024) /* initial data size limit */ 72 #endif 73 #ifndef MAXDSIZ 74 #define MAXDSIZ (1*1024*1024*1024) /* max data size */ 75 #endif 76 #ifndef DFLSSIZ 77 #define DFLSSIZ (2*1024*1024) /* initial stack size limit */ 78 #endif 79 #ifndef MAXSSIZ 80 #define MAXSSIZ (32*1024*1024) /* max stack size */ 81 #endif 82 83 /* 84 * Size of shared memory map 85 */ 86 #ifndef SHMMAXPGS 87 #define SHMMAXPGS 1024 88 #endif 89 90 /* 91 * Size of User Raw I/O map 92 */ 93 #define USRIOSIZE 300 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 #define MAXSLP 20 105 106 /* 107 * A swapped in process is given a small amount of core without being bothered 108 * by the page replacement algorithm. Basically this says that if you are 109 * swapped in you deserve some resources. We protect the last SAFERSS 110 * pages against paging and will just swap you out rather than paging you. 111 * Note that each process has at least UPAGES+CLSIZE pages which are not 112 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 113 * number just means a swapped in process is given around 25k bytes. 114 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 115 * so we loan each swapped in process memory worth 100$, or just admit 116 * that we don't consider it worthwhile and swap it out to disk which costs 117 * $30/mb or about $0.75. 118 * { wfj 6/16/89: Retail AT memory expansion $800/megabyte, loan of $17 119 * on disk costing $7/mb or $0.18 (in memory still 100:1 in cost!) } 120 * Update: memory prices have changed recently (9/96). At the current 121 * value of $6 per megabyte, we lend each swapped in process memory worth 122 * $0.15, or just admit that we don't consider it worthwhile and swap it out 123 * to disk which costs $0.20/MB, or just under half a cent. 124 */ 125 #define SAFERSS 8 /* nominal ``small'' resident set size 126 protected against replacement */ 127 128 /* 129 * Mach derived constants 130 */ 131 132 /* user/kernel map constants */ 133 #define VM_MIN_ADDRESS ((vaddr_t)0) 134 /* PTDPTDI<<PDSHIFT - UPAGES*NBPG */ 135 #define VM_MAXUSER_ADDRESS ((vaddr_t)0xefbfe000) 136 /* PTDPTDI<<PDSHIFT + PTDPTDI<<PGSHIFT */ 137 #define VM_MAX_ADDRESS ((vaddr_t)0xeffbf000) 138 /* KPTDI<<PDSHIFT */ 139 #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)0xf0000000) 140 /* APTDPTDI<<PDSHIFT */ 141 #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)0xffc00000) 142 143 /* XXX max. amount of KVM to be used by buffers. */ 144 #ifndef VM_MAX_KERNEL_BUF 145 #define VM_MAX_KERNEL_BUF \ 146 ((VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) * 7 / 10) 147 #endif 148 149 /* virtual sizes (bytes) for various kernel submaps */ 150 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 151 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 152 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 153 154 #define MACHINE_NEW_NONCONTIG /* VM <=> pmap interface modifier */ 155 156 #define VM_PHYSSEG_MAX 3 /* 1 "hole" + 2 free lists */ 157 #define VM_PHYSSEG_STRAT VM_PSTRAT_BIGFIRST 158 #define VM_PHYSSEG_NOADD /* can't add RAM after vm_mem_init */ 159 160 #define VM_NFREELIST 2 161 #define VM_FREELIST_DEFAULT 0 162 #define VM_FREELIST_FIRST16 1 163 164 /* 165 * pmap specific data stored in the vm_physmem[] array 166 */ 167 #if defined(PMAP_NEW) 168 struct pmap_physseg { 169 struct pv_head *pvhead; /* pv_head array */ 170 char *attrs; /* attrs array */ 171 }; 172 #else 173 struct pmap_physseg { 174 struct pv_entry *pvent; /* pv_entry array */ 175 char *attrs; /* attrs array */ 176 }; 177 #endif 178 179 #endif /* _VMPARAM_H_ */ 180
Indexes created Fri Sep 26 20:09:58 GMT 2025