1 /* 2 * Copyright (c) 1988 University of Utah. 3 * Copyright (c) 1982, 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 /*- 39 * Copyright (C) 1993 Allen K. Briggs, Chris P. Caputo, 40 * Michael L. Finch, Bradley A. Grantham, and 41 * Lawrence A. Kesteloot 42 * All rights reserved. 43 * 44 * Redistribution and use in source and binary forms, with or without 45 * modification, are permitted provided that the following conditions 46 * are met: 47 * 1. Redistributions of source code must retain the above copyright 48 * notice, this list of conditions and the following disclaimer. 49 * 2. Redistributions in binary form must reproduce the above copyright 50 * notice, this list of conditions and the following disclaimer in the 51 * documentation and/or other materials provided with the distribution. 52 * 3. All advertising materials mentioning features or use of this software 53 * must display the following acknowledgement: 54 * This product includes software developed by the Alice Group. 55 * 4. The names of the Alice Group or any of its members may not be used 56 * to endorse or promote products derived from this software without 57 * specific prior written permission. 58 * 59 * THIS SOFTWARE IS PROVIDED BY THE ALICE GROUP ``AS IS'' AND ANY EXPRESS OR 60 * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES 61 * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. 62 * IN NO EVENT SHALL THE ALICE GROUP BE LIABLE FOR ANY DIRECT, INDIRECT, 63 * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT 64 * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, 65 * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY 66 * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT 67 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE 68 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. 69 * 70 */ 71 #ident "$Id: param.h,v 1.1.1.1 1993/09/29 06:09:22 briggs Exp $" 72 73 /* 74 * from: Utah $Hdr: machparam.h 1.11 89/08/14$ 75 * 76 * @(#)param.h 7.8 (Berkeley) 6/28/91 77 */ 78 79 #ifndef PSL_IPL 80 #include "machine/psl.h" 81 #endif /* PSL_IPL */ 82 83 #include "machine/exec.h" 84 85 /* 86 * Machine dependent constants for Macintosh II series. 87 ALICE 88 BG 05/24/92,17:46:53 89 Well, I've tried to make this as macII-specific as possible. 90 It's difficult without knowing exactly what these things do. 91 06/03/92,14:12:35 BG 92 I've done a little more messing around; I think we're basically 93 done for now except for tweeking. 94 */ 95 #define MACHINE "mac" 96 97 /* 98 * Round p (pointer or byte index) up to a correctly-aligned value 99 * for all data types (int, long, ...). The result is u_int and 100 * must be cast to any desired pointer type. 101 */ 102 #define ALIGNBYTES (sizeof(int) - 1) 103 #define ALIGN(p) (((u_int)(p) + ALIGNBYTES) &~ ALIGNBYTES) 104 105 #define NBPG 4096 /* bytes/page */ 106 #define PGOFSET (NBPG-1) /* byte offset into page */ 107 #define PGSHIFT 12 /* LOG2(NBPG) */ 108 #define NPTEPG (NBPG/(sizeof (struct pte))) 109 110 #define NBSEG (1024*NBPG) /* bytes/segment */ 111 #define SEGOFSET (NBSEG-1) /* byte offset into segment */ 112 #define SEGSHIFT 22 /* LOG2(NBSEG) */ 113 114 /* ALICE 05/24/92,19:31:42 BG -- Well, I wish we didn't have to worry */ 115 /* about re-locating the kernel, but I think we will probably have to. */ 116 #define KERNBASE 0x00000000 /* start of kernel virtual */ 117 #define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT) 118 119 #define DEV_BSIZE 512 120 #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */ 121 #define BLKDEV_IOSIZE 2048 122 #define MAXPHYS (64 * 1024) /* max raw I/O transfer size */ 123 124 #define CLSIZE 1 125 #define CLSIZELOG2 0 126 127 /* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */ 128 #define SSIZE 1 /* initial stack size/NBPG */ 129 #define SINCR 1 /* increment of stack/NBPG */ 130 131 #define UPAGES 3 /* pages of u-area */ 132 133 /* 134 * Constants related to network buffer management. 135 * MCLBYTES must be no larger than CLBYTES (the software page size), and, 136 * on machines that exchange pages of input or output buffers with mbuf 137 * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple 138 * of the hardware page size. 139 */ 140 #define MSIZE 128 /* size of an mbuf */ 141 #define MCLBYTES 1024 142 #define MCLSHIFT 10 143 #define MCLOFSET (MCLBYTES - 1) 144 #ifndef NMBCLUSTERS 145 #ifdef GATEWAY 146 #define NMBCLUSTERS 512 /* map size, max cluster allocation */ 147 #else 148 #define NMBCLUSTERS 256 /* map size, max cluster allocation */ 149 #endif 150 #endif 151 152 /* 153 * Size of kernel malloc arena in CLBYTES-sized logical pages 154 */ 155 #ifndef NKMEMCLUSTERS 156 #define NKMEMCLUSTERS (2048*1024/CLBYTES) 157 #endif 158 159 /* pages ("clicks") (4096 bytes) to disk blocks */ 160 #define ctod(x) ((x)<<(PGSHIFT-DEV_BSHIFT)) 161 #define dtoc(x) ((x)>>(PGSHIFT-DEV_BSHIFT)) 162 #define dtob(x) ((x)<<DEV_BSHIFT) 163 164 /* pages to bytes */ 165 #define ctob(x) ((x)<<PGSHIFT) 166 167 /* bytes to pages */ 168 #define btoc(x) (((unsigned)(x)+(NBPG-1))>>PGSHIFT) 169 170 #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \ 171 ((unsigned)(bytes) >> DEV_BSHIFT) 172 #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \ 173 ((unsigned)(db) << DEV_BSHIFT) 174 175 /* 176 * Map a ``block device block'' to a file system block. 177 * This should be device dependent, and should use the bsize 178 * field from the disk label. 179 * For now though just use DEV_BSIZE. 180 */ 181 #define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE/DEV_BSIZE)) 182 183 /* 184 * Mach derived conversion macros 185 */ 186 #define macII_round_seg(x) ((((unsigned)(x)) + NBSEG - 1) & ~(NBSEG-1)) 187 #define macII_trunc_seg(x) ((unsigned)(x) & ~(NBSEG-1)) 188 #define macII_round_page(x) ((((unsigned)(x)) + NBPG - 1) & ~(NBPG-1)) 189 #define macII_trunc_page(x) ((unsigned)(x) & ~(NBPG-1)) 190 #define macII_btos(x) ((unsigned)(x) >> SEGSHIFT) 191 #define macII_stob(x) ((unsigned)(x) << SEGSHIFT) 192 #define macII_btop(x) ((unsigned)(x) >> PGSHIFT) 193 #define macII_ptob(x) ((unsigned)(x) << PGSHIFT) 194 195 /* 196 * spl functions; all but spl0 are done in-line 197 */ 198 199 #define _spl(s) \ 200 ({ \ 201 register int _spl_r; \ 202 \ 203 asm __volatile ("clrl %0; movew sr,%0; movew %1,sr" : \ 204 "&=d" (_spl_r) : "di" (s)); \ 205 _spl_r; \ 206 }) 207 208 /* spl0 requires checking for software interrupts */ 209 #if defined(BARF_BARF_BARF) 210 #define spl1() _spl(PSL_S|PSL_IPL1) 211 #define spl2() _spl(PSL_S|PSL_IPL2) 212 #define spl3() _spl(PSL_S|PSL_IPL3) 213 #define spl4() _spl(PSL_S|PSL_IPL4) 214 #define spl5() _spl(PSL_S|PSL_IPL5) 215 #define spl6() _spl(PSL_S|PSL_IPL6) 216 #define spl7() _spl(PSL_S|PSL_IPL7) 217 #else /* not BARF_BARF_BARF */ 218 #define spl1() _spl(PSL_S|PSL_IPL3) 219 #define spl2() _spl(PSL_S|PSL_IPL3) 220 #define spl3() _spl(PSL_S|PSL_IPL3) 221 #define spl4() _spl(PSL_S|PSL_IPL3) 222 #define spl5() _spl(PSL_S|PSL_IPL3) 223 #define spl6() _spl(PSL_S|PSL_IPL3) 224 #define spl7() _spl(PSL_S|PSL_IPL7) /* spl7() always excludes everything */ 225 #endif /* BARF_BARF_BARF */ 226 227 /* ALICE 06/03/92,14:08:28 BG I guess we could put in some spl's for various */ 228 /* devices like VIA1 interrupt, and so on. */ 229 /* BARF -- These should be used for: 230 1) ensuring mutual exclusion (why use processor level?) 231 2) allowing faster devices to take priority 232 */ 233 #define splsoftclock() spl1() /* disallow softclock */ 234 #define splnet() spl1() /* disallow network */ 235 #define splbio() spl5() /* disallow block I/O */ 236 #define splimp() spl5() /* disallow imput */ 237 #define spltty() spl5() /* disallow tty interrupts */ 238 #define splclock() spl6() /* disallow clock interrupt */ 239 #define splvm() spl6() /* disallow virtual memory operations */ 240 #define splhigh() spl7() /* disallow everything */ 241 #define splsched() spl7() /* disallow scheduling */ 242 243 /* watch out for side effects */ 244 #define splx(s) ((s) & PSL_IPL ? _spl(s) : spl0()) 245 246 #ifdef KERNEL 247 #ifndef LOCORE 248 int cpuspeed; 249 #define DELAY(n) { register int N = cpuspeed * (n); while (--N > 0); } 250 #endif 251 252 #else 253 #define DELAY(n) { register int N = (n); while (--N > 0); } 254 255 #endif 256