181 lines
6.5 KiB
C
181 lines
6.5 KiB
C
/* $NetBSD: param.h,v 1.4 1997/02/24 23:21:15 fvdl Exp $ */
|
|
|
|
/*
|
|
* Copyright (c) 1988 University of Utah.
|
|
* Copyright (c) 1992, 1993
|
|
* 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 and Ralph Campbell.
|
|
*
|
|
* 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.
|
|
*
|
|
* from: Utah Hdr: machparam.h 1.11 89/08/14
|
|
*
|
|
*
|
|
* from: @(#)param.h 8.1 (Berkeley) 6/10/93
|
|
*/
|
|
|
|
/*
|
|
* Machine-dependent constants (VM, etc) common across MIPS cpus
|
|
*/
|
|
#include <mips/mips_param.h>
|
|
|
|
/*
|
|
* Machine dependent constants for Acer Labs PICA_61.
|
|
*/
|
|
#define MACHINE "pica"
|
|
#define MACHINE_ARCH "mips"
|
|
#define MID_PICA MID_PMAX /* For the moment */
|
|
#define MID_MACHINE MID_PICA
|
|
|
|
/*
|
|
* 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.
|
|
*
|
|
* ALIGNED_POINTER is a boolean macro that checks whether an address
|
|
* is valid to fetch data elements of type t from on this architecture.
|
|
* This does not reflect the optimal alignment, just the possibility
|
|
* (within reasonable limits).
|
|
*
|
|
*/
|
|
#define ALIGNBYTES 7
|
|
#define ALIGN(p) (((u_int)(p) + ALIGNBYTES) &~ ALIGNBYTES)
|
|
#define ALIGNED_POINTER(p,t) ((((u_long)(p)) & (sizeof(t)-1)) == 0)
|
|
|
|
#define NBPG 4096 /* bytes/page */
|
|
#define PGOFSET (NBPG-1) /* byte offset into page */
|
|
#define PGSHIFT 12 /* LOG2(NBPG) */
|
|
#define NPTEPG (NBPG/4)
|
|
|
|
#define NBSEG 0x400000 /* bytes/segment */
|
|
#define SEGOFSET (NBSEG-1) /* byte offset into segment */
|
|
#define SEGSHIFT 22 /* LOG2(NBSEG) */
|
|
|
|
#define KERNBASE 0x80000000 /* start of kernel virtual */
|
|
#define KERNTEXTOFF 0x80080000 /* start of kernel text for kvm_mkdb */
|
|
#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 2 /* pages of u-area */
|
|
#define UADDR 0xffffc000 /* address of u */
|
|
#define USPACE (UPAGES*NBPG) /* size of u-area in bytes */
|
|
#define UVPN (UADDR>>PGSHIFT)/* virtual page number of u */
|
|
#define KERNELSTACK (UADDR+UPAGES*NBPG) /* top of kernel stack */
|
|
|
|
/*
|
|
* 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 2048 /* enough for whole Ethernet packet */
|
|
#define MCLSHIFT 10
|
|
#define MCLOFSET (MCLBYTES - 1)
|
|
#ifndef NMBCLUSTERS
|
|
#ifdef GATEWAY
|
|
#define NMBCLUSTERS 2048 /* map size, max cluster allocation */
|
|
#else
|
|
#define NMBCLUSTERS 1024 /* map size, max cluster allocation */
|
|
#endif
|
|
#endif
|
|
|
|
/*
|
|
* Size of kernel malloc arena in CLBYTES-sized logical pages
|
|
*/
|
|
#ifndef NKMEMCLUSTERS
|
|
#define NKMEMCLUSTERS (512*1024/CLBYTES)
|
|
#endif
|
|
|
|
/* pages ("clicks") (4096 bytes) to disk blocks */
|
|
#define ctod(x) ((x) << (PGSHIFT - DEV_BSHIFT))
|
|
#define dtoc(x) ((x) >> (PGSHIFT - DEV_BSHIFT))
|
|
|
|
/* pages to bytes */
|
|
#define ctob(x) ((x) << PGSHIFT)
|
|
#define btoc(x) (((x) + PGOFSET) >> PGSHIFT)
|
|
|
|
/* bytes to disk blocks */
|
|
#define btodb(x) ((x) >> DEV_BSHIFT)
|
|
#define dbtob(x) ((x) << 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 pica_round_page(x) ((((unsigned)(x)) + NBPG - 1) & ~(NBPG-1))
|
|
#define pica_trunc_page(x) ((unsigned)(x) & ~(NBPG-1))
|
|
#define pica_btop(x) ((unsigned)(x) >> PGSHIFT)
|
|
#define pica_ptob(x) ((unsigned)(x) << PGSHIFT)
|
|
|
|
#ifdef _KERNEL
|
|
#ifndef _LOCORE
|
|
extern int (*Mach_splnet)(), (*Mach_splbio)(), (*Mach_splimp)(),
|
|
(*Mach_spltty)(), (*Mach_splclock)(), (*Mach_splstatclock)();
|
|
#define splnet() ((*Mach_splnet)())
|
|
#define splbio() ((*Mach_splbio)())
|
|
#define splimp() ((*Mach_splimp)())
|
|
#define spltty() ((*Mach_spltty)())
|
|
#define splclock() ((*Mach_splclock)())
|
|
#define splstatclock() ((*Mach_splstatclock)())
|
|
|
|
/*
|
|
* Delay is based on an assumtion that each time in the loop
|
|
* takes 3 clocks. Three is for branch and subtract in the delay slot.
|
|
*/
|
|
extern int cpuspeed;
|
|
#define DELAY(n) { register int N = cpuspeed * (n); while ((N -= 3) > 0); }
|
|
#endif /*!_LOCORE */
|
|
|
|
#else /* !_KERNEL */
|
|
#define DELAY(n) { register int N = (n); while (--N > 0); }
|
|
#endif /* !_KERNEL */
|