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