2 * Copyright (c) 1982, 1986, 1989, 1993
3 * The Regents of the University of California. All rights reserved.
4 * (c) UNIX System Laboratories, Inc.
5 * All or some portions of this file are derived from material licensed
6 * to the University of California by American Telephone and Telegraph
7 * Co. or Unix System Laboratories, Inc. and are reproduced herein with
8 * the permission of UNIX System Laboratories, Inc.
10 * Redistribution and use in source and binary forms, with or without
11 * modification, are permitted provided that the following conditions
13 * 1. Redistributions of source code must retain the above copyright
14 * notice, this list of conditions and the following disclaimer.
15 * 2. Redistributions in binary form must reproduce the above copyright
16 * notice, this list of conditions and the following disclaimer in the
17 * documentation and/or other materials provided with the distribution.
18 * 3. All advertising materials mentioning features or use of this software
19 * must display the following acknowledgement:
20 * This product includes software developed by the University of
21 * California, Berkeley and its contributors.
22 * 4. Neither the name of the University nor the names of its contributors
23 * may be used to endorse or promote products derived from this software
24 * without specific prior written permission.
26 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
27 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
28 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
29 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
30 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
31 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
32 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
33 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
34 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
35 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
38 * @(#)param.h 8.3 (Berkeley) 4/4/95
39 * $FreeBSD: src/sys/sys/param.h,v 1.61.2.38 2003/05/22 17:12:01 fjoe Exp $
40 * $DragonFly: src/sys/sys/param.h,v 1.9 2003/11/15 11:46:26 asmodai Exp $
46 #define BSD 199506 /* System version (year & month). */
51 * __FreeBSD_version numbers are documented in the Porter's Handbook.
52 * If you bump the version for any reason, you should update the documentation
54 * Currently this lives here:
55 * doc/en_US.ISO8859-1/books/porters-handbook/book.sgml
57 #undef __FreeBSD_version
58 #define __FreeBSD_version 480101 /* Master, propagated to newvers */
60 #undef __DragonFly_version
61 #define __DragonFly_version 100000
68 #include <sys/types.h>
72 * Machine-independent constants (some used in following include files).
73 * Redefined constants are from POSIX 1003.1 limits file.
75 * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>)
76 * MAXLOGNAME should be == UT_NAMESIZE+1 (see <utmp.h>)
78 #include <sys/syslimits.h>
80 #define MAXCOMLEN 16 /* max command name remembered */
81 #define MAXINTERP 32 /* max interpreter file name length */
82 #define MAXLOGNAME 17 /* max login name length (incl. NUL) */
83 #define MAXUPRC CHILD_MAX /* max simultaneous processes */
84 #define NCARGS ARG_MAX /* max bytes for an exec function */
85 #define NGROUPS NGROUPS_MAX /* max number groups */
86 #define NOFILE OPEN_MAX /* max open files per process */
87 #define NOGROUP 65535 /* marker for empty group set member */
88 #define MAXHOSTNAMELEN 256 /* max hostname size */
90 /* More types and definitions used throughout the kernel. */
92 #include <sys/cdefs.h>
93 #include <sys/errno.h>
102 #include <sys/signal.h>
105 /* Machine type dependent parameters. */
106 #include <machine/param.h>
108 #include <machine/limits.h>
112 * Priorities. Note that with 32 run queues, differences less than 4 are
115 #define MAXPRI 127 /* Priorities range from 0 through MAXPRI. */
117 #define PRIBASE_REALTIME 0
118 #define PRIBASE_NORMAL 128
119 #define PRIBASE_IDLE 256
120 #define PRIBASE_THREAD 384 /* huh? */
122 #define PCATCH 0x0100 /* OR'd with pri for tsleep to check signals */
123 #define PUSRFLAG1 0x0200 /* Subsystem specific flag */
125 #define NZERO 0 /* default "nice" */
127 #define NBPW sizeof(int) /* number of bytes per word (integer) */
129 #define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */
131 #define NODEV (dev_t)(-1) /* non-existent device */
132 #define NOUDEV (udev_t)(-1) /* non-existent device */
133 #define NOMAJ 256 /* non-existent device */
135 #define NODEV (dev_t)(-1) /* non-existent device */
139 * Clustering of hardware pages on machines with ridiculously small
140 * page sizes is done here. The paging subsystem deals with units of
141 * CLSIZE pte's describing PAGE_SIZE (from machine/machparam.h) pages each.
144 #define CLBYTES (CLSIZE*PAGE_SIZE)
147 #define CBLOCK 128 /* Clist block size, must be a power of 2. */
148 #define CBQSIZE (CBLOCK/NBBY) /* Quote bytes/cblock - can do better. */
149 /* Data chars/clist. */
150 #define CBSIZE (CBLOCK - sizeof(struct cblock *) - CBQSIZE)
151 #define CROUND (CBLOCK - 1) /* Clist rounding. */
154 * File system parameters and macros.
156 * MAXBSIZE - Filesystems are made out of blocks of at most MAXBSIZE bytes
157 * per block. MAXBSIZE may be made larger without effecting
158 * any existing filesystems as long as it does not exceed MAXPHYS,
159 * and may be made smaller at the risk of not being able to use
160 * filesystems which require a block size exceeding MAXBSIZE.
162 * BKVASIZE - Nominal buffer space per buffer, in bytes. BKVASIZE is the
163 * minimum KVM memory reservation the kernel is willing to make.
164 * Filesystems can of course request smaller chunks. Actual
165 * backing memory uses a chunk size of a page (PAGE_SIZE).
167 * If you make BKVASIZE too small you risk seriously fragmenting
168 * the buffer KVM map which may slow things down a bit. If you
169 * make it too big the kernel will not be able to optimally use
170 * the KVM memory reserved for the buffer cache and will wind
171 * up with too-few buffers.
173 * The default is 16384, roughly 2x the block size used by a
174 * normal UFS filesystem.
176 #define MAXBSIZE 65536 /* must be power of 2 */
177 #define BKVASIZE 16384 /* must be power of 2 */
178 #define BKVAMASK (BKVASIZE-1)
182 * MAXPATHLEN defines the longest permissible path length after expanding
183 * symbolic links. It is used to allocate a temporary buffer from the buffer
184 * pool in which to do the name expansion, hence should be a power of two,
185 * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the
186 * maximum number of symbolic links that may be expanded in a path name.
187 * It should be set high enough to allow all legitimate uses, but halt
188 * infinite loops reasonably quickly.
190 #define MAXPATHLEN PATH_MAX
191 #define MAXSYMLINKS 32
193 /* Bit map related macros. */
194 #define setbit(a,i) ((a)[(i)/NBBY] |= 1<<((i)%NBBY))
195 #define clrbit(a,i) ((a)[(i)/NBBY] &= ~(1<<((i)%NBBY)))
196 #define isset(a,i) ((a)[(i)/NBBY] & (1<<((i)%NBBY)))
197 #define isclr(a,i) (((a)[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
199 /* Macros for counting and rounding. */
201 #define howmany(x, y) (((x)+((y)-1))/(y))
203 #define rounddown(x, y) (((x)/(y))*(y))
204 #define roundup(x, y) ((((x)+((y)-1))/(y))*(y)) /* to any y */
205 #define roundup2(x, y) (((x)+((y)-1))&(~((y)-1))) /* if y is powers of two */
206 #define powerof2(x) ((((x)-1)&(x))==0)
208 /* Macros for min/max. */
209 #define MIN(a,b) (((a)<(b))?(a):(b))
210 #define MAX(a,b) (((a)>(b))?(a):(b))
213 * Constants for setting the parameters of the kernel memory allocator.
215 * 2 ** MINBUCKET is the smallest unit of memory that will be
216 * allocated. It must be at least large enough to hold a pointer.
218 * Units of memory less or equal to MAXALLOCSAVE will permanently
219 * allocate physical memory; requests for these size pieces of
220 * memory are quite fast. Allocations greater than MAXALLOCSAVE must
221 * always allocate and free physical memory; requests for these
222 * size allocations should be done infrequently as they will be slow.
224 * Constraints: PAGE_SIZE <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14), and
225 * MAXALLOCSIZE must be a power of two.
227 #if defined(__alpha__)
228 #define MINBUCKET 5 /* 5 => min allocation of 32 bytes */
230 #define MINBUCKET 4 /* 4 => min allocation of 16 bytes */
232 #define MAXALLOCSAVE (2 * PAGE_SIZE)
235 * Scale factor for scaled integers used to count %cpu time and load avgs.
237 * The number of CPU `tick's that map to a unique `%age' can be expressed
238 * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that
239 * can be calculated (assuming 32 bits) can be closely approximated using
240 * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).
242 * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',
243 * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.
245 #define FSHIFT 11 /* bits to right of fixed binary point */
246 #define FSCALE (1<<FSHIFT)
248 #define dbtoc(db) /* calculates devblks to pages */ \
249 ((db + (ctodb(1) - 1)) >> (PAGE_SHIFT - DEV_BSHIFT))
251 #define ctodb(db) /* calculates pages to devblks */ \
252 ((db) << (PAGE_SHIFT - DEV_BSHIFT))
256 * Make this available for most of the kernel. There were too many
257 * things that included sys/systm.h just for panic().
260 void panic (const char *, ...) __dead2 __printflike(1, 2);
263 #endif /* _SYS_PARAM_H_ */