vmparam.h revision 1.2
1/* $NetBSD: vmparam.h,v 1.2 1998/08/28 23:05:54 dbj Exp $ */ 2 3/* 4 * This file was taken from from mvme68k/include/vmparam.h and 5 * should probably be re-synced when needed. 6 * Darrin B Jewell <jewell@mit.edu> Fri Aug 28 03:22:07 1998 7 * original cvs id: NetBSD: vmparam.h,v 1.9 1998/08/22 10:55:34 scw Exp 8 */ 9 10/* 11 * Copyright (c) 1988 University of Utah. 12 * Copyright (c) 1982, 1986, 1990, 1993 13 * The Regents of the University of California. All rights reserved. 14 * 15 * This code is derived from software contributed to Berkeley by 16 * the Systems Programming Group of the University of Utah Computer 17 * Science Department. 18 * 19 * Redistribution and use in source and binary forms, with or without 20 * modification, are permitted provided that the following conditions 21 * are met: 22 * 1. Redistributions of source code must retain the above copyright 23 * notice, this list of conditions and the following disclaimer. 24 * 2. Redistributions in binary form must reproduce the above copyright 25 * notice, this list of conditions and the following disclaimer in the 26 * documentation and/or other materials provided with the distribution. 27 * 3. All advertising materials mentioning features or use of this software 28 * must display the following acknowledgement: 29 * This product includes software developed by the University of 30 * California, Berkeley and its contributors. 31 * 4. Neither the name of the University nor the names of its contributors 32 * may be used to endorse or promote products derived from this software 33 * without specific prior written permission. 34 * 35 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 36 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 37 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 38 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 39 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 40 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 41 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 42 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 43 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 44 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 45 * SUCH DAMAGE. 46 * 47 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$ 48 * 49 * @(#)vmparam.h 8.2 (Berkeley) 4/19/94 50 */ 51 52#ifndef _NEXT68K_VMPARAM_H_ 53#define _NEXT68K_VMPARAM_H_ 54 55/* 56 * Machine dependent constants for NEXT68K 57 */ 58 59/* 60 * USRTEXT is the start of the user text/data space, while USRSTACK 61 * is the top (end) of the user stack. LOWPAGES and HIGHPAGES are 62 * the number of pages from the beginning of the P0 region to the 63 * beginning of the text and from the beginning of the P1 region to the 64 * beginning of the stack respectively. 65 * 66 * NOTE: the ONLY reason that HIGHPAGES is 0x100 instead of UPAGES (3) 67 * is for HPUX compatibility. Why?? Because HPUX's debuggers 68 * have the user's stack hard-wired at FFF00000 for post-mortems, 69 * and we must be compatible... 70 */ 71#define USRTEXT 8192 /* Must equal __LDPGSZ */ 72#define USRSTACK (-HIGHPAGES*NBPG) /* Start of user stack */ 73#define BTOPUSRSTACK (0x100000-HIGHPAGES) /* btop(USRSTACK) */ 74#define P1PAGES 0x100000 75#define LOWPAGES 0 76#define HIGHPAGES (0x100000/NBPG) 77 78/* 79 * Virtual memory related constants, all in bytes 80 */ 81#ifndef MAXTSIZ 82#define MAXTSIZ (8*1024*1024) /* max text size */ 83#endif 84#ifndef DFLDSIZ 85#define DFLDSIZ (16*1024*1024) /* initial data size limit */ 86#endif 87#ifndef MAXDSIZ 88#define MAXDSIZ (64*1024*1024) /* max data size */ 89#endif 90#ifndef DFLSSIZ 91#define DFLSSIZ (512*1024) /* initial stack size limit */ 92#endif 93#ifndef MAXSSIZ 94#define MAXSSIZ MAXDSIZ /* max stack size */ 95#endif 96 97/* 98 * Sizes of the system and user portions of the system page table. 99 */ 100/* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */ 101#define SYSPTSIZE (2 * NPTEPG) /* 8mb */ 102#define USRPTSIZE (1 * NPTEPG) /* 4mb */ 103 104/* 105 * PTEs for mapping user space into the kernel for phyio operations. 106 * One page is enough to handle 4Mb of simultaneous raw IO operations. 107 */ 108#ifndef USRIOSIZE 109#define USRIOSIZE (1 * NPTEPG) /* 4mb */ 110#endif 111 112/* 113 * PTEs for system V style shared memory. 114 * This is basically slop for kmempt which we actually allocate (malloc) from. 115 */ 116#ifndef SHMMAXPGS 117#define SHMMAXPGS 1024 /* 4mb */ 118#endif 119 120/* 121 * Boundary at which to place first MAPMEM segment if not explicitly 122 * specified. Should be a power of two. This allows some slop for 123 * the data segment to grow underneath the first mapped segment. 124 */ 125#define MMSEG 0x200000 126 127/* 128 * The size of the clock loop. 129 */ 130#define LOOPPAGES (maxfree - firstfree) 131 132/* 133 * The time for a process to be blocked before being very swappable. 134 * This is a number of seconds which the system takes as being a non-trivial 135 * amount of real time. You probably shouldn't change this; 136 * it is used in subtle ways (fractions and multiples of it are, that is, like 137 * half of a ``long time'', almost a long time, etc.) 138 * It is related to human patience and other factors which don't really 139 * change over time. 140 */ 141#define MAXSLP 20 142 143/* 144 * A swapped in process is given a small amount of core without being bothered 145 * by the page replacement algorithm. Basically this says that if you are 146 * swapped in you deserve some resources. We protect the last SAFERSS 147 * pages against paging and will just swap you out rather than paging you. 148 * Note that each process has at least UPAGES+CLSIZE pages which are not 149 * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this 150 * number just means a swapped in process is given around 25k bytes. 151 * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), 152 * so we loan each swapped in process memory worth 100$, or just admit 153 * that we don't consider it worthwhile and swap it out to disk which costs 154 * $30/mb or about $0.75. 155 * Update: memory prices have changed recently (9/96). At the current 156 * value of $6 per megabyte, we lend each swapped in process memory worth 157 * $0.15, or just admit that we don't consider it worthwhile and swap it out 158 * to disk which costs $0.20/MB, or just under half a cent. 159 */ 160#define SAFERSS 4 /* nominal ``small'' resident set size 161 protected against replacement */ 162 163/* 164 * DISKRPM is used to estimate the number of paging i/o operations 165 * which one can expect from a single disk controller. 166 */ 167#define DISKRPM 60 168 169/* 170 * Klustering constants. Klustering is the gathering 171 * of pages together for pagein/pageout, while clustering 172 * is the treatment of hardware page size as though it were 173 * larger than it really is. 174 * 175 * KLMAX gives maximum cluster size in CLSIZE page (cluster-page) 176 * units. Note that ctod(KLMAX*CLSIZE) must be <= DMMIN in dmap.h. 177 * ctob(KLMAX) should also be less than MAXPHYS (in vm_swp.c) 178 * unless you like "big push" panics. 179 */ 180 181#define KLMAX (4/CLSIZE) 182#define KLSEQL (2/CLSIZE) /* in klust if vadvise(VA_SEQL) */ 183#define KLIN (4/CLSIZE) /* default data/stack in klust */ 184#define KLTXT (4/CLSIZE) /* default text in klust */ 185#define KLOUT (4/CLSIZE) 186 187/* 188 * KLSDIST is the advance or retard of the fifo reclaim for sequential 189 * processes data space. 190 */ 191#define KLSDIST 3 /* klusters advance/retard for seq. fifo */ 192 193/* 194 * Paging thresholds (see vm_sched.c). 195 * Strategy of 1/19/85: 196 * lotsfree is 512k bytes, but at most 1/4 of memory 197 * desfree is 200k bytes, but at most 1/8 of memory 198 */ 199#define LOTSFREE (512 * 1024) 200#define LOTSFREEFRACT 4 201#define DESFREE (200 * 1024) 202#define DESFREEFRACT 8 203 204/* 205 * There are two clock hands, initially separated by HANDSPREAD bytes 206 * (but at most all of user memory). The amount of time to reclaim 207 * a page once the pageout process examines it increases with this 208 * distance and decreases as the scan rate rises. 209 */ 210#define HANDSPREAD (2 * 1024 * 1024) 211 212/* 213 * The number of times per second to recompute the desired paging rate 214 * and poke the pagedaemon. 215 */ 216#define RATETOSCHEDPAGING 4 217 218/* 219 * Believed threshold (in megabytes) for which interleaved 220 * swapping area is desirable. 221 */ 222#define LOTSOFMEM 2 223 224/* 225 * Mach derived constants 226 */ 227 228/* user/kernel map constants */ 229#define VM_MIN_ADDRESS ((vaddr_t)0) 230#define VM_MAXUSER_ADDRESS ((vaddr_t)0xFFF00000) 231#define VM_MAX_ADDRESS ((vaddr_t)0xFFF00000) 232#define VM_MIN_KERNEL_ADDRESS ((vaddr_t)0) 233#define VM_MAX_KERNEL_ADDRESS ((vaddr_t)0xFFFFF000) 234 235/* virtual sizes (bytes) for various kernel submaps */ 236#define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) 237#define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) 238#define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) 239 240/* # of kernel PT pages (initial only, can grow dynamically) */ 241#define VM_KERNEL_PT_PAGES ((vsize_t)2) /* XXX: SYSPTSIZE */ 242 243/* pcb base */ 244#define pcbb(p) ((u_int)(p)->p_addr) 245 246/* Use new VM page bootstrap interface. */ 247#define MACHINE_NEW_NONCONTIG 248 249#if 0 250/* 251 * Constants which control the way the VM system deals with memory segments. 252 * The mvme68k port has two physical memory segments: 1 for onboard RAM 253 * and another for contiguous VMEbus RAM. 254 */ 255#define VM_PHYSSEG_MAX 2 256#define VM_PHYSSEG_STRAT VM_PSTRAT_RANDOM 257#define VM_PHYSSEG_NOADD 258 259#define VM_NFREELIST 2 260#define VM_FREELIST_DEFAULT 0 261#define VM_FREELIST_VMEMEM 1 262#else 263/* @@@ check and verify these, also get values from seglist.h */ 264#define VM_PHYSSEG_MAX 5 265#define VM_PHYSSEG_STRAT VM_PSTRAT_RANDOM 266#define VM_PHYSSEG_NOADD 267#endif 268/* 269 * pmap-specific data stored in the vm_physmem[] array. 270 */ 271struct pmap_physseg { 272 struct pv_entry *pvent; /* pv table for this seg */ 273 char *attrs; /* page attributes for this seg */ 274}; 275 276#endif /* _MVME68K_VMPARAM_H_ */ 277