vmparam.h revision 172317 
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 172317 2007-09-25 06:25:06Z alc $
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/*
81 * The physical address space is sparsely populated.
82 */
83#define	VM_PHYSSEG_SPARSE
84
85/*
86 * The number of PHYSSEG entries must be one greater than the number
87 * of phys_avail entries because the phys_avail entry that spans the
88 * largest physical address that is accessible by ISA DMA is split
89 * into two PHYSSEG entries.
90 */
91#define	VM_PHYSSEG_MAX		64
92
93/*
94 * Create three free page pools: VM_FREEPOOL_DEFAULT is the default pool
95 * from which physical pages are allocated and VM_FREEPOOL_DIRECT is
96 * the pool from which physical pages for small UMA objects are
97 * allocated.
98 */
99#define	VM_NFREEPOOL		3
100#define	VM_FREEPOOL_CACHE	2
101#define	VM_FREEPOOL_DEFAULT	0
102#define	VM_FREEPOOL_DIRECT	1
103
104/*
105 * Create two free page lists: VM_FREELIST_DEFAULT is for physical
106 * pages that are above the largest physical address that is
107 * accessible by ISA DMA and VM_FREELIST_ISADMA is for physical pages
108 * that are below that address.
109 */
110#define	VM_NFREELIST		2
111#define	VM_FREELIST_DEFAULT	0
112#define	VM_FREELIST_ISADMA	1
113
114/*
115 * An allocation size of 16MB is supported in order to optimize the
116 * use of the direct map by UMA.  Specifically, a cache line contains
117 * at most four TTEs, collectively mapping 16MB of physical memory.
118 * By reducing the number of distinct 16MB "pages" that are used by UMA,
119 * the physical memory allocator reduces the likelihood of both 4MB
120 * page TLB misses and cache misses caused by 4MB page TLB misses.
121 */
122#define	VM_NFREEORDER		12
123
124/*
125 * Address space layout.
126 *
127 * UltraSPARC I and II implement a 44 bit virtual address space.  The address
128 * space is split into 2 regions at each end of the 64 bit address space, with
129 * an out of range "hole" in the middle.  UltraSPARC III implements the full
130 * 64 bit virtual address space, but we don't really have any use for it and
131 * 43 bits of user address space is considered to be "enough", so we ignore it.
132 *
133 * Upper region:	0xffffffffffffffff
134 * 			0xfffff80000000000
135 *
136 * Hole:		0xfffff7ffffffffff
137 * 			0x0000080000000000
138 *
139 * Lower region:	0x000007ffffffffff
140 * 			0x0000000000000000
141 *
142 * In general we ignore the upper region, and use the lower region as mappable
143 * space.
144 *
145 * We define some interesting address constants:
146 *
147 * VM_MIN_ADDRESS and VM_MAX_ADDRESS define the start and of the entire 64 bit
148 * address space, mostly just for convenience.
149 *
150 * VM_MIN_DIRECT_ADDRESS and VM_MAX_DIRECT_ADDRESS define the start and end
151 * of the direct mapped region.  This maps virtual addresses to physical
152 * addresses directly using 4mb tlb entries, with the physical address encoded
153 * in the lower 43 bits of virtual address.  These mappings are convenient
154 * because they do not require page tables, and because they never change they
155 * do not require tlb flushes.  However, since these mappings are cacheable,
156 * we must ensure that all pages accessed this way are either not double
157 * mapped, or that all other mappings have virtual color equal to physical
158 * color, in order to avoid creating illegal aliases in the data cache.
159 *
160 * VM_MIN_KERNEL_ADDRESS and VM_MAX_KERNEL_ADDRESS define the start and end of
161 * mappable kernel virtual address space.  VM_MIN_KERNEL_ADDRESS is basically
162 * arbitrary, a convenient address is chosen which allows both the kernel text
163 * and data and the prom's address space to be mapped with 1 4mb tsb page.
164 * VM_MAX_KERNEL_ADDRESS is variable, computed at startup time based on the
165 * amount of physical memory available.  Each 4mb tsb page provides 1g of
166 * virtual address space, with the only practical limit being available
167 * phsyical memory.
168 *
169 * VM_MIN_PROM_ADDRESS and VM_MAX_PROM_ADDRESS define the start and end of the
170 * prom address space.  On startup the prom's mappings are duplicated in the
171 * kernel tsb, to allow prom memory to be accessed normally by the kernel.
172 *
173 * VM_MIN_USER_ADDRESS and VM_MAX_USER_ADDRESS define the start and end of the
174 * user address space.  There are some hardware errata about using addresses
175 * at the boundary of the va hole, so we allow just under 43 bits of user
176 * address space.  Note that the kernel and user address spaces overlap, but
177 * this doesn't matter because they use different tlb contexts, and because
178 * the kernel address space is not mapped into each process' address space.
179 */
180#define	VM_MIN_ADDRESS		(0x0000000000000000UL)
181#define	VM_MAX_ADDRESS		(0xffffffffffffffffUL)
182
183#define	VM_MIN_DIRECT_ADDRESS	(0xfffff80000000000UL)
184#define	VM_MAX_DIRECT_ADDRESS	(VM_MAX_ADDRESS)
185
186#define	VM_MIN_KERNEL_ADDRESS	(0x00000000c0000000UL)
187#define	VM_MAX_KERNEL_ADDRESS	(vm_max_kernel_address)
188
189#define	VM_MIN_PROM_ADDRESS	(0x00000000f0000000UL)
190#define	VM_MAX_PROM_ADDRESS	(0x00000000ffffe000UL)
191
192#define	VM_MIN_USER_ADDRESS	(0x0000000000000000UL)
193#define	VM_MAX_USER_ADDRESS	(0x000007fe00000000UL)
194
195#define	VM_MINUSER_ADDRESS	(VM_MIN_USER_ADDRESS)
196#define	VM_MAXUSER_ADDRESS	(VM_MAX_USER_ADDRESS)
197
198#define	KERNBASE		(VM_MIN_KERNEL_ADDRESS)
199#define	USRSTACK		(VM_MAX_USER_ADDRESS)
200
201/*
202 * Virtual size (bytes) for various kernel submaps.
203 */
204#ifndef	VM_KMEM_SIZE
205#define	VM_KMEM_SIZE		(16*1024*1024)
206#endif
207
208/*
209 * How many physical pages per KVA page allocated.
210 * min(max(max(VM_KMEM_SIZE, Physical memory/VM_KMEM_SIZE_SCALE),
211 *     VM_KMEM_SIZE_MIN), VM_KMEM_SIZE_MAX)
212 * is the total KVA space allocated for kmem_map.
213 */
214#ifndef VM_KMEM_SIZE_SCALE
215#define	VM_KMEM_SIZE_SCALE	(3)
216#endif
217
218/*
219 * Initial pagein size of beginning of executable file.
220 */
221#ifndef	VM_INITIAL_PAGEIN
222#define	VM_INITIAL_PAGEIN	16
223#endif
224
225#define	UMA_MD_SMALL_ALLOC
226
227extern vm_offset_t vm_max_kernel_address;
228
229#endif /* !_MACHINE_VMPARAM_H_ */
230