vmparam.h revision 92670 
1/* $FreeBSD: head/sys/ia64/include/vmparam.h 92670 2002-03-19 11:07:09Z peter $ */
2/* From: NetBSD: vmparam.h,v 1.6 1997/09/23 23:23:23 mjacob Exp */
3#ifndef	_ALPHA_VMPARAM_H
4#define	_ALPHA_VMPARAM_H
5/*
6 * Copyright (c) 1988 University of Utah.
7 * Copyright (c) 1992, 1993
8 *	The Regents of the University of California.  All rights reserved.
9 *
10 * This code is derived from software contributed to Berkeley by
11 * the Systems Programming Group of the University of Utah Computer
12 * Science Department and Ralph Campbell.
13 *
14 * Redistribution and use in source and binary forms, with or without
15 * modification, are permitted provided that the following conditions
16 * are met:
17 * 1. Redistributions of source code must retain the above copyright
18 *    notice, this list of conditions and the following disclaimer.
19 * 2. Redistributions in binary form must reproduce the above copyright
20 *    notice, this list of conditions and the following disclaimer in the
21 *    documentation and/or other materials provided with the distribution.
22 * 3. All advertising materials mentioning features or use of this software
23 *    must display the following acknowledgement:
24 *	This product includes software developed by the University of
25 *	California, Berkeley and its contributors.
26 * 4. Neither the name of the University nor the names of its contributors
27 *    may be used to endorse or promote products derived from this software
28 *    without specific prior written permission.
29 *
30 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
31 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
32 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
33 * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
34 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
35 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
36 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
37 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
38 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
39 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
40 * SUCH DAMAGE.
41 *
42 * from: Utah $Hdr: vmparam.h 1.16 91/01/18$
43 *
44 *	@(#)vmparam.h	8.2 (Berkeley) 4/22/94
45 */
46
47/*
48 * Machine dependent constants for Alpha.
49 */
50/*
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#define	USRTEXT		CLBYTES
57#define	USRSTACK	VM_MAXUSER_ADDRESS
58
59/*
60 * Virtual memory related constants, all in bytes
61 */
62#ifndef MAXTSIZ
63#define	MAXTSIZ		(1<<30)			/* max text size (1G) */
64#endif
65#ifndef DFLDSIZ
66#define	DFLDSIZ		(1<<27)			/* initial data size (128M) */
67#endif
68#ifndef MAXDSIZ
69#define	MAXDSIZ		(1<<30)			/* max data size (1G) */
70#endif
71#ifndef	DFLSSIZ
72#define	DFLSSIZ		(1<<21)			/* initial stack size (2M) */
73#endif
74#ifndef	MAXSSIZ
75#define	MAXSSIZ		(1<<28)			/* max stack size (256M) */
76#endif
77#ifndef SGROWSIZ
78#define SGROWSIZ	(128UL*1024)		/* amount to grow stack */
79#endif
80
81/*
82 * PTEs for mapping user space into the kernel for phyio operations.
83 * 64 pte's are enough to cover 8 disks * MAXBSIZE.
84 */
85#ifndef USRIOSIZE
86#define USRIOSIZE	64
87#endif
88
89/*
90 * Boundary at which to place first MAPMEM segment if not explicitly
91 * specified.  Should be a power of two.  This allows some slop for
92 * the data segment to grow underneath the first mapped segment.
93 */
94#define MMSEG		0x200000
95
96/*
97 * The size of the clock loop.
98 */
99#define	LOOPPAGES	(maxfree - firstfree)
100
101/*
102 * The time for a process to be blocked before being very swappable.
103 * This is a number of seconds which the system takes as being a non-trivial
104 * amount of real time.  You probably shouldn't change this;
105 * it is used in subtle ways (fractions and multiples of it are, that is, like
106 * half of a ``long time'', almost a long time, etc.)
107 * It is related to human patience and other factors which don't really
108 * change over time.
109 */
110#define	MAXSLP 		20
111
112/*
113 * A swapped in process is given a small amount of core without being bothered
114 * by the page replacement algorithm.  Basically this says that if you are
115 * swapped in you deserve some resources.  We protect the last SAFERSS
116 * pages against paging and will just swap you out rather than paging you.
117 * Note that each process has at least UPAGES+CLSIZE pages which are not
118 * paged anyways, in addition to SAFERSS.
119 */
120#define	SAFERSS		10		/* nominal ``small'' resident set size
121					   protected against replacement */
122
123/*
124 * Mach derived constants
125 */
126
127/* user/kernel map constants */
128#define VM_MIN_ADDRESS		0
129#define VM_MAXUSER_ADDRESS	IA64_RR_BASE(5)
130#define VM_MAX_ADDRESS		VM_MAXUSER_ADDRESS
131#define VM_MIN_KERNEL_ADDRESS	IA64_RR_BASE(5)
132#define VM_MAX_KERNEL_ADDRESS	(IA64_RR_BASE(6) - 1)
133
134/* virtual sizes (bytes) for various kernel submaps */
135#ifndef VM_KMEM_SIZE
136#define VM_KMEM_SIZE		(12 * 1024 * 1024)
137#endif
138
139/*
140 * How many physical pages per KVA page allocated.
141 * min(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), VM_KMEM_SIZE_MAX)
142 * is the total KVA space allocated for kmem_map.
143 */
144#ifndef VM_KMEM_SIZE_SCALE
145#define	VM_KMEM_SIZE_SCALE	(4) /* XXX 8192 byte pages */
146#endif
147
148/* initial pagein size of beginning of executable file */
149#ifndef VM_INITIAL_PAGEIN
150#define	VM_INITIAL_PAGEIN	16
151#endif
152
153#endif	/* !_ALPHA_VMPARAM_H */
154