167 lines
6.2 KiB
C
167 lines
6.2 KiB
C
/*
|
|
* Copyright (c) 1988 University of Utah.
|
|
* Copyright (c) 1982, 1986, 1990 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.
|
|
*
|
|
* 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 7.3 (Berkeley) 5/7/91
|
|
* $Id: vmparam.h,v 1.12 1994/07/02 21:16:36 chopps Exp $
|
|
*/
|
|
#ifndef _MACHINE_VMPARAM_H_
|
|
#define _MACHINE_VMPARAM_H_
|
|
|
|
#include <machine/pte.h>
|
|
|
|
/*
|
|
* Machine dependent constants for HP300
|
|
*/
|
|
/*
|
|
* USRTEXT is the start of the user text/data space, while USRSTACK
|
|
* is the top (end) of the user stack. LOWPAGES and HIGHPAGES are
|
|
* the number of pages from the beginning of the P0 region to the
|
|
* beginning of the text and from the beginning of the P1 region to the
|
|
* beginning of the stack respectively.
|
|
*
|
|
* These are a mixture of i386, sun3 and hp settings..
|
|
*/
|
|
|
|
/* Sun settings. Still hope, that I might get sun3 binaries to work... */
|
|
#define USRTEXT 0x2000
|
|
#define USRSTACK 0x0E000000
|
|
#define LOWPAGES btoc(USRTEXT)
|
|
#define KUSER_AREA (-UPAGES*NBPG)
|
|
/*
|
|
* Virtual memory related constants, all in bytes
|
|
*/
|
|
|
|
#ifndef MAXTSIZ
|
|
#define MAXTSIZ (6*1024*1024) /* max text size */
|
|
#endif
|
|
#ifndef DFLDSIZ
|
|
#define DFLDSIZ (32*1024*1024) /* initial data size limit */
|
|
#endif
|
|
#ifndef MAXDSIZ
|
|
#define MAXDSIZ (32*1024*1024) /* max data size */
|
|
#endif
|
|
#ifndef DFLSSIZ
|
|
#define DFLSSIZ (2*1024*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 */
|
|
|
|
/*
|
|
* Sizes of the system and user portions of the system page table.
|
|
*/
|
|
/* SYSPTSIZE IS SILLY; IT SHOULD BE COMPUTED AT BOOT TIME */
|
|
#define SYSPTSIZE (2 * NPTEPG) /* 16mb */
|
|
#define USRPTSIZE (1 * NPTEPG) /* 16mb */
|
|
|
|
/*
|
|
* PTEs for mapping user space into the kernel for phyio operations.
|
|
* One page is enough to handle 16Mb of simultaneous raw IO operations.
|
|
*/
|
|
#ifndef USRIOSIZE
|
|
#define USRIOSIZE (1 * NPTEPG) /* 16mb */
|
|
#endif
|
|
|
|
/*
|
|
* PTEs for system V style shared memory.
|
|
* This is basically slop for kmempt which we actually allocate (malloc) from.
|
|
*/
|
|
#ifndef SHMMAXPGS
|
|
#define SHMMAXPGS (1 * NPTEPG) /* 16mb */
|
|
#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.
|
|
*/
|
|
#define SAFERSS 4 /* nominal ``small'' resident set size
|
|
protected against replacement */
|
|
|
|
/*
|
|
* user/kernel map constants
|
|
*/
|
|
#define VM_MIN_ADDRESS ((vm_offset_t)0)
|
|
#define VM_MAXUSER_ADDRESS ((vm_offset_t)(USRSTACK))
|
|
#define VM_MAX_ADDRESS ((vm_offset_t)(0-(UPAGES*NBPG)))
|
|
#define VM_MIN_KERNEL_ADDRESS ((vm_offset_t)0)
|
|
#define VM_MAX_KERNEL_ADDRESS ((vm_offset_t)(0-NBPG))
|
|
|
|
/*
|
|
* virtual sizes (bytes) for various kernel submaps
|
|
*/
|
|
#define VM_MBUF_SIZE (NMBCLUSTERS*MCLBYTES)
|
|
#define VM_KMEM_SIZE (NKMEMCLUSTERS*CLBYTES)
|
|
#define VM_PHYS_SIZE (USRIOSIZE*CLBYTES)
|
|
|
|
/*
|
|
* number of kernel PT pages (initial only, can grow dynamically)
|
|
*/
|
|
#define VM_KERNEL_PT_PAGES ((vm_size_t)2) /* XXX: SYSPTSIZE */
|
|
#endif /* !_MACHINE_VMPARAM_H_ */
|