vmparam.h revision 1.3.2.1
1 /* $NetBSD: vmparam.h,v 1.3.2.1 1997/06/01 04:12:42 cgd Exp $ */ 2 3 /* 4 * Copyright (c) 1988 University of Utah. 5 * Copyright (c) 1992, 1993 6 * The Regents of the University of California. All rights reserved. 7 * 8 * This code is derived from software contributed to Berkeley by 9 * the Systems Programming Group of the University of Utah Computer 10 * Science Department and Ralph Campbell. 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 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$ 41 * 42 * @(#)vmparam.h 8.2 (Berkeley) 4/22/94 43 */ 44 45 /* 46 * Machine dependent constants for Alpha. 47 */ 48 /* 49 * USRTEXT is the start of the user text/data space, while USRSTACK 50 * is the top (end) of the user stack. Immediately above the user stack 51 * resides the user structure, which is UPAGES long and contains the 52 * kernel stack. 53 */ 54 #define USRTEXT CLBYTES 55 #define USRSTACK VM_MAXUSER_ADDRESS 56 57 /* 58 * Virtual memory related constants, all in bytes 59 */ 60 #ifndef MAXTSIZ 61 #define MAXTSIZ (1<<30) /* max text size (1G) */ 62 #endif 63 #ifndef DFLDSIZ 64 #define DFLDSIZ (1<<27) /* initial data size (128M) */ 65 #endif 66 #ifndef MAXDSIZ 67 #define MAXDSIZ (1<<30) /* max data size (1G) */ 68 #endif 69 #ifndef DFLSSIZ 70 #define DFLSSIZ (1<<21) /* initial stack size (2M) */ 71 #endif 72 #ifndef MAXSSIZ 73 #define MAXSSIZ (1<<25) /* max stack size (32M) */ 74 #endif 75 76 /* 77 * Default sizes of swap allocation chunks (see dmap.h). 78 * The actual values may be changed in vminit() based on MAXDSIZ. 79 * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. 80 * DMMIN should be at least ctod(1) so that vtod() works. 81 * vminit() insures this. 82 */ 83 #define DMMIN 32 /* smallest swap allocation */ 84 #define DMMAX 4096 /* largest potential swap allocation */ 85 86 /* 87 * PTEs for mapping user space into the kernel for phyio operations. 88 * 64 pte's are enough to cover 8 disks * MAXBSIZE. 89 */ 90 #ifndef USRIOSIZE 91 #define USRIOSIZE 64 92 #endif 93 94 /* 95 * PTEs for system V style shared memory. 96 * This is basically slop for kmempt which we actually allocate (malloc) from. 97 */ 98 #ifndef SHMMAXPGS 99 #define SHMMAXPGS 1024 /* 8mb */ 100 #endif 101 102 /* 103 * Boundary at which to place first MAPMEM segment if not explicitly 104 * specified. Should be a power of two. This allows some slop for 105 * the data segment to grow underneath the first mapped segment. 106 */ 107 #define MMSEG 0x200000 108 109 /* 110 * The size of the clock loop. 111 */ 112 #define LOOPPAGES (maxfree - firstfree) 113 114 /* 115 * The time for a process to be blocked before being very swappable. 116 * This is a number of seconds which the system takes as being a non-trivial 117 * amount of real time. You probably shouldn't change this; 118 * it is used in subtle ways (fractions and multiples of it are, that is, like 119 * half of a ``long time'', almost a long time, etc.) 120 * It is related to human patience and other factors which don't really 121 * change over time. 122 */ 123 #define MAXSLP 20 124 125 /* 126 * A swapped in process is given a small amount of core without being bothered 127 * by the page replacement algorithm. Basically this says that if you are 128 * swapped in you deserve some resources. We protect the last SAFERSS 129 * pages against paging and will just swap you out rather than paging you. 130 * Note that each process has at least UPAGES+CLSIZE pages which are not 131 * paged anyways, in addition to SAFERSS. 132 */ 133 #define SAFERSS 10 /* nominal ``small'' resident set size 134 protected against replacement */ 135 136 /* 137 * Mach derived constants 138 */ 139 140 /* user/kernel map constants */ 141 #define VM_MIN_ADDRESS ((vm_offset_t)ALPHA_USEG_BASE) /* 0 */ 142 #define VM_MAXUSER_ADDRESS ((vm_offset_t)0x0000000200000000) /* 8G XXX */ 143 #define VM_MAX_ADDRESS VM_MAXUSER_ADDRESS 144 #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)ALPHA_K1SEG_BASE) 145 #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)ALPHA_K1SEG_END) 146 147 /* virtual sizes (bytes) for various kernel submaps */ 148 #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 149 #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 150 #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 151 152 /* some Alpha-specific constants */ 153 #define VPTBASE ((vm_offset_t)0xfffffffc00000000) /* Virt. pg table */ 154
Indexes created Sun Oct 26 13:09:57 GMT 2025