![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to param.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Apple Darwin 0.x] / kernel / bsd / sys|
Return to param.h CVS log | Up to [Apple Darwin 0.x] / kernel / bsd / sys |
1.1 root 1: /*
2: * Copyright (c) 1999 Apple Computer, Inc. All rights reserved.
3: *
4: * @APPLE_LICENSE_HEADER_START@
5: *
6: * Portions Copyright (c) 1999 Apple Computer, Inc. All Rights
7: * Reserved. This file contains Original Code and/or Modifications of
8: * Original Code as defined in and that are subject to the Apple Public
9: * Source License Version 1.1 (the "License"). You may not use this file
10: * except in compliance with the License. Please obtain a copy of the
11: * License at http://www.apple.com/publicsource and read it before using
12: * this file.
13: *
14: * The Original Code and all software distributed under the License are
15: * distributed on an "AS IS" basis, WITHOUT WARRANTY OF ANY KIND, EITHER
16: * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
17: * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
18: * FITNESS FOR A PARTICULAR PURPOSE OR NON-INFRINGEMENT. Please see the
19: * License for the specific language governing rights and limitations
20: * under the License.
21: *
22: * @APPLE_LICENSE_HEADER_END@
23: */
24:
25: /* Copyright (c) 1995, 1997 Apple Computer, Inc. All Rights Reserved */
26: /*-
27: * Copyright (c) 1982, 1986, 1989, 1993
28: * The Regents of the University of California. All rights reserved.
29: * (c) UNIX System Laboratories, Inc.
30: * All or some portions of this file are derived from material licensed
31: * to the University of California by American Telephone and Telegraph
32: * Co. or Unix System Laboratories, Inc. and are reproduced herein with
33: * the permission of UNIX System Laboratories, Inc.
34: *
35: * Redistribution and use in source and binary forms, with or without
36: * modification, are permitted provided that the following conditions
37: * are met:
38: * 1. Redistributions of source code must retain the above copyright
39: * notice, this list of conditions and the following disclaimer.
40: * 2. Redistributions in binary form must reproduce the above copyright
41: * notice, this list of conditions and the following disclaimer in the
42: * documentation and/or other materials provided with the distribution.
43: * 3. All advertising materials mentioning features or use of this software
44: * must display the following acknowledgement:
45: * This product includes software developed by the University of
46: * California, Berkeley and its contributors.
47: * 4. Neither the name of the University nor the names of its contributors
48: * may be used to endorse or promote products derived from this software
49: * without specific prior written permission.
50: *
51: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
52: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
53: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
54: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
55: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
56: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
57: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
58: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
59: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
60: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
61: * SUCH DAMAGE.
62: *
63: * @(#)param.h 8.3 (Berkeley) 4/4/95
64: */
65:
66: #ifndef _SYS_PARAM_H_
67: #define _SYS_PARAM_H_
68:
69: #define BSD 199506 /* System version (year & month). */
70: #define BSD4_3 1
71: #define BSD4_4 1
72:
73: #define NeXTBSD 1995064 /* NeXTBSD version (year, month, release) */
74: #define NeXTBSD4_0 0 /* NeXTBSD 4.0 */
75:
76: #ifndef NULL
77: #define NULL 0
78: #endif
79:
80: #ifndef LOCORE
81: #include <sys/types.h>
82: #endif
83:
84: /*
85: * Machine-independent constants (some used in following include files).
86: * Redefined constants are from POSIX 1003.1 limits file.
87: *
88: * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>)
89: * MAXLOGNAME should be >= UT_NAMESIZE (see <utmp.h>)
90: */
91: #include <sys/syslimits.h>
92:
93: #define MAXCOMLEN 16 /* max command name remembered */
94: #define MAXINTERP 64 /* max interpreter file name length */
95: #define MAXLOGNAME 12 /* max login name length */
96: #define MAXUPRC CHILD_MAX /* max simultaneous processes */
97: #define NCARGS ARG_MAX /* max bytes for an exec function */
98: #define NGROUPS NGROUPS_MAX /* max number groups */
99: #define NOFILE 256 /* default max open files per process */
100: #define NOGROUP 65535 /* marker for empty group set member */
101: #define MAXHOSTNAMELEN 256 /* max hostname size */
102: #define MAXDOMNAMELEN 256 /* maximum domain name length */
103:
104: /* Machine type dependent parameters. */
105: #include <machine/param.h>
106: #include <machine/limits.h>
107:
108: /* More types and definitions used throughout the kernel. */
109: #ifdef _KERNEL
110: #include <sys/cdefs.h>
111: #include <sys/errno.h>
112: #include <sys/time.h>
113: #include <sys/resource.h>
114: #include <sys/ucred.h>
115: #include <sys/uio.h>
116: #endif
117:
118: /* Signals. */
119: #include <sys/signal.h>
120:
121: /*
122: * Priorities. Note that with 32 run queues, differences less than 4 are
123: * insignificant.
124: */
125: #define PSWP 0
126: #define PVM 4
127: #define PINOD 8
128: #define PRIBIO 16
129: #define PVFS 20
130: #define PZERO 22 /* No longer magic, shouldn't be here. XXX */
131: #define PSOCK 24
132: #define PWAIT 32
133: #define PLOCK 36
134: #define PPAUSE 40
135: #define PUSER 50
136: #define MAXPRI 127 /* Priorities range from 0 through MAXPRI. */
137:
138: #define PRIMASK 0x0ff
139: #define PCATCH 0x100 /* OR'd with pri for tsleep to check signals */
140:
141: #define NZERO 0 /* default "nice" */
142:
143: #define NBPW sizeof(int) /* number of bytes per word (integer) */
144:
145: #define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */
146: #define NODEV (dev_t)(-1) /* non-existent device */
147:
148: /*
149: * Clustering of hardware pages on machines with ridiculously small
150: * page sizes is done here. The paging subsystem deals with units of
151: * CLSIZE pte's describing NBPG (from machine/param.h) pages each.
152: */
153: #define CLBYTES (CLSIZE*NBPG)
154: #define CLOFSET (CLSIZE*NBPG-1) /* for clusters, like PGOFSET */
155: #define claligned(x) ((((int)(x))&CLOFSET)==0)
156: #define CLOFF CLOFSET
157: #define CLSHIFT (PGSHIFT+CLSIZELOG2)
158:
159: #if CLSIZE==1
160: #define clbase(i) (i)
161: #define clrnd(i) (i)
162: #else
163: /* Give the base virtual address (first of CLSIZE). */
164: #define clbase(i) ((i) &~ (CLSIZE-1))
165: /* Round a number of clicks up to a whole cluster. */
166: #define clrnd(i) (((i) + (CLSIZE-1)) &~ (CLSIZE-1))
167: #endif
168:
169: #define CBLOCK 64 /* Clist block size, must be a power of 2. */
170: #define CBQSIZE (CBLOCK/NBBY) /* Quote bytes/cblock - can do better. */
171: /* Data chars/clist. */
172: #define CBSIZE (CBLOCK - sizeof(struct cblock *) - CBQSIZE)
173: #define CROUND (CBLOCK - 1) /* Clist rounding. */
174:
175: /*
176: * File system parameters and macros.
177: *
178: * The file system is made out of blocks of at most MAXBSIZE units, with
179: * smaller units (fragments) only in the last direct block. MAXBSIZE
180: * primarily determines the size of buffers in the buffer pool. It may be
181: * made larger without any effect on existing file systems; however making
182: * it smaller make make some file systems unmountable.
183: */
184: #define MAXBSIZE 8192
185: #define MAXPHYSIO MAXPHYS
186: #define MAXFRAG 8
187:
188: /*
189: * MAXPATHLEN defines the longest permissable path length after expanding
190: * symbolic links. It is used to allocate a temporary buffer from the buffer
191: * pool in which to do the name expansion, hence should be a power of two,
192: * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the
193: * maximum number of symbolic links that may be expanded in a path name.
194: * It should be set high enough to allow all legitimate uses, but halt
195: * infinite loops reasonably quickly.
196: */
197: #define MAXPATHLEN PATH_MAX
198: #define MAXSYMLINKS 32
199:
200: /* Bit map related macros. */
201: #define setbit(a,i) (((char *)(a))[(i)/NBBY] |= 1<<((i)%NBBY))
202: #define clrbit(a,i) (((char *)(a))[(i)/NBBY] &= ~(1<<((i)%NBBY)))
203: #define isset(a,i) (((char *)(a))[(i)/NBBY] & (1<<((i)%NBBY)))
204: #define isclr(a,i) ((((char *)(a))[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
205:
206: /* Macros for counting and rounding. */
207: #ifndef howmany
208: #define howmany(x, y) (((x)+((y)-1))/(y))
209: #endif
210: #define roundup(x, y) ((((x)+((y)-1))/(y))*(y))
211: #define powerof2(x) ((((x)-1)&(x))==0)
212:
213: /* Macros for min/max. */
214: #ifndef MIN
215: #define MIN(a,b) (((a)<(b))?(a):(b))
216: #endif /* MIN */
217: #ifndef MAX
218: #define MAX(a,b) (((a)>(b))?(a):(b))
219: #endif /* MAX */
220:
221: /*
222: * Constants for setting the parameters of the kernel memory allocator.
223: *
224: * 2 ** MINBUCKET is the smallest unit of memory that will be
225: * allocated. It must be at least large enough to hold a pointer.
226: *
227: * Units of memory less or equal to MAXALLOCSAVE will permanently
228: * allocate physical memory; requests for these size pieces of
229: * memory are quite fast. Allocations greater than MAXALLOCSAVE must
230: * always allocate and free physical memory; requests for these
231: * size allocations should be done infrequently as they will be slow.
232: *
233: * Constraints: CLBYTES <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14), and
234: * MAXALLOCSIZE must be a power of two.
235: */
236: #define MINBUCKET 4 /* 4 => min allocation of 16 bytes */
237: #define MAXALLOCSAVE (2 * CLBYTES)
238:
239: /*
240: * Scale factor for scaled integers used to count %cpu time and load avgs.
241: *
242: * The number of CPU `tick's that map to a unique `%age' can be expressed
243: * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that
244: * can be calculated (assuming 32 bits) can be closely approximated using
245: * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).
246: *
247: * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',
248: * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.
249: */
250: #define FSHIFT 11 /* bits to right of fixed binary point */
251: #define FSCALE (1<<FSHIFT)
252:
253: #endif /* _SYS_PARAM_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.