param.h revision 1.7
1/* $NetBSD: param.h,v 1.7 1997/02/24 23:20:26 fvdl Exp $ */ 2 3/* 4 * Copyright (c) 1988 University of Utah. 5 * Copyright (c) 1982, 1986, 1990, 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. 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.16 92/12/20$ 41 * 42 * @(#)param.h 8.1 (Berkeley) 6/10/93 43 */ 44 45/* 46 * Machine dependent constants for mvme68k, based on HP9000 series 300. 47 */ 48#define _MACHINE mvme68k 49#define MACHINE "mvme68k" 50#define _MACHINE_ARCH m68k 51#define MACHINE_ARCH "m68k" 52#define MID_MACHINE MID_M68K 53 54/* 55 * Round p (pointer or byte index) up to a correctly-aligned value for all 56 * data types (int, long, ...). The result is u_int and must be cast to 57 * any desired pointer type. 58 * 59 * ALIGNED_POINTER is a boolean macro that checks whether an address 60 * is valid to fetch data elements of type t from on this architecture. 61 * This does not reflect the optimal alignment, just the possibility 62 * (within reasonable limits). 63 * 64 */ 65#define ALIGNBYTES (sizeof(int) - 1) 66#define ALIGN(p) (((u_int)(p) + ALIGNBYTES) &~ ALIGNBYTES) 67#define ALIGNED_POINTER(p,t) ((((u_long)(p)) & (sizeof(t)-1)) == 0) 68 69#define PGSHIFT 12 /* LOG2(NBPG) */ 70#define NBPG (1 << PGSHIFT) /* bytes/page */ 71#define PGOFSET (NBPG-1) /* byte offset into page */ 72#define NPTEPG (NBPG/(sizeof (pt_entry_t))) 73 74#define SEGSHIFT 22 /* LOG2(NBSEG) */ 75#define NBSEG (1 << SEGSHIFT) /* bytes/segment */ 76#define SEGOFSET (NBSEG-1) /* byte offset into segment */ 77 78#define KERNBASE 0x00000000 /* start of kernel virtual */ 79#define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT) 80 81#define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */ 82#define DEV_BSIZE (1 << DEV_BSHIFT) 83#define BLKDEV_IOSIZE 2048 84#define MAXPHYS (64 * 1024) /* max raw I/O transfer size */ 85 86#define CLSIZELOG2 0 87#define CLSIZE (1 << CLSIZELOG2) 88 89/* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */ 90#define SSIZE 1 /* initial stack size/NBPG */ 91#define SINCR 1 /* increment of stack/NBPG */ 92#define UPAGES 3 /* pages of u-area */ 93#define USPACE (UPAGES * NBPG) /* total size of u-area */ 94 95/* 96 * Constants related to network buffer management. 97 * MCLBYTES must be no larger than CLBYTES (the software page size), and, 98 * on machines that exchange pages of input or output buffers with mbuf 99 * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple 100 * of the hardware page size. 101 */ 102#define MSIZE 128 /* size of an mbuf */ 103#define MCLSHIFT 11 104#define MCLBYTES (1 << MCLSHIFT) /* large enough for ether MTU */ 105#define MCLOFSET (MCLBYTES - 1) 106 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 (2048 * 1024 / CLBYTES) 120#endif 121 122/* pages ("clicks") to disk blocks */ 123#define ctod(x) ((x) << (PGSHIFT - DEV_BSHIFT)) 124#define dtoc(x) ((x) >> (PGSHIFT - DEV_BSHIFT)) 125 126/* pages to bytes */ 127#define ctob(x) ((x) << PGSHIFT) 128#define btoc(x) (((x) + PGOFSET) >> PGSHIFT) 129 130/* bytes to disk blocks */ 131#define dbtob(x) ((x) << DEV_BSHIFT) 132#define btodb(x) ((x) >> DEV_BSHIFT) 133 134/* 135 * Map a ``block device block'' to a file system block. 136 * This should be device dependent, and should use the bsize 137 * field from the disk label. 138 * For now though just use DEV_BSIZE. 139 */ 140#define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE / DEV_BSIZE)) 141 142/* 143 * Mach derived conversion macros 144 */ 145#define m68k_round_page(x) ((((unsigned)(x)) + PGOFSET) & ~PGOFSET) 146#define m68k_trunc_page(x) ((unsigned)(x) & ~PGOFSET) 147#define m68k_btop(x) ((unsigned)(x) >> PGSHIFT) 148#define m68k_ptob(x) ((unsigned)(x) << PGSHIFT) 149 150/* 151 * spl functions; all but spl0 are done in-line 152 */ 153#include <machine/psl.h> 154 155#define _spl(s) \ 156({ \ 157 register int _spl_r; \ 158\ 159 __asm __volatile ("clrl %0; movew sr,%0; movew %1,sr" : \ 160 "&=d" (_spl_r) : "di" (s)); \ 161 _spl_r; \ 162}) 163 164/* spl0 requires checking for software interrupts */ 165#define spl1() _spl(PSL_S|PSL_IPL1) 166#define spl2() _spl(PSL_S|PSL_IPL2) 167#define spl3() _spl(PSL_S|PSL_IPL3) 168#define spl4() _spl(PSL_S|PSL_IPL4) 169#define spl5() _spl(PSL_S|PSL_IPL5) 170#define spl6() _spl(PSL_S|PSL_IPL6) 171#define spl7() _spl(PSL_S|PSL_IPL7) 172 173#define splsoftclock() spl1() 174#define splsoftnet() spl1() 175#define splbio() spl2() 176#define splnet() spl3() 177#define spltty() spl3() 178#define splimp() spl3() 179#define splclock() spl5() 180#define splstatclock() spl5() 181#define splvm() spl5() 182#define splhigh() spl7() 183#define splsched() spl7() 184 185/* watch out for side effects */ 186#define splx(s) (s & PSL_IPL ? _spl(s) : spl0()) 187 188#if defined(_KERNEL) && !defined(_LOCORE) 189extern void _delay __P((unsigned)); 190#define delay(us) _delay((us)<<8) 191#define DELAY(n) delay(n) 192#endif /* _KERNEL && !_LOCORE */ 193