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