]> git.saurik.com Git - apple/xnu.git/blame - bsd/sys/param.h
xnu-344.49.tar.gz
[apple/xnu.git] / bsd / sys / param.h
CommitLineData
1c79356b
A
1/*
2 * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.
3 *
4 * @APPLE_LICENSE_HEADER_START@
5 *
43866e37 6 * Copyright (c) 1999-2003 Apple Computer, Inc. All Rights Reserved.
1c79356b 7 *
43866e37
A
8 * This file contains Original Code and/or Modifications of Original Code
9 * as defined in and that are subject to the Apple Public Source License
10 * Version 2.0 (the 'License'). You may not use this file except in
11 * compliance with the License. Please obtain a copy of the License at
12 * http://www.opensource.apple.com/apsl/ and read it before using this
13 * file.
14 *
15 * The Original Code and all software distributed under the License are
16 * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER
1c79356b
A
17 * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,
18 * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,
43866e37
A
19 * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.
20 * Please see the License for the specific language governing rights and
21 * limitations under the License.
1c79356b
A
22 *
23 * @APPLE_LICENSE_HEADER_END@
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 */
9bccf70c 95#define MAXLOGNAME 255 /* max login name length */
1c79356b
A
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#define PTTYBLOCK 0x200 /* for tty SIGTTOU and SIGTTIN blocking */
141
142#define NZERO 0 /* default "nice" */
143
144#define NBPW sizeof(int) /* number of bytes per word (integer) */
145
146#define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */
147#define NODEV (dev_t)(-1) /* non-existent device */
148
149/*
150 * Clustering of hardware pages on machines with ridiculously small
151 * page sizes is done here. The paging subsystem deals with units of
152 * CLSIZE pte's describing NBPG (from machine/param.h) pages each.
153 */
154#define CLBYTES (CLSIZE*NBPG)
155#define CLOFSET (CLSIZE*NBPG-1) /* for clusters, like PGOFSET */
156#define claligned(x) ((((int)(x))&CLOFSET)==0)
157#define CLOFF CLOFSET
158#define CLSHIFT (PGSHIFT+CLSIZELOG2)
159
160#if CLSIZE==1
161#define clbase(i) (i)
162#define clrnd(i) (i)
163#else
164/* Give the base virtual address (first of CLSIZE). */
165#define clbase(i) ((i) &~ (CLSIZE-1))
166/* Round a number of clicks up to a whole cluster. */
167#define clrnd(i) (((i) + (CLSIZE-1)) &~ (CLSIZE-1))
168#endif
169
170#define CBLOCK 64 /* Clist block size, must be a power of 2. */
171#define CBQSIZE (CBLOCK/NBBY) /* Quote bytes/cblock - can do better. */
172 /* Data chars/clist. */
173#define CBSIZE (CBLOCK - sizeof(struct cblock *) - CBQSIZE)
174#define CROUND (CBLOCK - 1) /* Clist rounding. */
175
176/*
177 * File system parameters and macros.
178 *
179 * The file system is made out of blocks of at most MAXBSIZE units, with
180 * smaller units (fragments) only in the last direct block. MAXBSIZE
181 * primarily determines the size of buffers in the buffer pool. It may be
182 * made larger without any effect on existing file systems; however making
183 * it smaller make make some file systems unmountable.
184 */
185#define MAXBSIZE MAXPHYS
186#define MAXPHYSIO MAXPHYS
187#define MAXFRAG 8
188
189/*
190 * MAXPATHLEN defines the longest permissable path length after expanding
191 * symbolic links. It is used to allocate a temporary buffer from the buffer
192 * pool in which to do the name expansion, hence should be a power of two,
193 * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the
194 * maximum number of symbolic links that may be expanded in a path name.
195 * It should be set high enough to allow all legitimate uses, but halt
196 * infinite loops reasonably quickly.
197 */
198#define MAXPATHLEN PATH_MAX
199#define MAXSYMLINKS 32
200
201/* Bit map related macros. */
202#define setbit(a,i) (((char *)(a))[(i)/NBBY] |= 1<<((i)%NBBY))
203#define clrbit(a,i) (((char *)(a))[(i)/NBBY] &= ~(1<<((i)%NBBY)))
204#define isset(a,i) (((char *)(a))[(i)/NBBY] & (1<<((i)%NBBY)))
205#define isclr(a,i) ((((char *)(a))[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
206
207/* Macros for counting and rounding. */
208#ifndef howmany
209#define howmany(x, y) (((x)+((y)-1))/(y))
210#endif
211#define roundup(x, y) ((((x)+((y)-1))/(y))*(y))
212#define powerof2(x) ((((x)-1)&(x))==0)
213
214/* Macros for min/max. */
215#ifndef MIN
216#define MIN(a,b) (((a)<(b))?(a):(b))
217#endif /* MIN */
218#ifndef MAX
219#define MAX(a,b) (((a)>(b))?(a):(b))
220#endif /* MAX */
221
222/*
223 * Constants for setting the parameters of the kernel memory allocator.
224 *
225 * 2 ** MINBUCKET is the smallest unit of memory that will be
226 * allocated. It must be at least large enough to hold a pointer.
227 *
228 * Units of memory less or equal to MAXALLOCSAVE will permanently
229 * allocate physical memory; requests for these size pieces of
230 * memory are quite fast. Allocations greater than MAXALLOCSAVE must
231 * always allocate and free physical memory; requests for these
232 * size allocations should be done infrequently as they will be slow.
233 *
234 * Constraints: CLBYTES <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14), and
235 * MAXALLOCSIZE must be a power of two.
236 */
237#define MINBUCKET 4 /* 4 => min allocation of 16 bytes */
238#define MAXALLOCSAVE (2 * CLBYTES)
239
240/*
241 * Scale factor for scaled integers used to count %cpu time and load avgs.
242 *
243 * The number of CPU `tick's that map to a unique `%age' can be expressed
244 * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that
245 * can be calculated (assuming 32 bits) can be closely approximated using
246 * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).
247 *
248 * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',
249 * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.
250 */
251#define FSHIFT 11 /* bits to right of fixed binary point */
252#define FSCALE (1<<FSHIFT)
253
254#endif /* _SYS_PARAM_H_ */