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