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 * 4. Neither the name of the University nor the names of its contributors
19 * may be used to endorse or promote products derived from this software
20 * without specific prior written permission.
22 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
34 * @(#)param.h 8.3 (Berkeley) 4/4/95
41 #include <sys/_null.h>
43 #define BSD 199506 /* System version (year & month). */
48 * __FreeBSD_version numbers are documented in the Porter's Handbook.
49 * If you bump the version for any reason, you should update the documentation
51 * Currently this lives here:
53 * doc/en_US.ISO8859-1/books/porters-handbook/book.sgml
55 * scheme is: <major><two digit minor>Rxx
56 * 'R' is 0 if release branch or x.0-CURRENT before RELENG_*_0
57 * is created, otherwise 1.
59 #undef __FreeBSD_version
60 #define __FreeBSD_version 800067 /* Master, propagated to newvers */
63 #include <sys/types.h>
67 * Machine-independent constants (some used in following include files).
68 * Redefined constants are from POSIX 1003.1 limits file.
70 * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>)
71 * MAXLOGNAME should be == UT_NAMESIZE+1 (see <utmp.h>)
73 #include <sys/syslimits.h>
75 #define MAXCOMLEN 19 /* max command name remembered */
76 #define MAXINTERP 32 /* max interpreter file name length */
77 #define MAXLOGNAME 17 /* max login name length (incl. NUL) */
78 #define MAXUPRC CHILD_MAX /* max simultaneous processes */
79 #define NCARGS ARG_MAX /* max bytes for an exec function */
80 #define NGROUPS NGROUPS_MAX /* max number groups */
81 #define NOFILE OPEN_MAX /* max open files per process */
82 #define NOGROUP 65535 /* marker for empty group set member */
83 #define MAXHOSTNAMELEN 256 /* max hostname size */
84 #define SPECNAMELEN 63 /* max length of devicename */
86 /* More types and definitions used throughout the kernel. */
88 #include <sys/cdefs.h>
89 #include <sys/errno.h>
92 #include <sys/priority.h>
105 #include <sys/signal.h>
108 /* Machine type dependent parameters. */
109 #include <machine/param.h>
111 #include <sys/limits.h>
114 #ifndef _NO_NAMESPACE_POLLUTION
117 #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */
119 #define DEV_BSIZE (1<<DEV_BSHIFT)
121 #ifndef BLKDEV_IOSIZE
122 #define BLKDEV_IOSIZE PAGE_SIZE /* default block device I/O size */
125 #define DFLTPHYS (64 * 1024) /* default max raw I/O transfer size */
128 #define MAXPHYS (128 * 1024) /* max raw I/O transfer size */
131 #define MAXDUMPPGS (DFLTPHYS/PAGE_SIZE)
135 * Constants related to network buffer management.
136 * MCLBYTES must be no larger than PAGE_SIZE.
139 #define MSIZE 256 /* size of an mbuf */
143 #define MCLSHIFT 11 /* convert bytes to mbuf clusters */
144 #endif /* MCLSHIFT */
146 #define MCLBYTES (1 << MCLSHIFT) /* size of an mbuf cluster */
148 #define MJUMPAGESIZE PAGE_SIZE /* jumbo cluster 4k */
149 #define MJUM9BYTES (9 * 1024) /* jumbo cluster 9k */
150 #define MJUM16BYTES (16 * 1024) /* jumbo cluster 16k */
153 * Some macros for units conversion
156 /* clicks to bytes */
158 #define ctob(x) ((x)<<PAGE_SHIFT)
161 /* bytes to clicks */
163 #define btoc(x) (((vm_offset_t)(x)+PAGE_MASK)>>PAGE_SHIFT)
167 * btodb() is messy and perhaps slow because `bytes' may be an off_t. We
168 * want to shift an unsigned type to avoid sign extension and we don't
169 * want to widen `bytes' unnecessarily. Assume that the result fits in
173 #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \
174 (sizeof (bytes) > sizeof(long) \
175 ? (daddr_t)((unsigned long long)(bytes) >> DEV_BSHIFT) \
176 : (daddr_t)((unsigned long)(bytes) >> DEV_BSHIFT))
180 #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \
181 ((off_t)(db) << DEV_BSHIFT)
184 #endif /* _NO_NAMESPACE_POLLUTION */
186 #define PRIMASK 0x0ff
187 #define PCATCH 0x100 /* OR'd with pri for tsleep to check signals */
188 #define PDROP 0x200 /* OR'd with pri to stop re-entry of interlock mutex */
190 #define NZERO 0 /* default "nice" */
192 #define NBBY 8 /* number of bits in a byte */
193 #define NBPW sizeof(int) /* number of bytes per word (integer) */
195 #define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */
197 #define NODEV (dev_t)(-1) /* non-existent device */
199 #define CBLOCK 128 /* Clist block size, must be a power of 2. */
200 /* Data chars/clist. */
201 #define CBSIZE (CBLOCK - sizeof(struct cblock *))
202 #define CROUND (CBLOCK - 1) /* Clist rounding. */
205 * File system parameters and macros.
207 * MAXBSIZE - Filesystems are made out of blocks of at most MAXBSIZE bytes
208 * per block. MAXBSIZE may be made larger without effecting
209 * any existing filesystems as long as it does not exceed MAXPHYS,
210 * and may be made smaller at the risk of not being able to use
211 * filesystems which require a block size exceeding MAXBSIZE.
213 * BKVASIZE - Nominal buffer space per buffer, in bytes. BKVASIZE is the
214 * minimum KVM memory reservation the kernel is willing to make.
215 * Filesystems can of course request smaller chunks. Actual
216 * backing memory uses a chunk size of a page (PAGE_SIZE).
218 * If you make BKVASIZE too small you risk seriously fragmenting
219 * the buffer KVM map which may slow things down a bit. If you
220 * make it too big the kernel will not be able to optimally use
221 * the KVM memory reserved for the buffer cache and will wind
222 * up with too-few buffers.
224 * The default is 16384, roughly 2x the block size used by a
225 * normal UFS filesystem.
227 #define MAXBSIZE 65536 /* must be power of 2 */
228 #define BKVASIZE 16384 /* must be power of 2 */
229 #define BKVAMASK (BKVASIZE-1)
232 * MAXPATHLEN defines the longest permissible path length after expanding
233 * symbolic links. It is used to allocate a temporary buffer from the buffer
234 * pool in which to do the name expansion, hence should be a power of two,
235 * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the
236 * maximum number of symbolic links that may be expanded in a path name.
237 * It should be set high enough to allow all legitimate uses, but halt
238 * infinite loops reasonably quickly.
240 #define MAXPATHLEN PATH_MAX
241 #define MAXSYMLINKS 32
243 /* Bit map related macros. */
244 #define setbit(a,i) (((unsigned char *)(a))[(i)/NBBY] |= 1<<((i)%NBBY))
245 #define clrbit(a,i) (((unsigned char *)(a))[(i)/NBBY] &= ~(1<<((i)%NBBY)))
247 (((const unsigned char *)(a))[(i)/NBBY] & (1<<((i)%NBBY)))
249 ((((const unsigned char *)(a))[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
251 /* Macros for counting and rounding. */
253 #define howmany(x, y) (((x)+((y)-1))/(y))
255 #define rounddown(x, y) (((x)/(y))*(y))
256 #define roundup(x, y) ((((x)+((y)-1))/(y))*(y)) /* to any y */
257 #define roundup2(x, y) (((x)+((y)-1))&(~((y)-1))) /* if y is powers of two */
258 #define powerof2(x) ((((x)-1)&(x))==0)
260 /* Macros for min/max. */
261 #define MIN(a,b) (((a)<(b))?(a):(b))
262 #define MAX(a,b) (((a)>(b))?(a):(b))
266 * Basic byte order function prototypes for non-inline functions.
269 #ifndef _BYTEORDER_PROTOTYPED
270 #define _BYTEORDER_PROTOTYPED
272 __uint32_t htonl(__uint32_t);
273 __uint16_t htons(__uint16_t);
274 __uint32_t ntohl(__uint32_t);
275 __uint16_t ntohs(__uint16_t);
281 #ifndef _BYTEORDER_FUNC_DEFINED
282 #define _BYTEORDER_FUNC_DEFINED
283 #define htonl(x) __htonl(x)
284 #define htons(x) __htons(x)
285 #define ntohl(x) __ntohl(x)
286 #define ntohs(x) __ntohs(x)
287 #endif /* !_BYTEORDER_FUNC_DEFINED */
292 * Scale factor for scaled integers used to count %cpu time and load avgs.
294 * The number of CPU `tick's that map to a unique `%age' can be expressed
295 * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that
296 * can be calculated (assuming 32 bits) can be closely approximated using
297 * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).
299 * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',
300 * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.
302 #define FSHIFT 11 /* bits to right of fixed binary point */
303 #define FSCALE (1<<FSHIFT)
305 #define dbtoc(db) /* calculates devblks to pages */ \
306 ((db + (ctodb(1) - 1)) >> (PAGE_SHIFT - DEV_BSHIFT))
308 #define ctodb(db) /* calculates pages to devblks */ \
309 ((db) << (PAGE_SHIFT - DEV_BSHIFT))
312 * Given the pointer x to the member m of the struct s, return
313 * a pointer to the containing structure.
315 #define member2struct(s, m, x) \
316 ((struct s *)(void *)((char *)(x) - offsetof(struct s, m)))
318 #endif /* _SYS_PARAM_H_ */