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.53 2008/11/11 00:55:49 pavalos Exp $
46 #define BSD 200708 /* XXX kern.osrevision */
47 #define BSD4_3 1 /* XXX obsolete */
48 #define BSD4_4 1 /* XXX obsolete */
51 * __DragonFly_version number. The number doesn't really meaningfully
52 * translate to a version number.
54 * 170000 - base development version after 1.6 branch
55 * 170001 - base development version before 1.8 branch
56 * 190000 - base development version after 1.8 branch
57 * 195000 - base development version after 1.10 branch
58 * 197500 - base development version before 1.12 branch
59 * 197600 - 1.12 branch
60 * 197700 - base development version after 1.12 branch
61 * 199900 - base development version before 2.0 branch
63 * 200100 - base development version after 2.0 branch
64 * 200101 - lchflags syscall
66 * 200201 - base development version after 2.2 branch
67 * 200202 - major changes to libc
68 * 200203 - introduce PCI domain
69 * 200204 - suser() & suser_cred() removal
70 * 200205 - devfs import
71 * 200206 - *sleep() renames
72 * 200400 - 2.4 release
74 * 200600 - 2.6 release
76 * 200800 - 2.8 release October 2010
78 * 200901 - prototype changes for alphasort(3) and scandir(3)
79 * 200902 - Xerox NS protocol removal
80 * 201000 - 2.10 release
81 * 201100 - 2.11 master
82 * 201200 - 2.12 release
83 * 201300 - 2.13 master
85 #undef __DragonFly_version
86 #define __DragonFly_version 201300 /* propagated to newvers */
88 #include <sys/_null.h>
91 #include <sys/types.h>
95 * Machine-independent constants (some used in following include files).
96 * Redefined constants are from POSIX 1003.1 limits file.
98 * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>)
99 * MAXLOGNAME should be == UT_NAMESIZE+1 (see <utmp.h>)
101 #include <sys/syslimits.h>
103 #define MAXCOMLEN 16 /* max command name remembered */
104 #define MAXINTERP 32 /* max interpreter file name length */
105 #define MAXLOGNAME 17 /* max login name length (incl. NUL) */
106 #define MAXUPRC CHILD_MAX /* max simultaneous processes */
107 #define NCARGS ARG_MAX /* max bytes for an exec function */
108 #define NGROUPS NGROUPS_MAX /* max number groups */
109 #define NOFILE OPEN_MAX /* max open files per process */
110 #define NOGROUP 65535 /* marker for empty group set member */
111 #define MAXHOSTNAMELEN 256 /* max hostname size */
113 /* More types and definitions used throughout the kernel. */
115 #include <sys/cdefs.h>
116 #include <sys/errno.h>
117 #include <sys/time.h>
125 #include <sys/select.h>
126 #include <sys/signal.h>
129 /* Machine type dependent parameters. */
130 #include <machine/param.h>
132 #include <machine/limits.h>
135 #define PCATCH 0x00000100 /* tsleep checks signals */
136 #define PUSRFLAG1 0x00000200 /* Subsystem specific flag */
137 #define PINTERLOCKED 0x00000400 /* Interlocked tsleep */
138 #define PWAKEUP_CPUMASK 0x00003FFF /* start cpu for chained wakeups */
139 #define PWAKEUP_MYCPU 0x00004000 /* wakeup on current cpu only */
140 #define PWAKEUP_ONE 0x00008000 /* argument to wakeup: only one */
141 #define PDOMAIN_MASK 0xFFFF0000 /* address domains for wakeup */
142 #define PDOMAIN_UMTX 0x00010000 /* independant domain for UMTX */
143 #define PDOMAIN_XLOCK 0x00020000 /* independant domain for fifo_lock */
144 #define PWAKEUP_ENCODE(domain, cpu) ((domain) | (cpu))
145 #define PWAKEUP_DECODE(domain) ((domain) & PWAKEUP_CPUMASK)
147 #define NZERO 0 /* default "nice" */
149 #define NBPW sizeof(int) /* number of bytes per word (integer) */
151 #define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */
152 #if defined(_KERNEL) || defined(_KERNEL_STRUCTURES)
153 #define NOUDEV (udev_t)(-1) /* non-existent device */
154 #define NOMAJ 256 /* non-existent device */
158 #define NODEV (dev_t)(-1) /* non-existent device */
162 * cpu_mi_feature bits
164 #define CPU_MI_BZERONT 0x00000001
165 #define CPU_MI_MONITOR 0x00000010
168 * File system parameters and macros.
170 * MAXBSIZE - Filesystems are made out of blocks of at most MAXBSIZE bytes
171 * per block. MAXBSIZE may be made larger without effecting
172 * any existing filesystems as long as it does not exceed MAXPHYS,
173 * and may be made smaller at the risk of not being able to use
174 * filesystems which require a block size exceeding MAXBSIZE.
176 * BKVASIZE - Nominal buffer space per buffer, in bytes. BKVASIZE is the
177 * minimum KVM memory reservation the kernel is willing to make.
178 * Filesystems can of course request smaller chunks. Actual
179 * backing memory uses a chunk size of a page (PAGE_SIZE).
181 * If you make BKVASIZE too small you risk seriously fragmenting
182 * the buffer KVM map which may slow things down a bit. If you
183 * make it too big the kernel will not be able to optimally use
184 * the KVM memory reserved for the buffer cache and will wind
185 * up with too-few buffers.
187 * The default is 16384, roughly 2x the block size used by a
188 * normal UFS filesystem.
190 #define MAXBSIZE 65536 /* must be power of 2 */
191 #define BKVASIZE 16384 /* must be power of 2 */
192 #define BKVAMASK (BKVASIZE-1)
196 * MAXPATHLEN defines the longest permissible path length after expanding
197 * symbolic links. It is used to allocate a temporary buffer from the buffer
198 * pool in which to do the name expansion, hence should be a power of two,
199 * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the
200 * maximum number of symbolic links that may be expanded in a path name.
201 * It should be set high enough to allow all legitimate uses, but halt
202 * infinite loops reasonably quickly.
204 #define MAXPATHLEN PATH_MAX
205 #define MAXSYMLINKS 32
207 /* Bit map related macros. */
208 #define setbit(a,i) ((a)[(i)/NBBY] |= 1<<((i)%NBBY))
209 #define clrbit(a,i) ((a)[(i)/NBBY] &= ~(1<<((i)%NBBY)))
210 #define isset(a,i) ((a)[(i)/NBBY] & (1<<((i)%NBBY)))
211 #define isclr(a,i) (((a)[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
213 /* Macros for counting and rounding. */
215 #define howmany(x, y) (((x)+((y)-1))/(y))
217 #define rounddown(x, y) (((x)/(y))*(y))
218 #define rounddown2(x, y) ((x) & ~((y) - 1)) /* y power of two */
219 #define roundup(x, y) ((((x)+((y)-1))/(y))*(y)) /* to any y */
220 #define roundup2(x, y) (((x)+((y)-1))&(~((y)-1))) /* if y is powers of two */
221 #define powerof2(x) ((((x)-1)&(x))==0)
224 * VM objects can be larger than the virtual address space, make sure
225 * we don't cut-off the mask.
227 #define trunc_page64(x) ((x) & ~(int64_t)PAGE_MASK)
228 #define round_page64(x) (((x) + PAGE_MASK) & ~(int64_t)PAGE_MASK)
230 /* Macros for min/max. */
231 #define MIN(a,b) (((a)<(b))?(a):(b))
232 #define MAX(a,b) (((a)>(b))?(a):(b))
234 /* Macro for array size */
235 #define NELEM(ary) (sizeof(ary) / sizeof((ary)[0]))
238 * Constants for setting the parameters of the kernel memory allocator.
240 * 2 ** MINBUCKET is the smallest unit of memory that will be
241 * allocated. It must be at least large enough to hold a pointer.
243 * Units of memory less or equal to MAXALLOCSAVE will permanently
244 * allocate physical memory; requests for these size pieces of
245 * memory are quite fast. Allocations greater than MAXALLOCSAVE must
246 * always allocate and free physical memory; requests for these
247 * size allocations should be done infrequently as they will be slow.
249 * Constraints: PAGE_SIZE <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14), and
250 * MAXALLOCSIZE must be a power of two.
252 #define MINBUCKET 4 /* 4 => min allocation of 16 bytes */
253 #define MAXALLOCSAVE (2 * PAGE_SIZE)
256 * Scale factor for scaled integers used to count %cpu time and load avgs.
258 * The number of CPU `tick's that map to a unique `%age' can be expressed
259 * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that
260 * can be calculated (assuming 32 bits) can be closely approximated using
261 * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).
263 * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',
264 * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.
266 #define FSHIFT 11 /* bits to right of fixed binary point */
267 #define FSCALE (1<<FSHIFT)
269 #define dbtoc(db) /* calculates devblks to pages */ \
270 ((db + (ctodb(1) - 1)) >> (PAGE_SHIFT - DEV_BSHIFT))
272 #define ctodb(db) /* calculates pages to devblks */ \
273 ((db) << (PAGE_SHIFT - DEV_BSHIFT))
275 #define MJUMPAGESIZE PAGE_SIZE /* jumbo cluster 4k */
276 #define MJUM9BYTES (9 * 1024) /* jumbo cluster 9k */
277 #define MJUM16BYTES (16 * 1024) /* jumbo cluster 16k */
282 * Because many drivers can't deal with multiple DMA segments all mbufs
283 * must avoid crossing a page boundary. While we can accomodate mbufs
284 * which are not a power-of-2 sized kmalloc() will only guarantee
285 * non-crossing alignment if we use a power-of-2. 256 is no longer large
286 * enough due to m_hdr and m_pkthdr bloat.
288 * MCLBYTES must be a power of 2 and is typically significantly larger
289 * than MSIZE, sufficient to hold a standard-mtu packet. 2K is considered
293 #define MSIZE 512 /* size of an mbuf */
297 #define MCLSHIFT 11 /* convert bytes to m_buf clusters */
299 #define MCLBYTES (1 << MCLSHIFT) /* size of an m_buf cluster */
300 #define MCLOFSET (MCLBYTES - 1) /* offset within an m_buf cluster */
303 * Make this available for most of the kernel. There were too many
304 * things that included sys/systm.h just for panic().
307 void panic (const char *, ...) __dead2 __printflike(1, 2);
311 #define htonl(x) __htonl(x)
314 #define htons(x) __htons(x)
317 #define ntohl(x) __ntohl(x)
320 #define ntohs(x) __ntohs(x)
323 #endif /* _SYS_PARAM_H_ */