1/*-
2 * Copyright (c) 1990 The Regents of the University of California.
3 * All rights reserved.
4 * Copyright (c) 1994 John S. Dyson
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 * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91
39 * from: FreeBSD: src/sys/i386/include/vmparam.h,v 1.33 2000/03/30
| 1/*-
2 * Copyright (c) 1990 The Regents of the University of California.
3 * All rights reserved.
4 * Copyright (c) 1994 John S. Dyson
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 * from: @(#)vmparam.h 5.9 (Berkeley) 5/12/91
39 * from: FreeBSD: src/sys/i386/include/vmparam.h,v 1.33 2000/03/30
|
40 * $FreeBSD: head/sys/sparc64/include/vmparam.h 85241 2001-10-20 16:17:04Z jake $
| 40 * $FreeBSD: head/sys/sparc64/include/vmparam.h 88653 2001-12-29 08:25:43Z jake $
|
41 */
42
43
44#ifndef _MACHINE_VMPARAM_H_
45#define _MACHINE_VMPARAM_H_
46
47/*
48 * Virtual memory related constants, all in bytes
49 */
50#ifndef MAXTSIZ
51#define MAXTSIZ (1*1024*1024*1024) /* max text size */
52#endif
53#ifndef DFLDSIZ
54#define DFLDSIZ (128*1024*1024) /* initial data size limit */
55#endif
56#ifndef MAXDSIZ
57#define MAXDSIZ (1*1024*1024*1024) /* max data size */
58#endif
59#ifndef DFLSSIZ
60#define DFLSSIZ (128*1024*1024) /* initial stack size limit */
61#endif
62#ifndef MAXSSIZ
63#define MAXSSIZ (1*1024*1024*1024) /* max stack size */
64#endif
65#ifndef SGROWSIZ
66#define SGROWSIZ (128*1024) /* amount to grow stack */
67#endif
68
69/*
70 * The time for a process to be blocked before being very swappable.
71 * This is a number of seconds which the system takes as being a non-trivial
72 * amount of real time. You probably shouldn't change this;
73 * it is used in subtle ways (fractions and multiples of it are, that is, like
74 * half of a ``long time'', almost a long time, etc.)
75 * It is related to human patience and other factors which don't really
76 * change over time.
77 */
78#define MAXSLP 20
79
| 41 */
42
43
44#ifndef _MACHINE_VMPARAM_H_
45#define _MACHINE_VMPARAM_H_
46
47/*
48 * Virtual memory related constants, all in bytes
49 */
50#ifndef MAXTSIZ
51#define MAXTSIZ (1*1024*1024*1024) /* max text size */
52#endif
53#ifndef DFLDSIZ
54#define DFLDSIZ (128*1024*1024) /* initial data size limit */
55#endif
56#ifndef MAXDSIZ
57#define MAXDSIZ (1*1024*1024*1024) /* max data size */
58#endif
59#ifndef DFLSSIZ
60#define DFLSSIZ (128*1024*1024) /* initial stack size limit */
61#endif
62#ifndef MAXSSIZ
63#define MAXSSIZ (1*1024*1024*1024) /* max stack size */
64#endif
65#ifndef SGROWSIZ
66#define SGROWSIZ (128*1024) /* amount to grow stack */
67#endif
68
69/*
70 * The time for a process to be blocked before being very swappable.
71 * This is a number of seconds which the system takes as being a non-trivial
72 * amount of real time. You probably shouldn't change this;
73 * it is used in subtle ways (fractions and multiples of it are, that is, like
74 * half of a ``long time'', almost a long time, etc.)
75 * It is related to human patience and other factors which don't really
76 * change over time.
77 */
78#define MAXSLP 20
79
|
80#define VM_MAXUSER_ADDRESS (0x7fe00000000)
| 80/*
81 * Highest user address. Also address of initial user stack. This is
82 * arbitrary, neither the structure or size of the user page table (tsb)
83 * nor the location or size of the kernel virtual address space have any
84 * bearing on what we use for user addresses. We want something relatively
85 * high to give a large address space, but we also have to take the out of
86 * range va hole into account. So we pick an address just before the start
87 * of the hole, which gives a user address space of just under 8TB. Note
88 * that if this moves above the va hole, we will have to deal with sign
89 * extension of virtual addresses.
90 */
91#define VM_MAXUSER_ADDRESS ((vm_offset_t)0x7fe00000000)
|
81
| 92
|
| 93#define VM_MIN_ADDRESS ((vm_offset_t)0)
94#define VM_MAX_ADDRESS (VM_MAXUSER_ADDRESS)
95
96/*
97 * Initial user stack address for 64 bit processes. Should be highest user
98 * virtual address.
99 */
|
82#define USRSTACK VM_MAXUSER_ADDRESS
83
| 100#define USRSTACK VM_MAXUSER_ADDRESS
101
|
84#define VM_MIN_ADDRESS (0x100000)
85
| |
86/*
87 * Virtual size (bytes) for various kernel submaps.
88 */
89#ifndef VM_KMEM_SIZE
90#define VM_KMEM_SIZE (12*1024*1024)
91#endif
92
93/*
94 * Number of 4 meg pages to use for the kernel tsb.
95 */
96#ifndef KVA_PAGES
97#define KVA_PAGES (1)
98#endif
99
100/*
101 * Range of kernel virtual addresses. max = min + range.
102 */
103#define KVA_RANGE \
| 102/*
103 * Virtual size (bytes) for various kernel submaps.
104 */
105#ifndef VM_KMEM_SIZE
106#define VM_KMEM_SIZE (12*1024*1024)
107#endif
108
109/*
110 * Number of 4 meg pages to use for the kernel tsb.
111 */
112#ifndef KVA_PAGES
113#define KVA_PAGES (1)
114#endif
115
116/*
117 * Range of kernel virtual addresses. max = min + range.
118 */
119#define KVA_RANGE \
|
104 ((KVA_PAGES * PAGE_SIZE_4M) << (PAGE_SHIFT - STTE_SHIFT))
| 120 ((KVA_PAGES * PAGE_SIZE_4M) << (PAGE_SHIFT - TTE_SHIFT))
|
105
106/*
107 * Lowest kernel virtual address, where the kernel is loaded.
108 *
109 * If we are using less than 4 super pages for the kernel tsb, the address
110 * space is less than 4 gigabytes, so put it at the end of the first 4
111 * gigbytes. This allows the kernel and the firmware mappings to be mapped
112 * with a single contiguous tsb. Otherwise start at 0, we'll cover them
113 * anyway.
114 *
115 * ie:
116 * kva_pages = 1
117 * vm_max_kernel_address 0xffffe000
118 * openfirmware 0xf0000000
119 * kernbase 0xc0000000
120 * kva_pages = 8
121 * vm_max_kernel_address 0x1ffffe000
122 * openfirmware 0xf0000000
123 * kernbase 0x0
124 *
125 * There are at least 4 pages of dynamic linker junk before kernel text begins,
| 121
122/*
123 * Lowest kernel virtual address, where the kernel is loaded.
124 *
125 * If we are using less than 4 super pages for the kernel tsb, the address
126 * space is less than 4 gigabytes, so put it at the end of the first 4
127 * gigbytes. This allows the kernel and the firmware mappings to be mapped
128 * with a single contiguous tsb. Otherwise start at 0, we'll cover them
129 * anyway.
130 *
131 * ie:
132 * kva_pages = 1
133 * vm_max_kernel_address 0xffffe000
134 * openfirmware 0xf0000000
135 * kernbase 0xc0000000
136 * kva_pages = 8
137 * vm_max_kernel_address 0x1ffffe000
138 * openfirmware 0xf0000000
139 * kernbase 0x0
140 *
141 * There are at least 4 pages of dynamic linker junk before kernel text begins,
|
126 * so starting at zero is fairly safe.
| 142 * so starting at zero is fairly safe (if the firmware will let us).
|
127 */
128#if KVA_PAGES < 4
129#define VM_MIN_KERNEL_ADDRESS ((1UL << 32) - KVA_RANGE)
130#else
131#define VM_MIN_KERNEL_ADDRESS (0)
132#endif
133
134#define VM_MAX_KERNEL_ADDRESS (VM_MIN_KERNEL_ADDRESS + KVA_RANGE - PAGE_SIZE)
| 143 */
144#if KVA_PAGES < 4
145#define VM_MIN_KERNEL_ADDRESS ((1UL << 32) - KVA_RANGE)
146#else
147#define VM_MIN_KERNEL_ADDRESS (0)
148#endif
149
150#define VM_MAX_KERNEL_ADDRESS (VM_MIN_KERNEL_ADDRESS + KVA_RANGE - PAGE_SIZE)
|
135#define UPT_MIN_ADDRESS (VM_MIN_KERNEL_ADDRESS + KVA_RANGE)
| |
136#define KERNBASE (VM_MIN_KERNEL_ADDRESS)
137
138/*
139 * Initial pagein size of beginning of executable file.
140 */
141#ifndef VM_INITIAL_PAGEIN
142#define VM_INITIAL_PAGEIN 16
143#endif
144
145#endif /* !_MACHINE_VMPARAM_H_ */
| 151#define KERNBASE (VM_MIN_KERNEL_ADDRESS)
152
153/*
154 * Initial pagein size of beginning of executable file.
155 */
156#ifndef VM_INITIAL_PAGEIN
157#define VM_INITIAL_PAGEIN 16
158#endif
159
160#endif /* !_MACHINE_VMPARAM_H_ */
|