1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
|
/*-
* Copyright (c) 2001 The NetBSD Foundation, Inc.
* All rights reserved.
*
* This code is derived from software contributed to The NetBSD Foundation
* by Matt Thomas <matt@3am-softwre.com> of Allegro Networks, Inc.
*
* 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 NetBSD
* Foundation, Inc. and its contributors.
* 4. Neither the name of The NetBSD Foundation 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 NETBSD FOUNDATION, INC. 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 FOUNDATION 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.
*/
#ifndef _POWERPC_OEA_VMPARAM_H_
#define _POWERPC_OEA_VMPARAM_H_
#include <sys/queue.h>
/*
* Most of the definitions in this can be overriden by a machine-specific
* vmparam.h if required. Otherwise a port can just include this file
* get the right thing to happen.
*/
/*
* OEA processors have 4K pages. Override the PAGE_* definitions
* to be compile-time constants.
*/
#define PAGE_SHIFT 12
#define PAGE_SIZE (1 << PAGE_SHIFT)
#define PAGE_MASK (PAGE_SIZE - 1)
#ifndef USRSTACK
#define USRSTACK VM_MAXUSER_ADDRESS
#endif
#ifndef USRSTACK32
#define USRSTACK32 ((uint32_t)VM_MAXUSER_ADDRESS)
#endif
#ifndef MAXTSIZ
#define MAXTSIZ (64*1024*1024) /* maximum text size */
#endif
#ifndef MAXDSIZ
#define MAXDSIZ (1024*1024*1024) /* maximum data size */
#endif
#ifndef MAXSSIZ
#define MAXSSIZ (32*1024*1024) /* maximum stack size */
#endif
#ifndef DFLDSIZ
#define DFLDSIZ (128*1024*1024) /* default data size */
#endif
#ifndef DFLSSIZ
#define DFLSSIZ (2*1024*1024) /* default stack size */
#endif
/*
* Default maximum amount of shared memory pages
*/
#ifndef SHMMAXPGS
#define SHMMAXPGS 1024
#endif
/*
* Default number of pages in the user raw I/O map.
*/
#ifndef USRIOSIZE
#define USRIOSIZE 1024
#endif
/*
* The number of seconds for a process to be blocked before being
* considered very swappable.
*/
#ifndef MAXSLP
#define MAXSLP 20
#endif
/*
* Segment handling stuff
*/
#define SEGMENT_LENGTH ( 0x10000000L)
#define SEGMENT_MASK (~0x0fffffffL)
/*
* Macros to manipulate VSIDs
*/
#if 0
/*
* Move the SR# to the top bits to make the lower bits entirely random
* so to give better PTE distribution.
*/
#define VSID__KEYSHFT (SR_VSID_WIDTH - SR_KEY_LEN)
#define VSID_SR_INCREMENT ((1L << VSID__KEYSHFT) - 1)
#define VSID__HASHMASK (VSID_SR_INCREMENT - 1)
#define VSID_MAKE(sr, hash) \
(( \
(((sr) << VSID__KEYSHFT) | ((hash) & VSID__HASMASK))
<< SR_VSID_SHFT) & SR_VSID)
#define VSID_TO_SR(vsid) \
(((vsid) & SR_VSID) >> (SR_VSID_SHFT + VSID__KEYSHFT))
#define VSID_TO_HASH(vsid) \
(((vsid) & SR_VSID) >> SR_VSID_SHFT) & VSID__HASHMASK)
#else
#define VSID__HASHSHFT (SR_KEY_LEN)
#define VSID_SR_INCREMENT (1L << 0)
#define VSID__KEYMASK ((1L << VSID__HASHSHFT) - 1)
#define VSID_MAKE(sr, hash) \
(( \
(((hash) << VSID__HASHSHFT) | ((sr) & VSID__KEYMASK)) \
<< SR_VSID_SHFT) & SR_VSID)
#define VSID_TO_SR(vsid) \
(((vsid) >> SR_VSID_SHFT) & VSID__KEYMASK)
#define VSID_TO_HASH(vsid) \
(((vsid) & SR_VSID) >> (SR_VSID_SHFT + VSID__HASHSHFT))
#endif
/*
* Fixed segments
*/
#ifndef USER_SR
#define USER_SR 12
#endif
#ifndef KERNEL_SR
#define KERNEL_SR 13
#endif
#ifndef KERNEL2_SR
#define KERNEL2_SR 14
#endif
#define KERNEL2_SEGMENT VSID_MAKE(KERNEL2_SR, KERNEL_VSIDBITS)
#define KERNEL_VSIDBITS 0xfffff
#define KERNEL_SEGMENT VSID_MAKE(KERNEL_SR, KERNEL_VSIDBITS)
#define EMPTY_SEGMENT VSID_MAKE(0, KERNEL_VSIDBITS)
#define USER_ADDR ((void *)(USER_SR << ADDR_SR_SHFT))
/*
* Some system constants
*/
#ifndef NPMAPS
#define NPMAPS 32768 /* Number of pmaps in system */
#endif
#define VM_MIN_ADDRESS ((vaddr_t) 0)
#define VM_MAXUSER_ADDRESS ((vaddr_t) ~0xfffL)
#define VM_MAX_ADDRESS VM_MAXUSER_ADDRESS
#define VM_MIN_KERNEL_ADDRESS ((vaddr_t) (KERNEL_SR << ADDR_SR_SHFT))
#define VM_MAX_KERNEL_ADDRESS (VM_MIN_KERNEL_ADDRESS + 2*SEGMENT_LENGTH)
/*
* The address to which unspecified mapping requests default
* Put the stack in it's own segment and start mmaping at the
* top of the next lower segment.
*/
#ifdef _KERNEL_OPT
#include "opt_uvm.h"
#endif
#define __HAVE_TOPDOWN_VM
#ifdef USE_TOPDOWN_VM
#define VM_DEFAULT_ADDRESS(da, sz) \
(((VM_MAXUSER_ADDRESS - MAXSSIZ) & SEGMENT_MASK) - round_page(sz))
#endif
#ifndef VM_PHYSSEG_MAX
#define VM_PHYSSEG_MAX 16
#endif
#define VM_PHYSSEG_STRAT VM_PSTRAT_BIGFIRST
#define VM_PHYSSEG_NOADD
#ifndef VM_PHYS_SIZE
#define VM_PHYS_SIZE (USRIOSIZE * PAGE_SIZE)
#endif
#ifndef VM_MAX_KERNEL_BUF
#define VM_MAX_KERNEL_BUF (SEGMENT_LENGTH * 3 / 4)
#endif
#define VM_NFREELIST 16 /* 16 distinct memory segments */
#define VM_FREELIST_DEFAULT 0
#define VM_FREELIST_FIRST256 1
#define VM_FREELIST_FIRST16 2
#define VM_FREELIST_MAX 3
#ifndef _LOCORE
LIST_HEAD(pvo_head, pvo_entry);
#if __NetBSD_Version__ > 105180000
#define __HAVE_VM_PAGE_MD
struct vm_page_md {
struct pvo_head mdpg_pvoh;
unsigned int mdpg_attrs;
};
#define VM_MDPAGE_INIT(pg) do { \
LIST_INIT(&(pg)->mdpage.mdpg_pvoh); \
(pg)->mdpage.mdpg_attrs = 0; \
} while (/*CONSTCOND*/0)
#else
#define __HAVE_PMAP_PHYSSEG
struct pmap_physseg {
struct pvo_head *pvoh;
char *attrs;
};
#endif
#endif /* _LOCORE */
#endif /* _POWERPC_OEA_VMPARAM_H_ */
|