/* $OpenBSD: vmparam.h,v 1.5 1997/08/08 08:26:54 downsj Exp $ */ /* $NetBSD: vmparam.h,v 1.13 1997/07/12 16:20:03 perry Exp $ */ /* * Copyright (c) 1992, 1993 * The Regents of the University of California. All rights reserved. * * This software was developed by the Computer Systems Engineering group * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and * contributed to Berkeley. * * All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Lawrence Berkeley Laboratory. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. * * @(#)vmparam.h 8.1 (Berkeley) 6/11/93 */ /* * Machine dependent constants for Sun-4c SPARC */ /* * USRTEXT is the start of the user text/data space, while USRSTACK * is the top (end) of the user stack. */ #define USRTEXT 0x2000 /* Start of user text */ #define USRSTACK KERNBASE /* Start of user stack */ /* * Virtual memory related constants, all in bytes */ #ifndef MAXTSIZ #define MAXTSIZ (16*1024*1024) /* max text size */ #endif #ifndef DFLDSIZ #define DFLDSIZ (16*1024*1024) /* initial data size limit */ #endif #ifndef MAXDSIZ #define MAXDSIZ (64*1024*1024) /* max data size */ #endif #ifndef DFLSSIZ #define DFLSSIZ (512*1024) /* initial stack size limit */ #endif #ifndef MAXSSIZ #define MAXSSIZ MAXDSIZ /* max stack size */ #endif /* * Default sizes of swap allocation chunks (see dmap.h). * The actual values may be changed in vminit() based on MAXDSIZ. * With MAXDSIZ of 16Mb and NDMAP of 38, dmmax will be 1024. * DMMIN should be at least ctod(1) so that vtod() works. * vminit() insures this. */ #define DMMIN 32 /* smallest swap allocation */ #define DMMAX NBPG /* largest potential swap allocation */ #define DMTEXT 1024 /* swap allocation for text */ /* * Size of shared memory map */ #ifndef SHMMAXPGS #define SHMMAXPGS 1024 #endif /* * The time for a process to be blocked before being very swappable. * This is a number of seconds which the system takes as being a non-trivial * amount of real time. You probably shouldn't change this; * it is used in subtle ways (fractions and multiples of it are, that is, like * half of a ``long time'', almost a long time, etc.) * It is related to human patience and other factors which don't really * change over time. */ #define MAXSLP 20 /* * A swapped in process is given a small amount of core without being bothered * by the page replacement algorithm. Basically this says that if you are * swapped in you deserve some resources. We protect the last SAFERSS * pages against paging and will just swap you out rather than paging you. * Note that each process has at least UPAGES+CLSIZE pages which are not * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this * number just means a swapped in process is given around 25k bytes. * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81), * so we loan each swapped in process memory worth 100$, or just admit * that we don't consider it worthwhile and swap it out to disk which costs * $30/mb or about $0.75. * Update: memory prices have changed recently (9/96). At the current * value of $6 per megabyte, we lend each swapped in process memory worth * $0.15, or just admit that we don't consider it worthwhile and swap it out * to disk which costs $0.20/MB, or just under half a cent. */ #define SAFERSS 4 /* nominal ``small'' resident set size protected against replacement */ /* * Mach derived constants */ /* * User/kernel map constants. Note that sparc/vaddrs.h defines the * IO space virtual base, which must be the same as VM_MAX_KERNEL_ADDRESS: * tread with care. */ #define VM_MIN_ADDRESS ((vm_offset_t)0) #define VM_MAX_ADDRESS ((vm_offset_t)KERNBASE) #define VM_MAXUSER_ADDRESS ((vm_offset_t)KERNBASE) #define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)KERNBASE) #define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)0xfe000000) /* virtual sizes (bytes) for various kernel submaps */ #define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES) #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) #define MACHINE_NONCONTIG /* VM <=> pmap interface modifier */ #if defined (_KERNEL) && !defined(_LOCORE) struct vm_map; vm_offset_t dvma_mapin __P((struct vm_map *, vm_offset_t, int, int)); void dvma_mapout __P((vm_offset_t, vm_offset_t, int)); #endif