|
|
1.1 root 1: /*-
2: * Copyright (c) 1990 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * William Jolitz.
7: *
8: * Redistribution and use in source and binary forms, with or without
9: * modification, are permitted provided that the following conditions
10: * are met:
11: * 1. Redistributions of source code must retain the above copyright
12: * notice, this list of conditions and the following disclaimer.
13: * 2. Redistributions in binary form must reproduce the above copyright
14: * notice, this list of conditions and the following disclaimer in the
15: * documentation and/or other materials provided with the distribution.
16: * 3. All advertising materials mentioning features or use of this software
17: * must display the following acknowledgement:
18: * This product includes software developed by the University of
19: * California, Berkeley and its contributors.
20: * 4. Neither the name of the University nor the names of its contributors
21: * may be used to endorse or promote products derived from this software
22: * without specific prior written permission.
23: *
24: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
25: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
26: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
27: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
28: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
29: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
30: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
31: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
32: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
33: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34: * SUCH DAMAGE.
35: *
1.1.1.3 ! root 36: * from: @(#)param.h 5.8 (Berkeley) 6/28/91
! 37: * param.h,v 1.7 1993/07/05 01:12:46 deraadt Exp
1.1 root 38: */
39:
40: /*
41: * Machine dependent constants for Intel 386.
42: */
43:
1.1.1.3 ! root 44: #define MACHINE "i386"
! 45: #define MID_MACHINE MID_I386
1.1 root 46:
47: /*
48: * Round p (pointer or byte index) up to a correctly-aligned value
49: * for all data types (int, long, ...). The result is u_int and
50: * must be cast to any desired pointer type.
51: */
52: #define ALIGN(p) (((u_int)(p) + (sizeof(int) - 1)) &~ (sizeof(int) - 1))
53:
54: #define NBPG 4096 /* bytes/page */
55: #define PGOFSET (NBPG-1) /* byte offset into page */
56: #define PGSHIFT 12 /* LOG2(NBPG) */
57: #define NPTEPG (NBPG/(sizeof (struct pte)))
58:
59: #define NBPDR (1024*NBPG) /* bytes/page dir */
60: #define PDROFSET (NBPDR-1) /* byte offset into page dir */
61: #define PDRSHIFT 22 /* LOG2(NBPDR) */
62:
63: #define KERNBASE 0xFE000000 /* start of kernel virtual */
64: #define BTOPKERNBASE ((u_long)KERNBASE >> PGSHIFT)
65:
66: #define DEV_BSIZE 512
67: #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */
68: #define BLKDEV_IOSIZE 2048
69: #define MAXPHYS (64 * 1024) /* max raw I/O transfer size */
70:
71: #define CLSIZE 1
72: #define CLSIZELOG2 0
73:
74: /* NOTE: SSIZE, SINCR and UPAGES must be multiples of CLSIZE */
75: #define SSIZE 1 /* initial stack size/NBPG */
76: #define SINCR 1 /* increment of stack/NBPG */
77:
78: #define UPAGES 2 /* pages of u-area */
79:
80: /*
81: * Constants related to network buffer management.
82: * MCLBYTES must be no larger than CLBYTES (the software page size), and,
83: * on machines that exchange pages of input or output buffers with mbuf
84: * clusters (MAPPED_MBUFS), MCLBYTES must also be an integral multiple
85: * of the hardware page size.
86: */
1.1.1.3 ! root 87: #ifndef MSIZE
1.1 root 88: #define MSIZE 128 /* size of an mbuf */
1.1.1.3 ! root 89: #endif
! 90: #ifndef MCLSHIFT
! 91: #define MCLSHIFT 11 /* convert bytes to m_buf clusters */
! 92: #endif
! 93: #define MCLBYTES (1 << MCLSHIFT) /* size of a m_buf cluster */
! 94: #define MCLOFSET (MCLBYTES - 1) /* offset within a m_buf cluster */
1.1 root 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
1.1.1.2 root 107: #define NKMEMCLUSTERS (3072*1024/CLBYTES)
1.1 root 108: #endif
109: /*
110: * Some macros for units conversion
111: */
112: /* Core clicks (4096 bytes) to segments and vice versa */
113: #define ctos(x) (x)
114: #define stoc(x) (x)
115:
116: /* Core clicks (4096 bytes) to disk blocks */
117: #define ctod(x) ((x)<<(PGSHIFT-DEV_BSHIFT))
118: #define dtoc(x) ((x)>>(PGSHIFT-DEV_BSHIFT))
119: #define dtob(x) ((x)<<DEV_BSHIFT)
120:
121: /* clicks to bytes */
122: #define ctob(x) ((x)<<PGSHIFT)
123:
124: /* bytes to clicks */
125: #define btoc(x) (((unsigned)(x)+(NBPG-1))>>PGSHIFT)
126:
127: #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \
128: ((unsigned)(bytes) >> DEV_BSHIFT)
129: #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \
130: ((unsigned)(db) << DEV_BSHIFT)
131:
132: /*
133: * Map a ``block device block'' to a file system block.
134: * This should be device dependent, and will be if we
135: * add an entry to cdevsw/bdevsw for that purpose.
136: * For now though just use DEV_BSIZE.
137: */
138: #define bdbtofsb(bn) ((bn) / (BLKDEV_IOSIZE/DEV_BSIZE))
139:
140: /*
141: * Mach derived conversion macros
142: */
143: #define i386_round_pdr(x) ((((unsigned)(x)) + NBPDR - 1) & ~(NBPDR-1))
144: #define i386_trunc_pdr(x) ((unsigned)(x) & ~(NBPDR-1))
145: #define i386_round_page(x) ((((unsigned)(x)) + NBPG - 1) & ~(NBPG-1))
146: #define i386_trunc_page(x) ((unsigned)(x) & ~(NBPG-1))
147: #define i386_btod(x) ((unsigned)(x) >> PDRSHIFT)
148: #define i386_dtob(x) ((unsigned)(x) << PDRSHIFT)
149: #define i386_btop(x) ((unsigned)(x) >> PGSHIFT)
150: #define i386_ptob(x) ((unsigned)(x) << PGSHIFT)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.