ec222a71d9
of MCLOFSET, which does not appear to be used anywhere anymore, and if it is, it probably shouldn't be.
162 lines
5.4 KiB
C
162 lines
5.4 KiB
C
/* $FreeBSD$ */
|
|
/* From: NetBSD: param.h,v 1.20 1997/09/19 13:52:53 leo 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$
|
|
*
|
|
* @(#)param.h 8.1 (Berkeley) 6/10/93
|
|
*/
|
|
|
|
/*
|
|
* Machine dependent constants for the IA64.
|
|
*/
|
|
#ifndef _MACHINE
|
|
#define _MACHINE ia64
|
|
#endif
|
|
#ifndef MACHINE
|
|
#define MACHINE "ia64"
|
|
#endif
|
|
#ifndef _MACHINE_ARCH
|
|
#define _MACHINE_ARCH ia64
|
|
#endif
|
|
#ifndef MACHINE_ARCH
|
|
#define MACHINE_ARCH "ia64"
|
|
#endif
|
|
#define MID_MACHINE MID_IA64
|
|
|
|
#include <machine/ia64_cpu.h>
|
|
#include <machine/cpu.h>
|
|
|
|
/*
|
|
* OBJFORMAT_NAMES is a comma-separated list of the object formats
|
|
* that are supported on the architecture.
|
|
*/
|
|
#define OBJFORMAT_NAMES "elf"
|
|
#define OBJFORMAT_DEFAULT "elf"
|
|
|
|
#define NCPUS 1
|
|
|
|
/*
|
|
* Round p (pointer or byte index) up to a correctly-aligned value for all
|
|
* data types (int, long, ...). The result is u_long 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_long)(p) + ALIGNBYTES) &~ ALIGNBYTES)
|
|
#define ALIGNED_POINTER(p,t) ((((u_long)(p)) & (sizeof(t)-1)) == 0)
|
|
|
|
#define PAGE_SIZE 4096 /* bytes/page */
|
|
#define PAGE_SHIFT 12
|
|
#define PAGE_MASK (PAGE_SIZE-1)
|
|
#define NPTEPG (PAGE_SIZE/(sizeof (pt_entry_t)))
|
|
|
|
#define KERNBASE 0xfffffc0000300000LL /* start of kernel virtual */
|
|
#define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT)
|
|
|
|
#define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */
|
|
#define DEV_BSIZE (1<<DEV_BSHIFT)
|
|
|
|
#ifndef BLKDEV_IOSIZE
|
|
#define BLKDEV_IOSIZE PAGE_SIZE /* default block device I/O size */
|
|
#endif
|
|
#define DFLTPHYS (64 * 1024) /* default max raw I/O transfer size */
|
|
#define MAXPHYS (128 * 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 4 /* pages of u-area */
|
|
#define USPACE (UPAGES * PAGE_SIZE) /* total size of u-area */
|
|
|
|
/*
|
|
* Constants related to network buffer management.
|
|
* MCLBYTES must be no larger than PAGE_SIZE.
|
|
*/
|
|
#ifndef MSIZE
|
|
#define MSIZE 256 /* size of an mbuf */
|
|
#endif /* MSIZE */
|
|
|
|
#ifndef MCLSHIFT
|
|
#define MCLSHIFT 11 /* convert bytes to mbuf clusters */
|
|
#endif /* MCLSHIFT */
|
|
#define MCLBYTES (1 << MCLSHIFT) /* size of a mbuf cluster */
|
|
|
|
/*
|
|
* Size of kernel malloc arena in CLBYTES-sized logical pages
|
|
*/
|
|
#ifndef NKMEMCLUSTERS
|
|
#define NKMEMCLUSTERS (4096*1024/CLBYTES) /* XXX? */
|
|
#endif
|
|
|
|
/* pages ("clicks") to disk blocks */
|
|
#define ctod(x) ((x) << (PAGE_SHIFT - DEV_BSHIFT))
|
|
#define dtoc(x) ((x) >> (PAGE_SHIFT - DEV_BSHIFT))
|
|
|
|
/* pages to bytes */
|
|
#define ctob(x) ((x) << PAGE_SHIFT)
|
|
#define btoc(x) (((x) + PAGE_MASK) >> PAGE_SHIFT)
|
|
|
|
/* bytes to disk blocks */
|
|
#define btodb(x) ((x) >> DEV_BSHIFT)
|
|
#define dbtob(x) ((x) << DEV_BSHIFT)
|
|
|
|
/*
|
|
* Mach derived conversion macros
|
|
*/
|
|
#define round_page(x) ((((unsigned long)(x)) + PAGE_MASK) & ~(PAGE_MASK))
|
|
#define trunc_page(x) ((unsigned long)(x) & ~(PAGE_MASK))
|
|
|
|
#define atop(x) ((unsigned long)(x) >> PAGE_SHIFT)
|
|
#define ptoa(x) ((unsigned long)(x) << PAGE_SHIFT)
|
|
|
|
#define ia64_btop(x) ((unsigned long)(x) >> PAGE_SHIFT)
|
|
#define ia64_ptob(x) ((unsigned long)(x) << PAGE_SHIFT)
|
|
|
|
#define pgtok(x) ((x) * (PAGE_SIZE / 1024))
|