/* * Copyright (c) 1988 University of Utah. * Copyright (c) 1982, 1990 The Regents of the University of California. * All rights reserved. * * This code is derived from software contributed to Berkeley by * the Systems Programming Group of the University of Utah Computer * Science Department. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the University of * California, Berkeley and its contributors. * 4. Neither the name of the University nor the names of its contributors * may be used to endorse or promote products derived from this software * without specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF * SUCH DAMAGE. */ /*- * Copyright (C) 1993 Allen K. Briggs, Chris P. Caputo, * Michael L. Finch, Bradley A. Grantham, and * Lawrence A. Kesteloot * All rights reserved. * * Redistribution and use in source and binary forms, with or without * modification, are permitted provided that the following conditions * are met: * 1. Redistributions of source code must retain the above copyright * notice, this list of conditions and the following disclaimer. * 2. Redistributions in binary form must reproduce the above copyright * notice, this list of conditions and the following disclaimer in the * documentation and/or other materials provided with the distribution. * 3. All advertising materials mentioning features or use of this software * must display the following acknowledgement: * This product includes software developed by the Alice Group. * 4. The names of the Alice Group or any of its members may not be used * to endorse or promote products derived from this software without * specific prior written permission. * * THIS SOFTWARE IS PROVIDED BY THE ALICE GROUP ``AS IS'' AND ANY EXPRESS OR * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. * IN NO EVENT SHALL THE ALICE GROUP BE LIABLE FOR ANY DIRECT, INDIRECT, * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. * */ /* * from: Utah $Hdr: machparam.h 1.11 89/08/14$ * * from: @(#)param.h 7.8 (Berkeley) 6/28/91 * $Id: param.h,v 1.10 1994/05/06 17:39:22 briggs Exp $ */ #ifndef _MACHINE_PARAM_H_ #define _MACHINE_PARAM_H_ 1 #ifndef PSL_IPL #include "machine/psl.h" #endif /* PSL_IPL */ /* * Machine dependent constants for Macintosh II-and-similar series. */ #define MACHINE "mac68k" #define MACHINE_ARCH "m68k" #define MID_MACHINE MID_M68K /* * Round p (pointer or byte index) up to a correctly-aligned value * for all data types (int, long, ...). The result is u_int and * must be cast to any desired pointer type. */ #define ALIGNBYTES (sizeof(int) - 1) #define ALIGN(p) (((u_int)(p) + ALIGNBYTES) &~ ALIGNBYTES) #define NBPG 4096 /* bytes/page */ #define PGOFSET (NBPG-1) /* byte offset into page */ #define PGSHIFT 12 /* LOG2(NBPG) */ #define NPTEPG (NBPG/(sizeof (struct pte))) #define NBSEG (cpu040 ? 64*NBPG : 1024*NBPG) /* bytes/segment */ #define SEGOFSET (NBSEG-1) /* byte offset into segment */ #define SEGSHIFT (cpu040 ? 18 : 22) /* LOG2(NBSEG) */ /* ALICE 05/24/92,19:31:42 BG -- Well, I wish we didn't have to worry */ /* about re-locating the kernel, but I think we will probably have to. */ #define KERNBASE 0x00000000 /* start of kernel virtual */ #define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT) #define DEV_BSIZE 512 #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */ #define BLKDEV_IOSIZE 2048 #define MAXPHYS (64 * 1024) /* max raw I/O transfer size */ #define CLSIZE 1 #define CLSIZELOG2 0 /* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */ #define SSIZE 1 /* initial stack size/NBPG */ #define SINCR 1 /* increment of stack/NBPG */ #define UPAGES 3 /* pages of u-area */ /* * Constants related to network buffer management. * MCLBYTES must be no larger than CLBYTES (the software page size), and, * on machines that exchange pages of input or output buffers with mbuf * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple * of the hardware page size. */ #define MSIZE 128 /* size of an mbuf */ #define MCLBYTES 1024 #define MCLSHIFT 10 #define MCLOFSET (MCLBYTES - 1) #ifndef NMBCLUSTERS #ifdef GATEWAY #define NMBCLUSTERS 512 /* map size, max cluster allocation */ #else #define NMBCLUSTERS 256 /* map size, max cluster allocation */ #endif #endif /* * Size of kernel malloc arena in CLBYTES-sized logical pages */ #ifndef NKMEMCLUSTERS #define NKMEMCLUSTERS (2048*1024/CLBYTES) #endif /* pages ("clicks") (4096 bytes) to disk blocks */ #define ctod(x) ((x)<<(PGSHIFT-DEV_BSHIFT)) #define dtoc(x) ((x)>>(PGSHIFT-DEV_BSHIFT)) #define dtob(x) ((x)<>PGSHIFT) #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \ ((unsigned)(bytes) >> DEV_BSHIFT) #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \ ((unsigned)(db) << DEV_BSHIFT) /* * Map a ``block device block'' to a file system block. * This should be device dependent, and should use the bsize * field from the disk label. * For now though just use DEV_BSIZE. */ #define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE/DEV_BSIZE)) /* * Mach derived conversion macros */ #define mac68k_round_seg(x) ((((unsigned)(x)) + NBSEG - 1) & ~(NBSEG-1)) #define mac68k_trunc_seg(x) ((unsigned)(x) & ~(NBSEG-1)) #define mac68k_round_page(x) ((((unsigned)(x)) + NBPG - 1) & ~(NBPG-1)) #define mac68k_trunc_page(x) ((unsigned)(x) & ~(NBPG-1)) #define mac68k_btos(x) ((unsigned)(x) >> SEGSHIFT) #define mac68k_stob(x) ((unsigned)(x) << SEGSHIFT) #define mac68k_btop(x) ((unsigned)(x) >> PGSHIFT) #define mac68k_ptob(x) ((unsigned)(x) << PGSHIFT) /* * spl functions; all but spl0 are done in-line */ #define _spl(s) \ ({ \ register int _spl_r; \ \ asm __volatile ("clrl %0; movew sr,%0; movew %1,sr" : \ "&=d" (_spl_r) : "di" (s)); \ _spl_r; \ }) /* spl0 requires checking for software interrupts */ #if defined(BARF_BARF_BARF) #define spl1() _spl(PSL_S|PSL_IPL1) #define spl2() _spl(PSL_S|PSL_IPL2) #define spl3() _spl(PSL_S|PSL_IPL3) #define spl4() _spl(PSL_S|PSL_IPL4) #define spl5() _spl(PSL_S|PSL_IPL5) #define spl6() _spl(PSL_S|PSL_IPL6) #define spl7() _spl(PSL_S|PSL_IPL7) #else /* not BARF_BARF_BARF */ #define spl1() _spl(PSL_S|PSL_IPL3) #define spl2() _spl(PSL_S|PSL_IPL3) #define spl3() _spl(PSL_S|PSL_IPL3) #define spl4() _spl(PSL_S|PSL_IPL3) #define spl5() _spl(PSL_S|PSL_IPL3) #define spl6() _spl(PSL_S|PSL_IPL3) #define spl7() _spl(PSL_S|PSL_IPL7) /* spl7() always excludes everything */ #endif /* BARF_BARF_BARF */ /* ALICE 06/03/92,14:08:28 BG I guess we could put in some spl's for various */ /* devices like VIA1 interrupt, and so on. */ /* BARF -- These should be used for: 1) ensuring mutual exclusion (why use processor level?) 2) allowing faster devices to take priority */ #define splsoftclock() spl1() /* disallow softclock */ #define splnet() spl1() /* disallow network */ #define splbio() spl5() /* disallow block I/O */ #define splimp() spl5() /* disallow imput */ #define spltty() spl5() /* disallow tty interrupts */ #define splclock() spl6() /* disallow clock interrupt */ #define splvm() spl6() /* disallow virtual memory operations */ #define splhigh() spl7() /* disallow everything */ #define splsched() spl7() /* disallow scheduling */ #define splstatclock() spl7() /* This should be splclock... */ /* watch out for side effects */ #define splx(s) ((s) & PSL_IPL ? _spl(s) : spl0()) #endif /* _MACHINE_PARAM_H_ */