/* $NetBSD: vmparam.h,v 1.14 1999/03/26 00:15:05 thorpej Exp $ */ /* * Copyright (c) 1988 University of Utah. * Copyright (c) 1992, 1993 * The Regents of the University of California. All rights reserved. * * This code is derived from software contributed to Berkeley by * the Systems Programming Group of the University of Utah Computer * Science Department and Ralph Campbell. * * 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. * * from: Utah Hdr: vmparam.h 1.16 91/01/18 * * @(#)vmparam.h 8.2 (Berkeley) 4/22/94 */ #ifndef _MIPS_VMPARAM_H_ #define _MIPS_VMPARAM_H_ /* * Machine dependent VM constants for MIPS. */ /* * USRTEXT is the start of the user text/data space, while USRSTACK * is the top (end) of the user stack. */ #define USRTEXT 0x00001000 /* Start of user text */ #define USRSTACK 0x80000000 /* Start of user stack */ /* * Virtual memory related constants, all in bytes */ #ifndef MAXTSIZ #define MAXTSIZ (24*1024*1024) /* max text size */ #endif #ifndef DFLDSIZ #define DFLDSIZ (32*1024*1024) /* initial data size limit */ #endif #ifndef MAXDSIZ #define MAXDSIZ (256*1024*1024) /* max data size */ #endif #ifndef DFLSSIZ #define DFLSSIZ (1024*1024) /* initial stack size limit */ #endif #ifndef MAXSSIZ #define MAXSSIZ (32*1024*1024) /* max stack size */ #endif /* * PTEs for mapping user space into the kernel for phyio operations. * 16 pte's are enough to cover 8 disks * MAXBSIZE. */ #ifndef USRIOSIZE #define USRIOSIZE 32 #endif /* * PTEs for system V style shared memory. * This is basically slop for kmempt which we actually allocate (malloc) from. */ #ifndef SHMMAXPGS #define SHMMAXPGS 1024 /* 4mb */ #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 */ #define mapin(pte, v, pfnum, prot) \ (*(int *)(pte) = ((pfnum) << PG_SHIFT) | (prot), MachTLBFlushAddr(v)) /* * Mach derived constants */ /* user/kernel map constants */ #define VM_MIN_ADDRESS ((vaddr_t)0x00000000) #define VM_MAXUSER_ADDRESS ((vaddr_t)0x80000000) #define VM_MAX_ADDRESS ((vaddr_t)0x80000000) #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)0xC0000000) #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)0xFFFFC000) /* virtual sizes (bytes) for various kernel submaps */ #define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES) #define VM_PHYS_SIZE (USRIOSIZE*CLBYTES) /* VM_PHYSSEG_MAX defined by platform-dependent code. */ #define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH #define VM_PHYSSEG_NOADD /* no more after vm_mem_init */ /* * pmap-specific data stored in the vm_physmem[] array. */ struct pmap_physseg { struct pv_entry *pvent; /* pv table for this seg */ char *attrs; /* page attributes for this seg */ }; #endif /* ! _MIPS_VMPARAM_H_ */