param.h revision 1.10
1/* $NetBSD: param.h,v 1.10 2000/01/23 20:08:28 soda Exp $ */ 2 3/* 4 * Copyright (c) 1988 University of Utah. 5 * Copyright (c) 1992, 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 and Ralph Campbell. 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 * 43 * from: @(#)param.h 8.1 (Berkeley) 6/10/93 44 */ 45 46/* 47 * Machine-dependent constants (VM, etc) common across MIPS cpus 48 */ 49#include <mips/mips_param.h> 50 51/* 52 * Machine dependent constants for Acer Labs PICA_61. 53 */ 54#define MACHINE "pica" 55#define MACHINE_ARCH "mips" 56#define MID_PICA MID_PMAX /* For the moment */ 57#define MID_MACHINE MID_PICA 58 59/* 60 * Round p (pointer or byte index) up to a correctly-aligned value for all 61 * data types (int, long, ...). The result is u_int and must be cast to 62 * any desired pointer type. 63 * 64 * ALIGNED_POINTER is a boolean macro that checks whether an address 65 * is valid to fetch data elements of type t from on this architecture. 66 * This does not reflect the optimal alignment, just the possibility 67 * (within reasonable limits). 68 * 69 */ 70#define ALIGNBYTES 7 71#define ALIGN(p) (((u_int)(p) + ALIGNBYTES) &~ ALIGNBYTES) 72#define ALIGNED_POINTER(p,t) ((((u_long)(p)) & (sizeof(t)-1)) == 0) 73 74#define NBPG 4096 /* bytes/page */ 75#define PGOFSET (NBPG-1) /* byte offset into page */ 76#define PGSHIFT 12 /* LOG2(NBPG) */ 77#define NPTEPG (NBPG/4) 78 79#define NBSEG 0x400000 /* bytes/segment */ 80#define SEGOFSET (NBSEG-1) /* byte offset into segment */ 81#define SEGSHIFT 22 /* LOG2(NBSEG) */ 82 83#define KERNBASE 0x80000000 /* start of kernel virtual */ 84#define KERNTEXTOFF 0x80080000 /* start of kernel text for kvm_mkdb */ 85#define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT) 86 87#define DEV_BSIZE 512 88#define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */ 89#define BLKDEV_IOSIZE 2048 90#define MAXPHYS (64 * 1024) /* max raw I/O transfer size */ 91 92#define SSIZE 1 /* initial stack size/NBPG */ 93#define SINCR 1 /* increment of stack/NBPG */ 94 95#define UPAGES 2 /* pages of u-area */ 96#define UADDR 0xffffc000 /* address of u */ 97#define USPACE (UPAGES*NBPG) /* size of u-area in bytes */ 98#define UVPN (UADDR>>PGSHIFT)/* virtual page number of u */ 99#define KERNELSTACK (UADDR+UPAGES*NBPG) /* top of kernel stack */ 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 MCLBYTES 2048 /* enough for whole Ethernet packet */ 110#define MCLSHIFT 10 111#define MCLOFSET (MCLBYTES - 1) 112#ifndef NMBCLUSTERS 113 114#if defined(_KERNEL) && !defined(_LKM) 115#include "opt_gateway.h" 116#endif /* _KERNEL && ! _LKM */ 117 118#ifdef GATEWAY 119#define NMBCLUSTERS 2048 /* map size, max cluster allocation */ 120#else 121#define NMBCLUSTERS 1024 /* map size, max cluster allocation */ 122#endif 123#endif 124 125/* 126 * Size of kernel malloc arena in NBPG-sized logical pages 127 */ 128#ifndef NKMEMCLUSTERS 129#define NKMEMCLUSTERS (512*1024/NBPG) 130#endif 131 132/* pages ("clicks") (4096 bytes) to disk blocks */ 133#define ctod(x) ((x) << (PGSHIFT - DEV_BSHIFT)) 134#define dtoc(x) ((x) >> (PGSHIFT - DEV_BSHIFT)) 135 136/* pages to bytes */ 137#define ctob(x) ((x) << PGSHIFT) 138#define btoc(x) (((x) + PGOFSET) >> PGSHIFT) 139 140/* bytes to disk blocks */ 141#define btodb(x) ((x) >> DEV_BSHIFT) 142#define dbtob(x) ((x) << DEV_BSHIFT) 143 144/* 145 * Map a ``block device block'' to a file system block. 146 * This should be device dependent, and should use the bsize 147 * field from the disk label. 148 * For now though just use DEV_BSIZE. 149 */ 150#define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE/DEV_BSIZE)) 151 152/* 153 * Mach derived conversion macros 154 */ 155#define pica_round_page(x) ((((unsigned)(x)) + NBPG - 1) & ~(NBPG-1)) 156#define pica_trunc_page(x) ((unsigned)(x) & ~(NBPG-1)) 157#define pica_btop(x) ((unsigned)(x) >> PGSHIFT) 158#define pica_ptob(x) ((unsigned)(x) << PGSHIFT) 159 160#ifdef _KERNEL 161#ifndef _LOCORE 162/* 163 * Delay is based on an assumtion that each time in the loop 164 * takes 3 clocks. Three is for branch and subtract in the delay slot. 165 */ 166extern int cpuspeed; 167#define DELAY(n) { register int N = cpuspeed * (n); while ((N -= 3) > 0); } 168#endif /*!_LOCORE */ 169 170#else /* !_KERNEL */ 171#define DELAY(n) { register int N = (n); while (--N > 0); } 172#endif /* !_KERNEL */ 173