param.h revision 1.3 1 1.3 reinoud /* $NetBSD: param.h,v 1.3 2001/02/26 00:07:54 reinoud Exp $ */
2 1.1 ichiro
3 1.3 reinoud /*
4 1.3 reinoud * Copyright (c) 1994,1995 Mark Brinicombe.
5 1.3 reinoud * All rights reserved.
6 1.3 reinoud *
7 1.3 reinoud * Redistribution and use in source and binary forms, with or without
8 1.3 reinoud * modification, are permitted provided that the following conditions
9 1.3 reinoud * are met:
10 1.3 reinoud * 1. Redistributions of source code must retain the above copyright
11 1.3 reinoud * notice, this list of conditions and the following disclaimer.
12 1.3 reinoud * 2. Redistributions in binary form must reproduce the above copyright
13 1.3 reinoud * notice, this list of conditions and the following disclaimer in the
14 1.3 reinoud * documentation and/or other materials provided with the distribution.
15 1.3 reinoud * 3. All advertising materials mentioning features or use of this software
16 1.3 reinoud * must display the following acknowledgement:
17 1.3 reinoud * This product includes software developed by the RiscBSD team.
18 1.3 reinoud * 4. The name "RiscBSD" nor the name of the author may be used to
19 1.3 reinoud * endorse or promote products derived from this software without specific
20 1.3 reinoud * prior written permission.
21 1.3 reinoud *
22 1.3 reinoud * THIS SOFTWARE IS PROVIDED BY RISCBSD ``AS IS'' AND ANY EXPRESS OR IMPLIED
23 1.3 reinoud * WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF
24 1.3 reinoud * MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
25 1.3 reinoud * IN NO EVENT SHALL RISCBSD OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT,
26 1.3 reinoud * INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES
27 1.3 reinoud * (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR
28 1.3 reinoud * SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 1.3 reinoud * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 1.3 reinoud * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 1.3 reinoud * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32 1.3 reinoud * SUCH DAMAGE.
33 1.3 reinoud */
34 1.3 reinoud
35 1.3 reinoud #ifndef _ARM32_PARAM_H_
36 1.3 reinoud #define _ARM32_PARAM_H_
37 1.3 reinoud
38 1.3 reinoud #ifdef _KERNEL
39 1.3 reinoud # include <machine/cpu.h>
40 1.3 reinoud #endif
41 1.3 reinoud
42 1.3 reinoud /*
43 1.3 reinoud * Machine dependent constants for ARM6+ processors
44 1.3 reinoud */
45 1.3 reinoud
46 1.3 reinoud #define _MACHINE hpcarm
47 1.3 reinoud #define MACHINE "hpcarm"
48 1.3 reinoud #define _MACHINE_ARCH arm
49 1.3 reinoud #define MACHINE_ARCH "arm"
50 1.3 reinoud #define MID_MACHINE MID_ARM6
51 1.3 reinoud
52 1.3 reinoud /*
53 1.3 reinoud * Round p (pointer or byte index) up to a correctly-aligned value
54 1.3 reinoud * for all data types (int, long, ...). The result is u_int and
55 1.3 reinoud * must be cast to any desired pointer type.
56 1.3 reinoud *
57 1.3 reinoud * ALIGNED_POINTER is a boolean macro that checks whether an address
58 1.3 reinoud * is valid to fetch data elements of type t from on this architecture.
59 1.3 reinoud * This does not reflect the optimal alignment, just the possibility
60 1.3 reinoud * (within reasonable limits).
61 1.3 reinoud *
62 1.3 reinoud */
63 1.3 reinoud #define ALIGNBYTES (sizeof(int) - 1)
64 1.3 reinoud #define ALIGN(p) (((u_int)(p) + ALIGNBYTES) &~ ALIGNBYTES)
65 1.3 reinoud #define ALIGNED_POINTER(p,t) ((((u_long)(p)) & (sizeof(t)-1)) == 0)
66 1.3 reinoud
67 1.3 reinoud #define PGSHIFT 12 /* LOG2(NBPG) */
68 1.3 reinoud #define NBPG (1 << PGSHIFT) /* bytes/page */
69 1.3 reinoud #define PGOFSET (NBPG-1) /* byte offset into page */
70 1.3 reinoud #define NPTEPG (NBPG/(sizeof (pt_entry_t)))
71 1.3 reinoud
72 1.3 reinoud
73 1.3 reinoud #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */
74 1.3 reinoud #define DEV_BSIZE (1 << DEV_BSHIFT)
75 1.3 reinoud #define BLKDEV_IOSIZE 2048
76 1.3 reinoud #define MAXPHYS (64 * 1024) /* max raw I/O transfer size */
77 1.3 reinoud
78 1.3 reinoud #define SSIZE 1 /* initial stack size/NBPG */
79 1.3 reinoud #define SINCR 1 /* increment of stack/NBPG */
80 1.3 reinoud #define UPAGES 2 /* pages of u-area */
81 1.3 reinoud #define USPACE (UPAGES * NBPG) /* total size of u-area */
82 1.3 reinoud
83 1.3 reinoud #ifndef MSGBUFSIZE
84 1.3 reinoud #define MSGBUFSIZE NBPG /* default message buffer size */
85 1.3 reinoud #endif
86 1.3 reinoud
87 1.3 reinoud /*
88 1.3 reinoud * Constants related to network buffer management.
89 1.3 reinoud * MCLBYTES must be no larger than NBPG (the software page size), and,
90 1.3 reinoud * on machines that exchange pages of input or output buffers with mbuf
91 1.3 reinoud * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple
92 1.3 reinoud * of the hardware page size.
93 1.3 reinoud */
94 1.3 reinoud #define MSIZE 256 /* size of an mbuf */
95 1.3 reinoud #define MCLSHIFT 11 /* convert bytes to m_buf clusters */
96 1.3 reinoud #define MCLBYTES (1 << MCLSHIFT) /* size of a m_buf cluster */
97 1.3 reinoud #define MCLOFSET (MCLBYTES - 1) /* offset within a m_buf cluster */
98 1.3 reinoud
99 1.3 reinoud #ifndef NMBCLUSTERS
100 1.3 reinoud
101 1.3 reinoud #if defined(_KERNEL) && !defined(_LKM)
102 1.3 reinoud #include "opt_gateway.h"
103 1.3 reinoud #endif /* _KERNEL && ! _LKM */
104 1.3 reinoud
105 1.3 reinoud #ifdef GATEWAY
106 1.3 reinoud #define NMBCLUSTERS 512 /* map size, max cluster allocation */
107 1.3 reinoud #else
108 1.3 reinoud #define NMBCLUSTERS 256 /* map size, max cluster allocation */
109 1.3 reinoud #endif
110 1.3 reinoud #endif
111 1.3 reinoud
112 1.3 reinoud /*
113 1.3 reinoud * Minimum and maximum sizes of the kernel malloc arena in PAGE_SIZE-sized
114 1.3 reinoud * logical pages.
115 1.3 reinoud */
116 1.3 reinoud #define NKMEMPAGES_MIN_DEFAULT ((6 * 1024 * 1024) >> PAGE_SHIFT)
117 1.3 reinoud #define NKMEMPAGES_MAX_DEFAULT ((7 * 1024 * 1024) >> PAGE_SHIFT)
118 1.3 reinoud
119 1.3 reinoud /* pages ("clicks") (4096 bytes) to disk blocks */
120 1.3 reinoud #define ctod(x) ((x) << (PGSHIFT - DEV_BSHIFT))
121 1.3 reinoud #define dtoc(x) ((x) >> (PGSHIFT - DEV_BSHIFT))
122 1.3 reinoud /*#define dtob(x) ((x) << DEV_BSHIFT)*/
123 1.3 reinoud
124 1.3 reinoud #define ctob(x) ((x) << PGSHIFT)
125 1.3 reinoud
126 1.3 reinoud /* bytes to pages */
127 1.3 reinoud #define btoc(x) (((x) + PGOFSET) >> PGSHIFT)
128 1.3 reinoud
129 1.3 reinoud #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \
130 1.3 reinoud ((bytes) >> DEV_BSHIFT)
131 1.3 reinoud #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \
132 1.3 reinoud ((db) << DEV_BSHIFT)
133 1.3 reinoud
134 1.3 reinoud /*
135 1.3 reinoud * Map a ``block device block'' to a file system block.
136 1.3 reinoud * This should be device dependent, and should use the bsize
137 1.3 reinoud * field from the disk label.
138 1.3 reinoud * For now though just use DEV_BSIZE.
139 1.3 reinoud */
140 1.3 reinoud #define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE / DEV_BSIZE))
141 1.3 reinoud
142 1.3 reinoud /* Constants used to divide the USPACE area */
143 1.3 reinoud
144 1.3 reinoud /*
145 1.3 reinoud * The USPACE area contains :
146 1.3 reinoud * 1. the user structure for the process
147 1.3 reinoud * 2. the fp context for FP emulation
148 1.3 reinoud * 3. the kernel (svc) stack
149 1.3 reinoud * 4. the undefined instruction stack
150 1.3 reinoud *
151 1.3 reinoud * The layout of the area looks like this
152 1.3 reinoud *
153 1.3 reinoud * | user area | FP context | undefined stack | kernel stack |
154 1.3 reinoud *
155 1.3 reinoud * The size of the user area is known.
156 1.3 reinoud * The size of the FP context is variable depending of the FP emulator
157 1.3 reinoud * in use and whether there is hardware FP support. However we can put
158 1.3 reinoud * an upper limit on it.
159 1.3 reinoud * The undefined stack needs to be at least 512 bytes. This is a requirement
160 1.3 reinoud * if the FP emulators
161 1.3 reinoud * The kernel stack should be at least 4K is size.
162 1.3 reinoud *
163 1.3 reinoud * The stack top addresses are used to set the stack pointers. The stack bottom
164 1.3 reinoud * addresses at the addresses monitored by the diagnostic code for stack overflows
165 1.3 reinoud *
166 1.3 reinoud */
167 1.3 reinoud
168 1.3 reinoud #define FPCONTEXTSIZE (0x100)
169 1.3 reinoud #define USPACE_SVC_STACK_TOP (USPACE)
170 1.3 reinoud #define USPACE_SVC_STACK_BOTTOM (USPACE_SVC_STACK_TOP - 0x1000)
171 1.3 reinoud #define USPACE_UNDEF_STACK_TOP (USPACE_SVC_STACK_BOTTOM - 0x10)
172 1.3 reinoud #define USPACE_UNDEF_STACK_BOTTOM (sizeof(struct user) + FPCONTEXTSIZE + 10)
173 1.3 reinoud
174 1.3 reinoud #define arm_byte_to_page(x) ((x) >> PGSHIFT)
175 1.3 reinoud #define arm_page_to_byte(x) ((x) << PGSHIFT)
176 1.3 reinoud
177 1.3 reinoud #ifdef _KERNEL
178 1.3 reinoud #ifndef _LOCORE
179 1.3 reinoud void delay __P((unsigned));
180 1.3 reinoud #define DELAY(x) delay(x)
181 1.3 reinoud #endif
182 1.3 reinoud #endif
183 1.3 reinoud
184 1.3 reinoud #endif /* _ARM_PARAM_H_ */
185