param.h revision 1.1 1 /* $NetBSD: param.h,v 1.1 1995/02/13 23:07:42 cgd Exp $ */
2
3 /*
4 * Copyright (c) 1988 University of Utah.
5 * Copyright (c) 1992, 1993
6 * The Regents of the University of California. All rights reserved.
7 *
8 * This code is derived from software contributed to Berkeley by
9 * the Systems Programming Group of the University of Utah Computer
10 * Science Department and Ralph Campbell.
11 *
12 * Redistribution and use in source and binary forms, with or without
13 * modification, are permitted provided that the following conditions
14 * are met:
15 * 1. Redistributions of source code must retain the above copyright
16 * notice, this list of conditions and the following disclaimer.
17 * 2. Redistributions in binary form must reproduce the above copyright
18 * notice, this list of conditions and the following disclaimer in the
19 * documentation and/or other materials provided with the distribution.
20 * 3. All advertising materials mentioning features or use of this software
21 * must display the following acknowledgement:
22 * This product includes software developed by the University of
23 * California, Berkeley and its contributors.
24 * 4. Neither the name of the University nor the names of its contributors
25 * may be used to endorse or promote products derived from this software
26 * without specific prior written permission.
27 *
28 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
29 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
30 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
31 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
32 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
33 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
34 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
35 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
36 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
37 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * SUCH DAMAGE.
39 *
40 * from: Utah $Hdr: machparam.h 1.11 89/08/14$
41 *
42 * @(#)param.h 8.1 (Berkeley) 6/10/93
43 */
44
45 /*
46 * Machine dependent constants for the Alpha.
47 */
48 #define MACHINE "alpha"
49 #define MACHINE_ARCH "alpha"
50 #define MID_MACHINE MID_ALPHA
51
52 #ifdef KERNEL /* XXX */
53 #include <machine/cpu.h> /* XXX */
54 #endif /* XXX */
55
56 /*
57 * Round p (pointer or byte index) up to a correctly-aligned value for all
58 * data types (int, long, ...). The result is u_long and must be cast to
59 * any desired pointer type.
60 */
61 #define ALIGNBYTES 7
62 #define ALIGN(p) (((u_long)(p) + ALIGNBYTES) &~ ALIGNBYTES)
63
64 #define NBPG 8192 /* bytes/page */
65 #define PGOFSET (NBPG-1) /* byte off. into pg */
66 #define PGSHIFT 13 /* LOG2(NBPG) */
67 #define NPTEPG (1 << (PGSHIFT-PTESHIFT)) /* pte's/page */
68
69 #define SEGSHIFT (PGSHIFT + (PGSHIFT-PTESHIFT)) /* LOG2(NBSEG) */
70 #define NBSEG (1 << SEGSHIFT) /* bytes/segment (8M) */
71 #define SEGOFSET (NBSEG-1) /* byte off. into seg */
72
73 #define KERNBASE 0xfffffe0000000000 /* start of kernel virtual */
74 #define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT)
75
76 #define DEV_BSIZE 512
77 #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */
78 #define BLKDEV_IOSIZE 2048
79 #define MAXPHYS (64 * 1024) /* max raw I/O transfer size */
80
81 #define CLSIZE 1
82 #define CLSIZELOG2 0
83
84 /* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */
85 #define SSIZE 1 /* initial stack size/NBPG */
86 #define SINCR 1 /* increment of stack/NBPG */
87
88 #define UPAGES 2 /* pages of u-area */
89 #define USPACE (UPAGES * NBPG) /* total size of u-area */
90 #define SYSMAP_UPTES 0 /* sysmap index for u. ptes */
91 #define UADDR \
92 (VM_MIN_KERNEL_ADDRESS + SYSMAP_UPTES*NBPG) /* address of u */
93 #define KSTACK (UADDR) /* low addr of kernel stack */
94 #define KSTACKTOP (UADDR+UPAGES*NBPG) /* high addr of kernel stack */
95
96 /*
97 * Constants related to network buffer management.
98 * MCLBYTES must be no larger than CLBYTES (the software page size), and,
99 * on machines that exchange pages of input or output buffers with mbuf
100 * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple
101 * of the hardware page size.
102 */
103 #define MSIZE 256 /* size of an mbuf */
104 #define MCLBYTES 2048 /* large enough for ether MTU */
105 #define MCLSHIFT 11
106 #define MCLOFSET (MCLBYTES - 1)
107 #ifndef NMBCLUSTERS
108 #ifdef GATEWAY
109 #define NMBCLUSTERS 512 /* map size, max cluster allocation */
110 #else
111 #define NMBCLUSTERS 256 /* map size, max cluster allocation */
112 #endif
113 #endif
114
115 /*
116 * Size of kernel malloc arena in CLBYTES-sized logical pages
117 */
118 #ifndef NKMEMCLUSTERS
119 #define NKMEMCLUSTERS (1024*1024/CLBYTES) /* XXX? */
120 #endif
121
122 /* pages ("clicks") (8192 bytes) to disk blocks */
123 #define ctod(x) ((x)<<(PGSHIFT-DEV_BSHIFT))
124 #define dtoc(x) ((x)>>(PGSHIFT-DEV_BSHIFT))
125 #define dtob(x) ((x)<<DEV_BSHIFT)
126
127 /* pages to bytes */
128 #define ctob(x) ((x)<<PGSHIFT)
129
130 /* bytes to pages */
131 #define btoc(x) (((unsigned long)(x)+(NBPG-1))>>PGSHIFT)
132
133 #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \
134 ((unsigned long)(bytes) >> DEV_BSHIFT)
135 #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \
136 ((unsigned long)(db) << DEV_BSHIFT)
137
138 /*
139 * Map a ``block device block'' to a file system block.
140 * This should be device dependent, and should use the bsize
141 * field from the disk label.
142 * For now though just use DEV_BSIZE.
143 */
144 #define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE/DEV_BSIZE))
145
146 /*
147 * Mach derived conversion macros
148 */
149 #define alpha_round_page(x) ((((unsigned long)(x)) + NBPG - 1) & ~(NBPG-1))
150 #define alpha_trunc_page(x) ((unsigned long)(x) & ~(NBPG-1))
151 #define alpha_btop(x) ((unsigned long)(x) >> PGSHIFT)
152 #define alpha_ptob(x) ((unsigned long)(x) << PGSHIFT)
153
154 #include <machine/psl.h>
155
156 #define splx(s) (s == PSL_IPL_0 ? spl0() : pal_swpipl(s))
157 #define splsoft() pal_swpipl(PSL_IPL_SOFT)
158 #define splsoftclock() splsoft()
159 #define splnet() pal_swpipl(PSL_IPL_IO)
160 #define splbio() pal_swpipl(PSL_IPL_IO)
161 #define splimp() pal_swpipl(PSL_IPL_IO)
162 #define spltty() pal_swpipl(PSL_IPL_IO)
163 #define splclock() pal_swpipl(PSL_IPL_CLOCK)
164 #define splstatclock() pal_swpipl(PSL_IPL_CLOCK)
165 #define splhigh() pal_swpipl(PSL_IPL_HIGH)
166
167 #ifdef KERNEL
168 #ifndef LOCORE
169
170 /* This was calibrated empirically */
171 extern u_int64_t cycles_per_usec;
172 #define DELAY(n) { \
173 register long long N = cycles_per_usec * (n); \
174 do N -= 3; while (N > 0); \
175 }
176
177 int spl0 __P((void)); /* drop ipl to zero */
178
179 #endif
180 #else /* !KERNEL */
181 #define DELAY(n) { register int N = (n); while (--N > 0); }
182 #endif /* !KERNEL */
183
184 int prtloc;
185 extern int ticks;
186 #define LOC() do { if (prtloc) printf("(%ld:%ld) %s: %d\n", curproc ? curproc->p_pid : -1, (long)ticks, __FILE__, __LINE__); } while (0)
187 #define PLOC(str) panic("XXX: (%ld:%ld) %s at %s: %d\n", curproc ? curproc->p_pid : -1, (long)ticks, str, __FILE__, __LINE__);
188