param.h revision 1.18 
1/*	$NetBSD: param.h,v 1.18 1997/02/24 23:18:35 fvdl Exp $	*/
2
3/*
4 * Copyright (c) 1988 University of Utah.
5 * Copyright (c) 1982, 1986, 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 * from: Utah $Hdr: machparam.h 1.11 89/08/14$
41 *
42 *	@(#)param.h	7.8 (Berkeley) 6/28/91
43 */
44
45#ifndef _MACHINE_PARAM_H_
46#define _MACHINE_PARAM_H_
47
48/*
49 * Machine dependent constants for atari
50 */
51#define	_MACHINE	atari
52#define	MACHINE		"atari"
53#define	_MACHINE_ARCH	m68k
54#define	MACHINE_ARCH	"m68k"
55#define	MID_MACHINE	MID_M68K
56
57/*
58 * Round p (pointer or byte index) up to a correctly-aligned value
59 * for all data types (int, long, ...).   The result is u_int and
60 * must be cast to any desired pointer type.
61 *
62 * ALIGNED_POINTER is a boolean macro that checks whether an address
63 * is valid to fetch data elements of type t from on this architecture.
64 * This does not reflect the optimal alignment, just the possibility
65 * (within reasonable limits).
66 *
67 */
68#define ALIGNBYTES	(sizeof(int) - 1)
69#define	ALIGN(p)	(((u_int)(p) + (sizeof(int) - 1)) &~ (sizeof(int) - 1))
70#define ALIGNED_POINTER(p,t)	((((u_long)(p)) & (sizeof(t)-1)) == 0)
71
72#define	NBPG		8192		/* bytes/page */
73#define	PGOFSET		(NBPG-1)	/* byte offset into page */
74#define	PGSHIFT		13		/* LOG2(NBPG) */
75#define	NPTEPG		(NBPG/(sizeof(u_int)))
76
77			/* bytes/segment */
78#define NBSEG		((mmutype == MMU_68040) ? 32*NBPG : 2048*NBPG)
79			/* byte offset into segment */
80#define	SEGOFSET	(NBSEG-1)
81#define	SEGSHIFT	24		/* LOG2(NBSEG) [68030 value] */
82
83#define	KERNBASE	0x0		/* start of kernel virtual */
84#define	BTOPKERNBASE	((u_long)KERNBASE >> PGSHIFT)
85
86#define	DEV_BSIZE	512
87#define	DEV_BSHIFT	9		/* log2(DEV_BSIZE) */
88#define BLKDEV_IOSIZE	2048
89#define	MAXPHYS		(64 * 1024)	/* max raw I/O transfer size */
90
91#define	CLSIZE		1
92#define	CLSIZELOG2	0
93
94/* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */
95#define	SSIZE		1		/* initial stack size/NBPG */
96#define	SINCR		1		/* increment of stack/NBPG */
97
98#define	UPAGES		2		/* pages of u-area */
99#define USPACE		(UPAGES * NBPG)
100
101/*
102 * Constants related to network buffer management.
103 * MCLBYTES must be no larger than CLBYTES (the software page size), and,
104 * on machines that exchange pages of input or output buffers with mbuf
105 * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple
106 * of the hardware page size.
107 */
108#define	MSIZE		128		/* size of an mbuf */
109#define	MCLSHIFT	11
110#define	MCLBYTES	(1 << MCLSHIFT)
111#define	MCLOFSET	(MCLBYTES - 1)
112#ifndef NMBCLUSTERS
113#ifdef GATEWAY
114#define	NMBCLUSTERS	512		/* map size, max cluster allocation */
115#else
116#define	NMBCLUSTERS	256		/* map size, max cluster allocation */
117#endif
118#endif
119
120/*
121 * Size of kernel malloc arena in CLBYTES-sized logical pages
122 */
123#ifndef NKMEMCLUSTERS
124#define	NKMEMCLUSTERS	(3072*1024/CLBYTES)
125#endif
126
127/* pages ("clicks") to disk blocks */
128#define	ctod(x)		((x) << (PGSHIFT - DEV_BSHIFT))
129#define	dtoc(x)		((x) >> (PGSHIFT - DEV_BSHIFT))
130
131/* pages to bytes */
132#define	ctob(x)		((x) << PGSHIFT)
133#define	btoc(x)		(((x) + PGOFSET) >> PGSHIFT)
134
135/* bytes to disk blocks */
136#define	btodb(x)	((x) >> DEV_BSHIFT)
137#define	dbtob(x)	((x) << DEV_BSHIFT)
138
139/*
140 * Map a ``block device block'' to a file system block.
141 * This should be device dependent, and should use the bsize
142 * field from the disk label.
143 * For now though just use DEV_BSIZE.
144 */
145#define	bdbtofsb(bn)	((bn) / (BLKDEV_IOSIZE/DEV_BSIZE))
146
147/*
148 * Mach derived conversion macros
149 */
150#define atari_round_seg(x)	((((unsigned)(x)) + NBSEG - 1) & ~(NBSEG-1))
151#define atari_trunc_seg(x)	((unsigned)(x) & ~(NBSEG-1))
152#define atari_round_page(x)	((((unsigned)(x)) + NBPG - 1) & ~(NBPG-1))
153#define atari_trunc_page(x)	((unsigned)(x) & ~(NBPG-1))
154#define atari_btos(x)		((unsigned)(x) >> SEGSHIFT)
155#define atari_stob(x)		((unsigned)(x) << SEGSHIFT)
156#define atari_btop(x)		((unsigned)(x) >> PGSHIFT)
157#define atari_ptob(x)		((unsigned)(x) << PGSHIFT)
158
159/*
160 * spl functions; all but spl0 are done in-line
161 */
162#include <machine/psl.h>
163
164#define _debug_spl(s) \
165({ \
166        register int _spl_r; \
167\
168        __asm __volatile ("clrl %0; movew sr,%0; movew %1,sr" : \
169                "&=d" (_spl_r) : "di" (s)); \
170	if ((_spl_r&PSL_IPL) > (s&PSL_IPL)) \
171		printf ("%s:%d:spl(%d) ==> spl(%d)!!\n",__FILE__,__LINE__, \
172		    ((PSL_IPL&_spl_r)>>8), ((PSL_IPL&s)>>8)); \
173        _spl_r; \
174})
175
176#define _spl_no_check(s) \
177({ \
178        register int _spl_r; \
179\
180        __asm __volatile ("clrl %0; movew sr,%0; movew %1,sr" : \
181                "&=d" (_spl_r) : "di" (s)); \
182        _spl_r; \
183})
184#if defined (DEBUG)
185#define _spl _debug_spl
186#else
187#define _spl _spl_no_check
188#endif
189
190/* spl0 requires checking for software interrupts */
191#define spl1()	_spl(PSL_S|PSL_IPL1)
192#define spl2()	_spl(PSL_S|PSL_IPL2)
193#define spl3()	_spl(PSL_S|PSL_IPL3)
194#define spl4()	_spl(PSL_S|PSL_IPL4)
195#define spl5()	_spl(PSL_S|PSL_IPL5)
196#define spl6()	_spl(PSL_S|PSL_IPL6)
197#define spl7()	_spl(PSL_S|PSL_IPL7)
198
199#define splnone()	spl0()
200#define splsoftclock()	spl1()
201#define splsoftnet()	spl1()
202#define splbio()	spl3()
203#define splnet()	spl3()
204/*
205 * lowered to spl4 to allow for serial input into
206 * private ringbuffer inspite of spltty
207 */
208#define spltty()	spl4()
209#define splimp()	spl4()
210#define splclock()	spl6()
211#define splstatclock()	spl6()
212#define splvm()		spl6()
213#define splhigh()	spl7()
214#define splsched()	spl7()
215
216#define splx(s)         (s & PSL_IPL ? _spl_no_check(s) : spl0())
217
218#ifdef _KERNEL
219int spl0 __P((void));
220void delay __P((int));
221
222#define	DELAY(n)	delay(n)
223#endif /* _KERNEL */
224
225#endif /* !_MACHINE_PARAM_H_ */
226