xref: /netbsd-src/sys/arch/netwinder/include/vmparam.h (revision 3b01aba77a7a698587faaae455bbfe740923c1f5)
1 /*	$NetBSD: vmparam.h,v 1.3 2001/05/01 02:19:17 thorpej Exp $	*/
2 
3 /*
4  * Copyright (c) 1988 The Regents of the University of California.
5  * All rights reserved.
6  *
7  * Redistribution and use in source and binary forms, with or without
8  * modification, are permitted provided that the following conditions
9  * are met:
10  * 1. Redistributions of source code must retain the above copyright
11  *    notice, this list of conditions and the following disclaimer.
12  * 2. Redistributions in binary form must reproduce the above copyright
13  *    notice, this list of conditions and the following disclaimer in the
14  *    documentation and/or other materials provided with the distribution.
15  * 3. All advertising materials mentioning features or use of this software
16  *    must display the following acknowledgement:
17  *	This product includes software developed by the University of
18  *	California, Berkeley and its contributors.
19  * 4. Neither the name of the University nor the names of its contributors
20  *    may be used to endorse or promote products derived from this software
21  *    without specific prior written permission.
22  *
23  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
24  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
25  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
26  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
27  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
28  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
29  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
30  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
31  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
32  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
33  * SUCH DAMAGE.
34  */
35 
36 #ifndef	_ARM32_VMPARAM_H_
37 #define	_ARM32_VMPARAM_H_
38 
39 /* for pt_entry_t definition */
40 #include <machine/pte.h>
41 
42 #define	USRTEXT		VM_MIN_ADDRESS
43 #define	USRSTACK	VM_MAXUSER_ADDRESS
44 
45 /*
46  * Note that MAXTSIZ mustn't be greater than 32M. Otherwise you'd have
47  * to change the compiler to not generate bl instructions
48  */
49 #define	MAXTSIZ		(16*1024*1024)		/* max text size */
50 #ifndef	DFLDSIZ
51 #define	DFLDSIZ		(128*1024*1024)		/* initial data size limit */
52 #endif
53 #ifndef	MAXDSIZ
54 #define	MAXDSIZ		(512*1024*1024)		/* max data size */
55 #endif
56 #ifndef	DFLSSIZ
57 #define	DFLSSIZ		(2*1024*1024)		/* initial stack size limit */
58 #endif
59 #ifndef	MAXSSIZ
60 #define	MAXSSIZ		(8*1024*1024)		/* max stack size */
61 #endif
62 
63 /*
64  * Size of shared memory map
65  */
66 #ifndef SHMMAXPGS
67 #define SHMMAXPGS       1024
68 #endif
69 
70 /*
71  * The time for a process to be blocked before being very swappable.
72  * This is a number of seconds which the system takes as being a non-trivial
73  * amount of real time.  You probably shouldn't change this;
74  * it is used in subtle ways (fractions and multiples of it are, that is, like
75  * half of a `long time'', almost a long time, etc.)
76  * It is related to human patience and other factors which don't really
77  * change over time.
78  */
79 #define	MAXSLP		20
80 
81 /*
82  * Address space constants
83  */
84 
85 /*
86  * The line between user space and kernel space
87  * Mappings >= KERNEL_SPACE_START are constant across all processes
88  */
89 #define	KERNEL_SPACE_START	0xf0000000
90 
91 /* total number of page table entries to map 4GB * size of each entry*/
92 #define	PAGE_TABLE_SPACE	((1 << (32 - PGSHIFT)) * sizeof(pt_entry_t))
93 
94 /* Address where the page tables are mapped */
95 #define	PAGE_TABLE_SPACE_START	(KERNEL_SPACE_START - PAGE_TABLE_SPACE)
96 
97 /* Various constants used by the MD code*/
98 #define	KERNEL_BASE		0xf0000000
99 #define	KERNEL_TEXT_BASE	(KERNEL_BASE + 0xc000)
100 #define	ALT_PAGE_TBLS_BASE	0xf0c00000
101 #define	KERNEL_VM_BASE		0xf1000000
102 /*
103  * The Kernel VM Size varies depending on the machine depending on how
104  * much space is needed (and where) for other mappings.
105  * In some cases the chosen value may not be the maximum in order that
106  * we don't waste memory with kernel pages tables as we can't currently
107  * grow the kernel page tables after booting.
108  * You only need to increase these values if you find that the number of
109  * buffers is being limited due to lack of VA space.
110  */
111 /*
112  * The range 0xf1000000 - 0xfcffffff is available for kernel VM space
113  * Footbridge registers and I/O mappings occupy 0xfd000000 - 0xffffffff
114  */
115 #define KERNEL_VM_SIZE		0x06000000
116 #define	PROCESS_PAGE_TBLS_BASE	PAGE_TABLE_SPACE_START
117 
118 /*
119  * Override the default pager_map size, there's not enough KVA.
120  */
121 #define PAGER_MAP_SIZE		(4 * 1024 * 1024)
122 
123 /*
124  * Mach derived constants
125  */
126 
127 #define	VM_MIN_ADDRESS		((vm_offset_t)0x00001000)
128 #define	VM_MAXUSER_ADDRESS	((vm_offset_t)(PAGE_TABLE_SPACE_START - UPAGES * NBPG))
129 #define	VM_MAX_ADDRESS		((vm_offset_t)(PAGE_TABLE_SPACE_START + (KERNEL_SPACE_START >> PGSHIFT) * sizeof(pt_entry_t)))
130 
131 #define	VM_MIN_KERNEL_ADDRESS	((vm_offset_t)KERNEL_TEXT_BASE)
132 #define	VM_MAXKERN_ADDRESS	((vm_offset_t)(KERNEL_VM_BASE + KERNEL_VM_SIZE))
133 #define	VM_MAX_KERNEL_ADDRESS	((vm_offset_t)0xffffffff)
134 
135 /*
136  * Size of User Raw I/O map
137  */
138 
139 #define USRIOSIZE       300
140 
141 /* XXX max. amount of KVM to be used by buffers. */
142 #ifndef VM_MAX_KERNEL_BUF
143 #define VM_MAX_KERNEL_BUF \
144 	((VM_MAXKERN_ADDRESS - KERNEL_VM_BASE) * 4 / 10)
145 #endif
146 
147 /* virtual sizes (bytes) for various kernel submaps */
148 
149 #define VM_PHYS_SIZE		(USRIOSIZE*NBPG)
150 
151 /*
152  * max number of non-contig chunks of physical RAM you can have
153  */
154 
155 #define	VM_PHYSSEG_MAX		32
156 
157 /*
158  * when converting a physical address to a vm_page structure, we
159  * want to use a binary search on the chunks of physical memory
160  * to find our RAM
161  */
162 
163 #define	VM_PHYSSEG_STRAT	VM_PSTRAT_BSEARCH
164 
165 /*
166  * this indicates that we can't add RAM to the VM system after the
167  * vm system is init'd.
168  */
169 
170 #define	VM_PHYSSEG_NOADD
171 
172 /*
173  * we support 2 free lists:
174  *
175  *	- DEFAULT for all systems
176  *	- ISADMA for the ISA DMA range on Sharks only
177  */
178 
179 #define	VM_NFREELIST		2
180 #define	VM_FREELIST_DEFAULT	0
181 #define	VM_FREELIST_ISADMA	1
182 
183 /*
184  * define structure pmap_physseg: there is one of these structures
185  * for each chunk of noncontig RAM you have.
186  */
187 
188 #define	__HAVE_PMAP_PHYSSEG
189 
190 struct pmap_physseg {
191 	struct pv_entry *pvent;		/* pv_entry array */
192 	char *attrs;			/* attrs array */
193 };
194 
195 #endif	/* _ARM32_VMPARAM_H_ */
196 
197 /* End of vmparam.h */
198