2/* From: NetBSD: vmparam.h,v 1.6 1997/09/23 23:23:23 mjacob Exp */
3#ifndef _MACHINE_VMPARAM_H
4#define _MACHINE_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 ia64.
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 syscall gateway page.
54 */
55#define USRTEXT CLBYTES
56#define USRSTACK VM_MAX_ADDRESS
57
58/*
59 * Virtual memory related constants, all in bytes
60 */
61#ifndef MAXTSIZ
62#define MAXTSIZ (1<<30) /* max text size (1G) */
63#endif
64#ifndef DFLDSIZ
65#define DFLDSIZ (1<<27) /* initial data size (128M) */
66#endif
67#ifndef MAXDSIZ
68#define MAXDSIZ (1<<30) /* max data size (1G) */
69#endif
70#ifndef DFLSSIZ
71#define DFLSSIZ (1<<21) /* initial stack size (2M) */
72#endif
73#ifndef MAXSSIZ
74#define MAXSSIZ (1<<28) /* max stack size (256M) */
75#endif
76#ifndef SGROWSIZ
77#define SGROWSIZ (128UL*1024) /* amount to grow stack */
78#endif
79
80/*
81 * PTEs for mapping user space into the kernel for phyio operations.
82 * 64 pte's are enough to cover 8 disks * MAXBSIZE.
83 */
84#ifndef USRIOSIZE
85#define USRIOSIZE 64
86#endif
87
88/*
89 * Boundary at which to place first MAPMEM segment if not explicitly
90 * specified. Should be a power of two. This allows some slop for
91 * the data segment to grow underneath the first mapped segment.
92 */
93#define MMSEG 0x200000
94
95/*
96 * The size of the clock loop.
97 */
98#define LOOPPAGES (maxfree - firstfree)
99
100/*
101 * The time for a process to be blocked before being very swappable.
102 * This is a number of seconds which the system takes as being a non-trivial
103 * amount of real time. You probably shouldn't change this;
104 * it is used in subtle ways (fractions and multiples of it are, that is, like
105 * half of a ``long time'', almost a long time, etc.)
106 * It is related to human patience and other factors which don't really
107 * change over time.
108 */
109#define MAXSLP 20
110
111/*
112 * A swapped in process is given a small amount of core without being bothered
113 * by the page replacement algorithm. Basically this says that if you are
114 * swapped in you deserve some resources. We protect the last SAFERSS
115 * pages against paging and will just swap you out rather than paging you.
116 * Note that each process has at least UPAGES+CLSIZE pages which are not
117 * paged anyways, in addition to SAFERSS.
118 */
119#define SAFERSS 10 /* nominal ``small'' resident set size
120 protected against replacement */
121
122/*
123 * We need region 7 virtual addresses for pagetables.
124 */
125#define UMA_MD_SMALL_ALLOC
126
127/*
128 * Manipulating region bits of an address.
129 */
130#define IA64_RR_BASE(n) (((u_int64_t) (n)) << 61)
131#define IA64_RR_MASK(x) ((x) & ((1L << 61) - 1))
132
133#define IA64_PHYS_TO_RR6(x) ((x) | IA64_RR_BASE(6))
134#define IA64_PHYS_TO_RR7(x) ((x) | IA64_RR_BASE(7))
135
136/*
137 * Page size of the identity mappings in region 7.
138 */
139#ifndef LOG2_ID_PAGE_SIZE
140#define LOG2_ID_PAGE_SIZE 28 /* 256M */
141#endif
142
143#define IA64_ID_PAGE_SHIFT (LOG2_ID_PAGE_SIZE)
144#define IA64_ID_PAGE_SIZE (1<<(LOG2_ID_PAGE_SIZE))
145#define IA64_ID_PAGE_MASK (IA64_ID_PAGE_SIZE-1)
146
| 2/* From: NetBSD: vmparam.h,v 1.6 1997/09/23 23:23:23 mjacob Exp */
3#ifndef _MACHINE_VMPARAM_H
4#define _MACHINE_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 ia64.
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 syscall gateway page.
54 */
55#define USRTEXT CLBYTES
56#define USRSTACK VM_MAX_ADDRESS
57
58/*
59 * Virtual memory related constants, all in bytes
60 */
61#ifndef MAXTSIZ
62#define MAXTSIZ (1<<30) /* max text size (1G) */
63#endif
64#ifndef DFLDSIZ
65#define DFLDSIZ (1<<27) /* initial data size (128M) */
66#endif
67#ifndef MAXDSIZ
68#define MAXDSIZ (1<<30) /* max data size (1G) */
69#endif
70#ifndef DFLSSIZ
71#define DFLSSIZ (1<<21) /* initial stack size (2M) */
72#endif
73#ifndef MAXSSIZ
74#define MAXSSIZ (1<<28) /* max stack size (256M) */
75#endif
76#ifndef SGROWSIZ
77#define SGROWSIZ (128UL*1024) /* amount to grow stack */
78#endif
79
80/*
81 * PTEs for mapping user space into the kernel for phyio operations.
82 * 64 pte's are enough to cover 8 disks * MAXBSIZE.
83 */
84#ifndef USRIOSIZE
85#define USRIOSIZE 64
86#endif
87
88/*
89 * Boundary at which to place first MAPMEM segment if not explicitly
90 * specified. Should be a power of two. This allows some slop for
91 * the data segment to grow underneath the first mapped segment.
92 */
93#define MMSEG 0x200000
94
95/*
96 * The size of the clock loop.
97 */
98#define LOOPPAGES (maxfree - firstfree)
99
100/*
101 * The time for a process to be blocked before being very swappable.
102 * This is a number of seconds which the system takes as being a non-trivial
103 * amount of real time. You probably shouldn't change this;
104 * it is used in subtle ways (fractions and multiples of it are, that is, like
105 * half of a ``long time'', almost a long time, etc.)
106 * It is related to human patience and other factors which don't really
107 * change over time.
108 */
109#define MAXSLP 20
110
111/*
112 * A swapped in process is given a small amount of core without being bothered
113 * by the page replacement algorithm. Basically this says that if you are
114 * swapped in you deserve some resources. We protect the last SAFERSS
115 * pages against paging and will just swap you out rather than paging you.
116 * Note that each process has at least UPAGES+CLSIZE pages which are not
117 * paged anyways, in addition to SAFERSS.
118 */
119#define SAFERSS 10 /* nominal ``small'' resident set size
120 protected against replacement */
121
122/*
123 * We need region 7 virtual addresses for pagetables.
124 */
125#define UMA_MD_SMALL_ALLOC
126
127/*
128 * Manipulating region bits of an address.
129 */
130#define IA64_RR_BASE(n) (((u_int64_t) (n)) << 61)
131#define IA64_RR_MASK(x) ((x) & ((1L << 61) - 1))
132
133#define IA64_PHYS_TO_RR6(x) ((x) | IA64_RR_BASE(6))
134#define IA64_PHYS_TO_RR7(x) ((x) | IA64_RR_BASE(7))
135
136/*
137 * Page size of the identity mappings in region 7.
138 */
139#ifndef LOG2_ID_PAGE_SIZE
140#define LOG2_ID_PAGE_SIZE 28 /* 256M */
141#endif
142
143#define IA64_ID_PAGE_SHIFT (LOG2_ID_PAGE_SIZE)
144#define IA64_ID_PAGE_SIZE (1<<(LOG2_ID_PAGE_SIZE))
145#define IA64_ID_PAGE_MASK (IA64_ID_PAGE_SIZE-1)
146
|
147/*
148 * Mach derived constants
149 */
150
151/* user/kernel map constants */
152#define VM_MIN_ADDRESS 0
153#define VM_MAX_ADDRESS IA64_RR_BASE(5)
154#define VM_GATEWAY_SIZE PAGE_SIZE
155#define VM_MAXUSER_ADDRESS (VM_MAX_ADDRESS + VM_GATEWAY_SIZE)
156#define VM_MIN_KERNEL_ADDRESS VM_MAXUSER_ADDRESS
157#define VM_MAX_KERNEL_ADDRESS (IA64_RR_BASE(6) - 1)
158
159#define KERNBASE VM_MAX_ADDRESS
160
161/* virtual sizes (bytes) for various kernel submaps */
162#ifndef VM_KMEM_SIZE
163#define VM_KMEM_SIZE (12 * 1024 * 1024)
164#endif
165
166/*
167 * How many physical pages per KVA page allocated.
168 * min(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), VM_KMEM_SIZE_MAX)
169 * is the total KVA space allocated for kmem_map.
170 */
171#ifndef VM_KMEM_SIZE_SCALE
172#define VM_KMEM_SIZE_SCALE (4) /* XXX 8192 byte pages */
173#endif
174
175/* initial pagein size of beginning of executable file */
176#ifndef VM_INITIAL_PAGEIN
177#define VM_INITIAL_PAGEIN 16
178#endif
179
180#endif /* !_MACHINE_VMPARAM_H */
| 149/*
150 * Mach derived constants
151 */
152
153/* user/kernel map constants */
154#define VM_MIN_ADDRESS 0
155#define VM_MAX_ADDRESS IA64_RR_BASE(5)
156#define VM_GATEWAY_SIZE PAGE_SIZE
157#define VM_MAXUSER_ADDRESS (VM_MAX_ADDRESS + VM_GATEWAY_SIZE)
158#define VM_MIN_KERNEL_ADDRESS VM_MAXUSER_ADDRESS
159#define VM_MAX_KERNEL_ADDRESS (IA64_RR_BASE(6) - 1)
160
161#define KERNBASE VM_MAX_ADDRESS
162
163/* virtual sizes (bytes) for various kernel submaps */
164#ifndef VM_KMEM_SIZE
165#define VM_KMEM_SIZE (12 * 1024 * 1024)
166#endif
167
168/*
169 * How many physical pages per KVA page allocated.
170 * min(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE), VM_KMEM_SIZE_MAX)
171 * is the total KVA space allocated for kmem_map.
172 */
173#ifndef VM_KMEM_SIZE_SCALE
174#define VM_KMEM_SIZE_SCALE (4) /* XXX 8192 byte pages */
175#endif
176
177/* initial pagein size of beginning of executable file */
178#ifndef VM_INITIAL_PAGEIN
179#define VM_INITIAL_PAGEIN 16
180#endif
181
182#endif /* !_MACHINE_VMPARAM_H */
|