param3.h revision 1.2 1 /*
2 * Copyright (c) 1988 University of Utah.
3 * Copyright (c) 1982, 1986, 1990 The Regents of the University of California.
4 * All rights reserved.
5 *
6 * This code is derived from software contributed to Berkeley by
7 * the Systems Programming Group of the University of Utah Computer
8 * Science Department.
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: Utah $Hdr: machparam.h 1.11 89/08/14$
39 *
40 * from: @(#)param.h 7.8 (Berkeley) 6/28/91
41 * param.h,v 1.2 1993/05/22 07:58:25 cgd Exp
42 */
43
44 /*
45 * Machine dependent constants for HP9000 series 300.
46 */
47 #define MACHINE "sun3"
48 #define MID_MACHINE MID_SUN020
49 /*
50 * Round p (pointer or byte index) up to a correctly-aligned value
51 * for all data types (int, long, ...). The result is u_int and
52 * must be cast to any desired pointer type.
53 */
54 #define ALIGN(p) (((u_int)(p) + (sizeof(int) - 1)) &~ (sizeof(int) - 1))
55
56 #define NBPG 8192 /* bytes/page */
57 #define PGOFSET (NBPG-1) /* byte offset into page */
58 #define PGSHIFT 13 /* LOG2(NBPG) */
59
60 #define KERNBASE 0x0E000000
61
62 #define DEV_BSIZE 512
63 #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */
64 #define BLKDEV_IOSIZE 2048
65 #define MAXPHYS (64 * 1024) /* max raw I/O transfer size */
66
67 #define CLSIZE 1
68 #define CLSIZELOG2 0
69
70 /* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */
71 #define SSIZE 1 /* initial stack size/NBPG */
72 #define SINCR 1 /* increment of stack/NBPG */
73
74 #define UPAGES 3 /* pages of u-area */
75
76 /*
77 * Constants related to network buffer management.
78 * MCLBYTES must be no larger than CLBYTES (the software page size), and,
79 * on machines that exchange pages of input or output buffers with mbuf
80 * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple
81 * of the hardware page size.
82 */
83 #define MSIZE 128 /* size of an mbuf */
84 #define MCLBYTES 1024
85 #define MCLSHIFT 10
86 #define MCLOFSET (MCLBYTES - 1)
87 #ifndef NMBCLUSTERS
88 #ifdef GATEWAY
89 #define NMBCLUSTERS 512 /* map size, max cluster allocation */
90 #else
91 #define NMBCLUSTERS 256 /* map size, max cluster allocation */
92 #endif
93 #endif
94
95 /*
96 * Size of kernel malloc arena in CLBYTES-sized logical pages
97 */
98 #ifndef NKMEMCLUSTERS
99 #define NKMEMCLUSTERS (2048*1024/CLBYTES)
100 #endif
101
102 /* pages ("clicks") (4096 bytes) to disk blocks */
103 #define ctod(x) ((x)<<(PGSHIFT-DEV_BSHIFT))
104 #define dtoc(x) ((x)>>(PGSHIFT-DEV_BSHIFT))
105 #define dtob(x) ((x)<<DEV_BSHIFT)
106
107 /* pages to bytes */
108 #define ctob(x) ((x)<<PGSHIFT)
109
110 /* bytes to pages */
111 #define btoc(x) (((unsigned)(x)+(NBPG-1))>>PGSHIFT)
112
113 #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \
114 ((unsigned)(bytes) >> DEV_BSHIFT)
115 #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \
116 ((unsigned)(db) << DEV_BSHIFT)
117
118 /*
119 * Map a ``block device block'' to a file system block.
120 * This should be device dependent, and should use the bsize
121 * field from the disk label.
122 * For now though just use DEV_BSIZE.
123 */
124 #define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE/DEV_BSIZE))
125
126 #include <machine/psl.h>
127
128 /*
129 * spl functions; all but spl0 are done in-line
130 */
131
132 #ifdef __GNUC__
133 #define _spl(s) \
134 ({ \
135 register int _spl_r; \
136 \
137 asm __volatile ("clrl %0; movew sr,%0; movew %1,sr" : \
138 "&=d" (_spl_r) : "di" (s)); \
139 _spl_r; \
140 })
141 #endif
142 /* spl0 requires checking for software interrupts */
143 #define spl1() _spl(PSL_S|PSL_IPL1)
144 #define spl2() _spl(PSL_S|PSL_IPL2)
145 #define spl3() _spl(PSL_S|PSL_IPL3)
146 #define spl4() _spl(PSL_S|PSL_IPL4)
147 #define spl5() _spl(PSL_S|PSL_IPL5)
148 #define spl6() _spl(PSL_S|PSL_IPL6)
149 #define spl7() _spl(PSL_S|PSL_IPL7)
150
151 #define splsoftclock() spl1()
152 #define splnet() spl1()
153 #define splbio() spl5()
154 #define splimp() spl5()
155 #define spltty() spl5()
156 #define splclock() spl6()
157 #define splvm() spl6()
158 #define splhigh() spl7()
159 #define splsched() spl7()
160
161 /* watch out for side effects */
162 #define splx(s) (s & PSL_IPL ? _spl(s) : spl0())
163
164 #ifdef KERNEL
165 #ifndef LOCORE
166 int cpuspeed;
167 #define DELAY(n) { register int N = cpuspeed * (n); while (--N > 0); }
168 #endif
169
170 #else
171 #define DELAY(n) { register int N = (n); while (--N > 0); }
172 #endif
173