vmparam.h revision 1.27 1 1.27 fvdl /* $NetBSD: vmparam.h,v 1.27 2005/03/26 05:12:34 fvdl Exp $ */
2 1.1 eeh
3 1.1 eeh /*
4 1.1 eeh * Copyright (c) 1992, 1993
5 1.1 eeh * The Regents of the University of California. All rights reserved.
6 1.1 eeh *
7 1.1 eeh * This software was developed by the Computer Systems Engineering group
8 1.1 eeh * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
9 1.1 eeh * contributed to Berkeley.
10 1.1 eeh *
11 1.1 eeh * All advertising materials mentioning features or use of this software
12 1.1 eeh * must display the following acknowledgement:
13 1.1 eeh * This product includes software developed by the University of
14 1.1 eeh * California, Lawrence Berkeley Laboratory.
15 1.1 eeh *
16 1.1 eeh * Redistribution and use in source and binary forms, with or without
17 1.1 eeh * modification, are permitted provided that the following conditions
18 1.1 eeh * are met:
19 1.1 eeh * 1. Redistributions of source code must retain the above copyright
20 1.1 eeh * notice, this list of conditions and the following disclaimer.
21 1.1 eeh * 2. Redistributions in binary form must reproduce the above copyright
22 1.1 eeh * notice, this list of conditions and the following disclaimer in the
23 1.1 eeh * documentation and/or other materials provided with the distribution.
24 1.24 agc * 3. Neither the name of the University nor the names of its contributors
25 1.1 eeh * may be used to endorse or promote products derived from this software
26 1.1 eeh * without specific prior written permission.
27 1.1 eeh *
28 1.1 eeh * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 1.1 eeh * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 1.1 eeh * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 1.1 eeh * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 1.1 eeh * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 1.1 eeh * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 1.1 eeh * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 1.1 eeh * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 1.1 eeh * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 1.1 eeh * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 1.1 eeh * SUCH DAMAGE.
39 1.1 eeh *
40 1.1 eeh * @(#)vmparam.h 8.1 (Berkeley) 6/11/93
41 1.1 eeh */
42 1.1 eeh
43 1.1 eeh /*
44 1.1 eeh * Machine dependent constants for Sun-4c SPARC
45 1.1 eeh */
46 1.1 eeh
47 1.12 eeh #ifndef VMPARAM_H
48 1.12 eeh #define VMPARAM_H
49 1.23 thorpej
50 1.23 thorpej /*
51 1.23 thorpej * We use 8K VM pages on the Sun4U. Override the PAGE_* definitions
52 1.23 thorpej * to be compile-time constants.
53 1.23 thorpej */
54 1.23 thorpej #define PAGE_SHIFT 13
55 1.23 thorpej #define PAGE_SIZE (1 << PAGE_SHIFT)
56 1.23 thorpej #define PAGE_MASK (PAGE_SIZE - 1)
57 1.12 eeh
58 1.1 eeh /*
59 1.22 thorpej * USRSTACK is the top (end) of the user stack.
60 1.1 eeh */
61 1.14 mrg #define USRSTACK32 0xffffe000L
62 1.13 eeh #ifdef __arch64__
63 1.13 eeh #define USRSTACK 0xffffffffffffe000L
64 1.13 eeh #else
65 1.14 mrg #define USRSTACK USRSTACK32
66 1.13 eeh #endif
67 1.1 eeh
68 1.1 eeh /*
69 1.1 eeh * Virtual memory related constants, all in bytes
70 1.15 eeh */
71 1.15 eeh /* #ifdef __arch64__ */
72 1.15 eeh #if 0
73 1.15 eeh /*
74 1.15 eeh * 64-bit limits:
75 1.15 eeh *
76 1.15 eeh * Since the compiler generates `call' instructions we can't
77 1.15 eeh * have more than 4GB in a single text segment.
78 1.13 eeh *
79 1.15 eeh * And since we only have a 40-bit adderss space, allow half
80 1.15 eeh * of that for data and the other half for stack.
81 1.1 eeh */
82 1.1 eeh #ifndef MAXTSIZ
83 1.15 eeh #define MAXTSIZ (4L*1024*1024*1024) /* max text size */
84 1.15 eeh #endif
85 1.15 eeh #ifndef DFLDSIZ
86 1.15 eeh #define DFLDSIZ (128L*1024*1024) /* initial data size limit */
87 1.15 eeh #endif
88 1.15 eeh #ifndef MAXDSIZ
89 1.15 eeh #define MAXDSIZ (1L<<39) /* max data size */
90 1.15 eeh #endif
91 1.15 eeh #ifndef DFLSSIZ
92 1.20 thorpej #define DFLSSIZ (2*1024*1024) /* initial stack size limit */
93 1.15 eeh #endif
94 1.15 eeh #ifndef MAXSSIZ
95 1.15 eeh #define MAXSSIZ MAXDSIZ /* max stack size */
96 1.15 eeh #endif
97 1.15 eeh #else
98 1.15 eeh /*
99 1.15 eeh * 32-bit limits:
100 1.15 eeh *
101 1.15 eeh * We only have 4GB to play with. Limit stack, data, and text
102 1.15 eeh * each to half of that.
103 1.15 eeh *
104 1.15 eeh * This is silly. Apparently if we go above these numbers
105 1.15 eeh * integer overflows in other parts of the kernel cause hangs.
106 1.15 eeh */
107 1.15 eeh #ifndef MAXTSIZ
108 1.15 eeh #define MAXTSIZ (1*1024*1024*1024) /* max text size */
109 1.1 eeh #endif
110 1.1 eeh #ifndef DFLDSIZ
111 1.14 mrg #define DFLDSIZ (128*1024*1024) /* initial data size limit */
112 1.1 eeh #endif
113 1.1 eeh #ifndef MAXDSIZ
114 1.15 eeh #define MAXDSIZ (1*1024*1024*1024) /* max data size */
115 1.1 eeh #endif
116 1.1 eeh #ifndef DFLSSIZ
117 1.20 thorpej #define DFLSSIZ (2*1024*1024) /* initial stack size limit */
118 1.1 eeh #endif
119 1.1 eeh #ifndef MAXSSIZ
120 1.15 eeh #define MAXSSIZ (8*1024*1024) /* max stack size */
121 1.15 eeh #endif
122 1.1 eeh #endif
123 1.27 fvdl
124 1.27 fvdl /*
125 1.27 fvdl * 32-bit emulation limits.
126 1.27 fvdl */
127 1.27 fvdl #ifndef MAXTSIZ32
128 1.27 fvdl #define MAXTSIZ32 (1*1024*1024*1024) /* max text size */
129 1.27 fvdl #endif
130 1.27 fvdl #ifndef DFLDSIZ32
131 1.27 fvdl #define DFLDSIZ32 (128*1024*1024) /* initial data size limit */
132 1.27 fvdl #endif
133 1.27 fvdl #ifndef MAXDSIZ32
134 1.27 fvdl #define MAXDSIZ32 (1*1024*1024*1024) /* max data size */
135 1.27 fvdl #endif
136 1.27 fvdl #ifndef DFLSSIZ32
137 1.27 fvdl #define DFLSSIZ32 (2*1024*1024) /* initial stack size limit */
138 1.27 fvdl #endif
139 1.27 fvdl #ifndef MAXSSIZ32
140 1.27 fvdl #define MAXSSIZ32 (8*1024*1024) /* max stack size */
141 1.27 fvdl #endif
142 1.27 fvdl
143 1.1 eeh /*
144 1.1 eeh * Size of shared memory map
145 1.1 eeh */
146 1.1 eeh #ifndef SHMMAXPGS
147 1.1 eeh #define SHMMAXPGS 1024
148 1.1 eeh #endif
149 1.1 eeh
150 1.1 eeh /*
151 1.1 eeh * Mach derived constants
152 1.1 eeh */
153 1.1 eeh
154 1.1 eeh /*
155 1.11 mrg * User/kernel map constants.
156 1.1 eeh */
157 1.4 eeh #define VM_MIN_ADDRESS ((vaddr_t)0)
158 1.13 eeh #define VM_MAX_ADDRESS ((vaddr_t)-1)
159 1.13 eeh #define VM_MAXUSER_ADDRESS ((vaddr_t)-1)
160 1.16 eeh #define VM_MAXUSER_ADDRESS32 ((vaddr_t)(0x00000000ffffffffL&~PGOFSET))
161 1.13 eeh
162 1.4 eeh #define VM_MIN_KERNEL_ADDRESS ((vaddr_t)KERNBASE)
163 1.7 eeh #define VM_MAX_KERNEL_ADDRESS ((vaddr_t)KERNEND)
164 1.1 eeh
165 1.2 mrg #define VM_PHYSSEG_MAX 32 /* up to 32 segments */
166 1.1 eeh #define VM_PHYSSEG_STRAT VM_PSTRAT_BSEARCH
167 1.1 eeh #define VM_PHYSSEG_NOADD /* can't add RAM after vm_mem_init */
168 1.3 thorpej
169 1.3 thorpej #define VM_NFREELIST 1
170 1.3 thorpej #define VM_FREELIST_DEFAULT 0
171 1.17 thorpej
172 1.21 chs #ifdef _KERNEL
173 1.21 chs
174 1.21 chs #define __HAVE_VM_PAGE_MD
175 1.1 eeh
176 1.1 eeh /*
177 1.21 chs * For each struct vm_page, there is a list of all currently valid virtual
178 1.21 chs * mappings of that page. An entry is a pv_entry_t.
179 1.1 eeh */
180 1.21 chs struct pmap;
181 1.21 chs typedef struct pv_entry {
182 1.21 chs struct pv_entry *pv_next; /* next pv_entry */
183 1.21 chs struct pmap *pv_pmap; /* pmap where mapping lies */
184 1.21 chs vaddr_t pv_va; /* virtual address for mapping */
185 1.21 chs } *pv_entry_t;
186 1.21 chs /* PV flags encoded in the low bits of the VA of the first pv_entry */
187 1.1 eeh
188 1.21 chs struct vm_page_md {
189 1.21 chs struct pv_entry mdpg_pvh;
190 1.1 eeh };
191 1.21 chs #define VM_MDPAGE_INIT(pg) \
192 1.21 chs do { \
193 1.21 chs (pg)->mdpage.mdpg_pvh.pv_next = NULL; \
194 1.21 chs (pg)->mdpage.mdpg_pvh.pv_pmap = NULL; \
195 1.26 kleink (pg)->mdpage.mdpg_pvh.pv_va = 0; \
196 1.21 chs } while (/*CONSTCOND*/0)
197 1.21 chs
198 1.21 chs #endif /* _KERNEL */
199 1.1 eeh
200 1.1 eeh #endif
201