param.h revision 1.7
1/* 2 * Copyright (c) 1988 University of Utah. 3 * Copyright (c) 1982, 1986, 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 * from: Utah $Hdr: machparam.h 1.11 89/08/14$ 39 * 40 * @(#)param.h 7.8 (Berkeley) 6/28/91 41 * $Id: param.h,v 1.7 1994/02/23 03:18:34 hpeyerl Exp $ 42 */ 43 44/* 45 * Machine dependent constants for amiga 46 */ 47#define MACHINE "amiga" 48#define MACHINE_ARCH "m68k" 49#define MID_MACHINE MID_M68K 50 51/* 52 * Round p (pointer or byte index) up to a correctly-aligned value 53 * for all data types (int, long, ...). The result is u_int and 54 * must be cast to any desired pointer type. 55 */ 56#define ALIGNBYTES (sizeof(int) - 1) 57#define ALIGN(p) (((u_int)(p) + (sizeof(int) - 1)) &~ (sizeof(int) - 1)) 58 59#define NBPG 8192 /* bytes/page */ 60#define PGOFSET (NBPG-1) /* byte offset into page */ 61#define PGSHIFT 13 /* LOG2(NBPG) */ 62#define NPTEPG (NBPG/(sizeof (struct pte))) 63 64#define NBSEG (cpu040 ? 32*NBPG : 2048*NBPG) /* bytes/segment */ 65#define SEGOFSET (NBSEG-1) /* byte offset into segment */ 66#define SEGSHIFT (cpu040 ? 18 : 24) /* LOG2(NBSEG) */ 67 68#define KERNBASE 0x0 /* start of kernel virtual */ 69#define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT) 70 71#define DEV_BSIZE 512 72#define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */ 73#define BLKDEV_IOSIZE 2048 74#define MAXPHYS (64 * 1024) /* max raw I/O transfer size */ 75 76#define CLSIZE 1 77#define CLSIZELOG2 0 78 79/* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */ 80#define SSIZE 1 /* initial stack size/NBPG */ 81#define SINCR 1 /* increment of stack/NBPG */ 82 83#define UPAGES 2 /* pages of u-area */ 84 85/* 86 * Constants related to network buffer management. 87 * MCLBYTES must be no larger than CLBYTES (the software page size), and, 88 * on machines that exchange pages of input or output buffers with mbuf 89 * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple 90 * of the hardware page size. 91 */ 92#define MSIZE 128 /* size of an mbuf */ 93#define MCLBYTES 1024 94#define MCLSHIFT 10 95#define MCLOFSET (MCLBYTES - 1) 96#ifndef NMBCLUSTERS 97#ifdef GATEWAY 98#define NMBCLUSTERS 512 /* map size, max cluster allocation */ 99#else 100#define NMBCLUSTERS 256 /* map size, max cluster allocation */ 101#endif 102#endif 103 104/* 105 * Size of kernel malloc arena in CLBYTES-sized logical pages 106 */ 107#ifndef NKMEMCLUSTERS 108#define NKMEMCLUSTERS (3072*1024/CLBYTES) 109#endif 110 111#define MAXPARTITIONS 16 112 113/* pages ("clicks") to disk blocks */ 114#define ctod(x) ((x)<<(PGSHIFT-DEV_BSHIFT)) 115#define dtoc(x) ((x)>>(PGSHIFT-DEV_BSHIFT)) 116#define dtob(x) ((x)<<DEV_BSHIFT) 117 118/* pages to bytes */ 119#define ctob(x) ((x)<<PGSHIFT) 120 121/* bytes to pages */ 122#define btoc(x) (((unsigned)(x)+(NBPG-1))>>PGSHIFT) 123 124#define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \ 125 ((unsigned)(bytes) >> DEV_BSHIFT) 126#define dbtob(db) /* calculates (db * DEV_BSIZE) */ \ 127 ((unsigned)(db) << DEV_BSHIFT) 128 129/* 130 * Map a ``block device block'' to a file system block. 131 * This should be device dependent, and should use the bsize 132 * field from the disk label. 133 * For now though just use DEV_BSIZE. 134 */ 135#define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE/DEV_BSIZE)) 136 137/* 138 * Mach derived conversion macros 139 */ 140#define amiga_round_seg(x) ((((unsigned)(x)) + NBSEG - 1) & ~(NBSEG-1)) 141#define amiga_trunc_seg(x) ((unsigned)(x) & ~(NBSEG-1)) 142#define amiga_round_page(x) ((((unsigned)(x)) + NBPG - 1) & ~(NBPG-1)) 143#define amiga_trunc_page(x) ((unsigned)(x) & ~(NBPG-1)) 144#define amiga_btos(x) ((unsigned)(x) >> SEGSHIFT) 145#define amiga_stob(x) ((unsigned)(x) << SEGSHIFT) 146#define amiga_btop(x) ((unsigned)(x) >> PGSHIFT) 147#define amiga_ptob(x) ((unsigned)(x) << PGSHIFT) 148 149/* 150 * spl functions; all but spl0 are done in-line 151 */ 152#include <machine/psl.h> 153 154#define _spl(s) \ 155({ \ 156 register int _spl_r; \ 157\ 158 asm __volatile ("clrl %0; movew sr,%0; movew %1,sr" : \ 159 "&=d" (_spl_r) : "di" (s)); \ 160 _spl_r; \ 161}) 162 163/* spl0 requires checking for software interrupts */ 164#define spl1() _spl(PSL_S|PSL_IPL1) 165#define spl2() _spl(PSL_S|PSL_IPL2) 166#define spl3() _spl(PSL_S|PSL_IPL3) 167#define spl4() _spl(PSL_S|PSL_IPL4) 168#define spl5() _spl(PSL_S|PSL_IPL5) 169#define spl6() _spl(PSL_S|PSL_IPL6) 170#define spl7() _spl(PSL_S|PSL_IPL7) 171 172#define splnone() spl0() 173#define splsoftclock() spl1() 174#define splnet() spl1() 175#define splbio() spl3() 176#define splimp() spl3() 177/* lowered to spl4 to allow for serial input into 178 private ringbuffer inspite of spltty */ 179#define spltty() spl4() 180#define splclock() spl6() 181#define splvm() spl6() 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#ifdef KERNEL 189int cpuspeed; 190extern int DELAY __P((int count)); 191#else 192#define DELAY(n) { register int N = (n); while (--N > 0); } 193#endif 194 195