Home | History | Annotate | Line # | Download | only in include
vmparam.h revision 1.1 
      1 /*	$NetBSD: vmparam.h,v 1.1 1999/09/13 10:31:24 itojun Exp $	*/
      2 
      3 /*-
      4  * Copyright (c) 1990 The Regents of the University of California.
      5  * All rights reserved.
      6  *
      7  * This code is derived from software contributed to Berkeley by
      8  * William Jolitz.
      9  *
     10  * Redistribution and use in source and binary forms, with or without
     11  * modification, are permitted provided that the following conditions
     12  * are met:
     13  * 1. Redistributions of source code must retain the above copyright
     14  *    notice, this list of conditions and the following disclaimer.
     15  * 2. Redistributions in binary form must reproduce the above copyright
     16  *    notice, this list of conditions and the following disclaimer in the
     17  *    documentation and/or other materials provided with the distribution.
     18  * 3. All advertising materials mentioning features or use of this software
     19  *    must display the following acknowledgement:
     20  *	This product includes software developed by the University of
     21  *	California, Berkeley and its contributors.
     22  * 4. Neither the name of the University nor the names of its contributors
     23  *    may be used to endorse or promote products derived from this software
     24  *    without specific prior written permission.
     25  *
     26  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
     27  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
     28  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
     29  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
     30  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
     31  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
     32  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
     33  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
     34  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
     35  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
     36  * SUCH DAMAGE.
     37  *
     38  *	@(#)vmparam.h	5.9 (Berkeley) 5/12/91
     39  */
     40 
     41 #ifndef _MACHINE_VMPARAM_H_
     42 #define _MACHINE_VMPARAM_H_
     43 
     44 /*
     45  * Machine dependent constants for sh3.
     46  */
     47 
     48 /*
     49  * Virtual address space arrangement. On 386, both user and kernel
     50  * share the address space, not unlike the vax.
     51  * USRTEXT is the start of the user text/data space, while USRSTACK
     52  * is the top (end) of the user stack. Immediately above the user stack
     53  * resides the user structure, which is UPAGES long and contains the
     54  * kernel stack.
     55  *
     56  * Immediately after the user structure is the page table map, and then
     57  * kernal address space.
     58  */
     59 #define	USRTEXT		CLBYTES
     60 #define	USRSTACK	VM_MAXUSER_ADDRESS
     61 
     62 /*
     63  * Virtual memory related constants, all in bytes
     64  */
     65 #define	MAXTSIZ		(64*1024*1024)		/* max text size */
     66 #ifndef DFLDSIZ
     67 #define	DFLDSIZ		(128*1024*1024)		/* initial data size limit */
     68 #endif
     69 #ifndef MAXDSIZ
     70 #define	MAXDSIZ		(1*1024*1024*1024)	/* max data size */
     71 #endif
     72 #ifndef	DFLSSIZ
     73 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
     74 #endif
     75 #ifndef	MAXSSIZ
     76 #define	MAXSSIZ		(32*1024*1024)		/* max stack size */
     77 #endif
     78 
     79 /*
     80  * Size of shared memory map
     81  */
     82 #ifndef SHMMAXPGS
     83 #define SHMMAXPGS	1024
     84 #endif
     85 
     86 /*
     87  * Size of User Raw I/O map
     88  */
     89 #define	USRIOSIZE 	300
     90 
     91 /*
     92  * The time for a process to be blocked before being very swappable.
     93  * This is a number of seconds which the system takes as being a non-trivial
     94  * amount of real time.  You probably shouldn't change this;
     95  * it is used in subtle ways (fractions and multiples of it are, that is, like
     96  * half of a ``long time'', almost a long time, etc.)
     97  * It is related to human patience and other factors which don't really
     98  * change over time.
     99  */
    100 #define	MAXSLP 		20
    101 
    102 /*
    103  * A swapped in process is given a small amount of core without being bothered
    104  * by the page replacement algorithm.  Basically this says that if you are
    105  * swapped in you deserve some resources.  We protect the last SAFERSS
    106  * pages against paging and will just swap you out rather than paging you.
    107  * Note that each process has at least UPAGES+CLSIZE pages which are not
    108  * paged anyways (this is currently 8+2=10 pages or 5k bytes), so this
    109  * number just means a swapped in process is given around 25k bytes.
    110  * Just for fun: current memory prices are 4600$ a megabyte on VAX (4/22/81),
    111  * so we loan each swapped in process memory worth 100$, or just admit
    112  * that we don't consider it worthwhile and swap it out to disk which costs
    113  * $30/mb or about $0.75.
    114  * { wfj 6/16/89: Retail AT memory expansion $800/megabyte, loan of $17
    115  *   on disk costing $7/mb or $0.18 (in memory still 100:1 in cost!) }
    116  * Update: memory prices have changed recently (9/96). At the current
    117  * value of $6 per megabyte, we lend each swapped in process memory worth
    118  * $0.15, or just admit that we don't consider it worthwhile and swap it out
    119  * to disk which costs $0.20/MB, or just under half a cent.
    120  */
    121 #define	SAFERSS		8		/* nominal ``small'' resident set size
    122 					   protected against replacement */
    123 
    124 /*
    125  * Mach derived constants
    126  */
    127 
    128 /* user/kernel map constants */
    129 #define VM_MIN_ADDRESS		((vaddr_t)0)
    130 /* PTDPTDI<<PDSHIFT - UPAGES*NBPG */
    131 #define VM_MAXUSER_ADDRESS	((vaddr_t)0x7fffe000)
    132 /* PTDPTDI<<PDSHIFT + PTDPTDI<<PGSHIFT */
    133 #define VM_MAX_ADDRESS		((vaddr_t)0xcffbf000)
    134 /* KPTDI<<PDSHIFT */
    135 #define VM_MIN_KERNEL_ADDRESS	((vaddr_t)0xd0000000)
    136 /* APTDPTDI<<PDSHIFT */
    137 #define VM_MAX_KERNEL_ADDRESS	((vaddr_t)0xdfc00000)
    138 
    139 /* XXX max. amount of KVM to be used by buffers. */
    140 #ifndef VM_MAX_KERNEL_BUF
    141 #define VM_MAX_KERNEL_BUF \
    142 	((VM_MAX_KERNEL_ADDRESS - VM_MIN_KERNEL_ADDRESS) * 7 / 10)
    143 #endif
    144 
    145 /* virtual sizes (bytes) for various kernel submaps */
    146 #define VM_MBUF_SIZE		(NMBCLUSTERS*MCLBYTES)
    147 #define VM_KMEM_SIZE		(NKMEMCLUSTERS*CLBYTES)
    148 #define VM_PHYS_SIZE		(USRIOSIZE*CLBYTES)
    149 
    150 #define VM_PHYSSEG_MAX		1
    151 #define VM_PHYSSEG_STRAT	VM_PSTRAT_BSEARCH
    152 #define VM_PHYSSEG_NOADD		/* no more after vm_mem_init */
    153 
    154 #define VM_NFREELIST		1
    155 #define VM_FREELIST_DEFAULT	0
    156 
    157 /*
    158  * pmap specific data stored in the vm_physmem[] array
    159  */
    160 #if defined(PMAP_NEW)
    161 struct pmap_physseg {
    162 	struct pv_head *pvhead;		/* pv_head array */
    163 	char *attrs;			/* attrs array */
    164 };
    165 #else
    166 struct pmap_physseg {
    167 	struct pv_entry *pvent;		/* pv_entry array */
    168 	char *attrs;			/* attrs array */
    169 };
    170 #endif
    171 
    172 #endif /* _MACHINE_VMPARAM_H_ */
    173