1 /*- 2 * SPDX-License-Identifier: BSD-3-Clause 3 * 4 * Copyright (c) 1982, 1986, 1989, 1993 5 * The Regents of the University of California. All rights reserved. 6 * (c) UNIX System Laboratories, Inc. 7 * All or some portions of this file are derived from material licensed 8 * to the University of California by American Telephone and Telegraph 9 * Co. or Unix System Laboratories, Inc. and are reproduced herein with 10 * the permission of UNIX System Laboratories, Inc. 11 * 12 * Redistribution and use in source and binary forms, with or without 13 * modification, are permitted provided that the following conditions 14 * are met: 15 * 1. Redistributions of source code must retain the above copyright 16 * notice, this list of conditions and the following disclaimer. 17 * 2. Redistributions in binary form must reproduce the above copyright 18 * notice, this list of conditions and the following disclaimer in the 19 * documentation and/or other materials provided with the distribution. 20 * 3. Neither the name of the University nor the names of its contributors 21 * may be used to endorse or promote products derived from this software 22 * without specific prior written permission. 23 * 24 * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 25 * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 26 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 27 * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 28 * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 29 * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 30 * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 31 * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 32 * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 33 * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 34 * SUCH DAMAGE. 35 * 36 * @(#)param.h 8.3 (Berkeley) 4/4/95 37 * $FreeBSD$ 38 */ 39 40 #ifndef _SYS_PARAM_H_ 41 #define _SYS_PARAM_H_ 42 43 #include <sys/_null.h> 44 45 #define BSD 199506 /* System version (year & month). */ 46 #define BSD4_3 1 47 #define BSD4_4 1 48 49 /* 50 * __FreeBSD_version numbers are documented in the Porter's Handbook. 51 * If you bump the version for any reason, you should update the documentation 52 * there. 53 * Currently this lives here in the doc/ repository: 54 * 55 * head/en_US.ISO8859-1/books/porters-handbook/versions/chapter.xml 56 * 57 * scheme is: <major><two digit minor>Rxx 58 * 'R' is in the range 0 to 4 if this is a release branch or 59 * X.0-CURRENT before releng/X.0 is created, otherwise 'R' is 60 * in the range 5 to 9. 61 */ 62 #undef __FreeBSD_version 63 #define __FreeBSD_version 1300020 /* Master, propagated to newvers */ 64 65 /* 66 * __FreeBSD_kernel__ indicates that this system uses the kernel of FreeBSD, 67 * which by definition is always true on FreeBSD. This macro is also defined 68 * on other systems that use the kernel of FreeBSD, such as GNU/kFreeBSD. 69 * 70 * It is tempting to use this macro in userland code when we want to enable 71 * kernel-specific routines, and in fact it's fine to do this in code that 72 * is part of FreeBSD itself. However, be aware that as presence of this 73 * macro is still not widespread (e.g. older FreeBSD versions, 3rd party 74 * compilers, etc), it is STRONGLY DISCOURAGED to check for this macro in 75 * external applications without also checking for __FreeBSD__ as an 76 * alternative. 77 */ 78 #undef __FreeBSD_kernel__ 79 #define __FreeBSD_kernel__ 80 81 #if defined(_KERNEL) || defined(IN_RTLD) 82 #define P_OSREL_SIGWAIT 700000 83 #define P_OSREL_SIGSEGV 700004 84 #define P_OSREL_MAP_ANON 800104 85 #define P_OSREL_MAP_FSTRICT 1100036 86 #define P_OSREL_SHUTDOWN_ENOTCONN 1100077 87 #define P_OSREL_MAP_GUARD 1200035 88 #define P_OSREL_WRFSBASE 1200041 89 #define P_OSREL_CK_CYLGRP 1200046 90 #define P_OSREL_VMTOTAL64 1200054 91 #define P_OSREL_CK_SUPERBLOCK 1300000 92 #define P_OSREL_CK_INODE 1300005 93 94 #define P_OSREL_MAJOR(x) ((x) / 100000) 95 #endif 96 97 #ifndef LOCORE 98 #include <sys/types.h> 99 #endif 100 101 /* 102 * Machine-independent constants (some used in following include files). 103 * Redefined constants are from POSIX 1003.1 limits file. 104 * 105 * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>) 106 */ 107 #include <sys/syslimits.h> 108 109 #define MAXCOMLEN 19 /* max command name remembered */ 110 #define MAXINTERP PATH_MAX /* max interpreter file name length */ 111 #define MAXLOGNAME 33 /* max login name length (incl. NUL) */ 112 #define MAXUPRC CHILD_MAX /* max simultaneous processes */ 113 #define NCARGS ARG_MAX /* max bytes for an exec function */ 114 #define NGROUPS (NGROUPS_MAX+1) /* max number groups */ 115 #define NOFILE OPEN_MAX /* max open files per process */ 116 #define NOGROUP 65535 /* marker for empty group set member */ 117 #define MAXHOSTNAMELEN 256 /* max hostname size */ 118 #define SPECNAMELEN 255 /* max length of devicename */ 119 120 /* More types and definitions used throughout the kernel. */ 121 #ifdef _KERNEL 122 #include <sys/cdefs.h> 123 #include <sys/errno.h> 124 #ifndef LOCORE 125 #include <sys/time.h> 126 #include <sys/priority.h> 127 #endif 128 129 #ifndef FALSE 130 #define FALSE 0 131 #endif 132 #ifndef TRUE 133 #define TRUE 1 134 #endif 135 #endif 136 137 #ifndef _KERNEL 138 /* Signals. */ 139 #include <sys/signal.h> 140 #endif 141 142 /* Machine type dependent parameters. */ 143 #include <machine/param.h> 144 #ifndef _KERNEL 145 #include <sys/limits.h> 146 #endif 147 148 #ifndef DEV_BSHIFT 149 #define DEV_BSHIFT 9 /* log2(DEV_BSIZE) */ 150 #endif 151 #define DEV_BSIZE (1<<DEV_BSHIFT) 152 153 #ifndef BLKDEV_IOSIZE 154 #define BLKDEV_IOSIZE PAGE_SIZE /* default block device I/O size */ 155 #endif 156 #ifndef DFLTPHYS 157 #define DFLTPHYS (64 * 1024) /* default max raw I/O transfer size */ 158 #endif 159 #ifndef MAXPHYS 160 #define MAXPHYS (128 * 1024) /* max raw I/O transfer size */ 161 #endif 162 #ifndef MAXDUMPPGS 163 #define MAXDUMPPGS (DFLTPHYS/PAGE_SIZE) 164 #endif 165 166 /* 167 * Constants related to network buffer management. 168 * MCLBYTES must be no larger than PAGE_SIZE. 169 */ 170 #ifndef MSIZE 171 #define MSIZE 256 /* size of an mbuf */ 172 #endif 173 174 #ifndef MCLSHIFT 175 #define MCLSHIFT 11 /* convert bytes to mbuf clusters */ 176 #endif /* MCLSHIFT */ 177 178 #define MCLBYTES (1 << MCLSHIFT) /* size of an mbuf cluster */ 179 180 #if PAGE_SIZE < 2048 181 #define MJUMPAGESIZE MCLBYTES 182 #elif PAGE_SIZE <= 8192 183 #define MJUMPAGESIZE PAGE_SIZE 184 #else 185 #define MJUMPAGESIZE (8 * 1024) 186 #endif 187 188 #define MJUM9BYTES (9 * 1024) /* jumbo cluster 9k */ 189 #define MJUM16BYTES (16 * 1024) /* jumbo cluster 16k */ 190 191 /* 192 * Some macros for units conversion 193 */ 194 195 /* clicks to bytes */ 196 #ifndef ctob 197 #define ctob(x) ((x)<<PAGE_SHIFT) 198 #endif 199 200 /* bytes to clicks */ 201 #ifndef btoc 202 #define btoc(x) (((vm_offset_t)(x)+PAGE_MASK)>>PAGE_SHIFT) 203 #endif 204 205 /* 206 * btodb() is messy and perhaps slow because `bytes' may be an off_t. We 207 * want to shift an unsigned type to avoid sign extension and we don't 208 * want to widen `bytes' unnecessarily. Assume that the result fits in 209 * a daddr_t. 210 */ 211 #ifndef btodb 212 #define btodb(bytes) /* calculates (bytes / DEV_BSIZE) */ \ 213 (sizeof (bytes) > sizeof(long) \ 214 ? (daddr_t)((unsigned long long)(bytes) >> DEV_BSHIFT) \ 215 : (daddr_t)((unsigned long)(bytes) >> DEV_BSHIFT)) 216 #endif 217 218 #ifndef dbtob 219 #define dbtob(db) /* calculates (db * DEV_BSIZE) */ \ 220 ((off_t)(db) << DEV_BSHIFT) 221 #endif 222 223 #define PRIMASK 0x0ff 224 #define PCATCH 0x100 /* OR'd with pri for tsleep to check signals */ 225 #define PDROP 0x200 /* OR'd with pri to stop re-entry of interlock mutex */ 226 227 #define NZERO 0 /* default "nice" */ 228 229 #define NBBY 8 /* number of bits in a byte */ 230 #define NBPW sizeof(int) /* number of bytes per word (integer) */ 231 232 #define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */ 233 234 #define NODEV (dev_t)(-1) /* non-existent device */ 235 236 /* 237 * File system parameters and macros. 238 * 239 * MAXBSIZE - Filesystems are made out of blocks of at most MAXBSIZE bytes 240 * per block. MAXBSIZE may be made larger without effecting 241 * any existing filesystems as long as it does not exceed MAXPHYS, 242 * and may be made smaller at the risk of not being able to use 243 * filesystems which require a block size exceeding MAXBSIZE. 244 * 245 * MAXBCACHEBUF - Maximum size of a buffer in the buffer cache. This must 246 * be >= MAXBSIZE and can be set differently for different 247 * architectures by defining it in <machine/param.h>. 248 * Making this larger allows NFS to do larger reads/writes. 249 * 250 * BKVASIZE - Nominal buffer space per buffer, in bytes. BKVASIZE is the 251 * minimum KVM memory reservation the kernel is willing to make. 252 * Filesystems can of course request smaller chunks. Actual 253 * backing memory uses a chunk size of a page (PAGE_SIZE). 254 * The default value here can be overridden on a per-architecture 255 * basis by defining it in <machine/param.h>. 256 * 257 * If you make BKVASIZE too small you risk seriously fragmenting 258 * the buffer KVM map which may slow things down a bit. If you 259 * make it too big the kernel will not be able to optimally use 260 * the KVM memory reserved for the buffer cache and will wind 261 * up with too-few buffers. 262 * 263 * The default is 16384, roughly 2x the block size used by a 264 * normal UFS filesystem. 265 */ 266 #define MAXBSIZE 65536 /* must be power of 2 */ 267 #ifndef MAXBCACHEBUF 268 #define MAXBCACHEBUF MAXBSIZE /* must be a power of 2 >= MAXBSIZE */ 269 #endif 270 #ifndef BKVASIZE 271 #define BKVASIZE 16384 /* must be power of 2 */ 272 #endif 273 #define BKVAMASK (BKVASIZE-1) 274 275 /* 276 * MAXPATHLEN defines the longest permissible path length after expanding 277 * symbolic links. It is used to allocate a temporary buffer from the buffer 278 * pool in which to do the name expansion, hence should be a power of two, 279 * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the 280 * maximum number of symbolic links that may be expanded in a path name. 281 * It should be set high enough to allow all legitimate uses, but halt 282 * infinite loops reasonably quickly. 283 */ 284 #define MAXPATHLEN PATH_MAX 285 #define MAXSYMLINKS 32 286 287 /* Bit map related macros. */ 288 #define setbit(a,i) (((unsigned char *)(a))[(i)/NBBY] |= 1<<((i)%NBBY)) 289 #define clrbit(a,i) (((unsigned char *)(a))[(i)/NBBY] &= ~(1<<((i)%NBBY))) 290 #define isset(a,i) \ 291 (((const unsigned char *)(a))[(i)/NBBY] & (1<<((i)%NBBY))) 292 #define isclr(a,i) \ 293 ((((const unsigned char *)(a))[(i)/NBBY] & (1<<((i)%NBBY))) == 0) 294 295 /* Macros for counting and rounding. */ 296 #ifndef howmany 297 #define howmany(x, y) (((x)+((y)-1))/(y)) 298 #endif 299 #define nitems(x) (sizeof((x)) / sizeof((x)[0])) 300 #define rounddown(x, y) (((x)/(y))*(y)) 301 #define rounddown2(x, y) ((x)&(~((y)-1))) /* if y is power of two */ 302 #define roundup(x, y) ((((x)+((y)-1))/(y))*(y)) /* to any y */ 303 #define roundup2(x, y) (((x)+((y)-1))&(~((y)-1))) /* if y is powers of two */ 304 #define powerof2(x) ((((x)-1)&(x))==0) 305 306 /* Macros for min/max. */ 307 #define MIN(a,b) (((a)<(b))?(a):(b)) 308 #define MAX(a,b) (((a)>(b))?(a):(b)) 309 310 #ifdef _KERNEL 311 /* 312 * Basic byte order function prototypes for non-inline functions. 313 */ 314 #ifndef LOCORE 315 #ifndef _BYTEORDER_PROTOTYPED 316 #define _BYTEORDER_PROTOTYPED 317 __BEGIN_DECLS 318 __uint32_t htonl(__uint32_t); 319 __uint16_t htons(__uint16_t); 320 __uint32_t ntohl(__uint32_t); 321 __uint16_t ntohs(__uint16_t); 322 __END_DECLS 323 #endif 324 #endif 325 326 #ifndef _BYTEORDER_FUNC_DEFINED 327 #define _BYTEORDER_FUNC_DEFINED 328 #define htonl(x) __htonl(x) 329 #define htons(x) __htons(x) 330 #define ntohl(x) __ntohl(x) 331 #define ntohs(x) __ntohs(x) 332 #endif /* !_BYTEORDER_FUNC_DEFINED */ 333 #endif /* _KERNEL */ 334 335 /* 336 * Scale factor for scaled integers used to count %cpu time and load avgs. 337 * 338 * The number of CPU `tick's that map to a unique `%age' can be expressed 339 * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that 340 * can be calculated (assuming 32 bits) can be closely approximated using 341 * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15). 342 * 343 * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age', 344 * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024. 345 */ 346 #define FSHIFT 11 /* bits to right of fixed binary point */ 347 #define FSCALE (1<<FSHIFT) 348 349 #define dbtoc(db) /* calculates devblks to pages */ \ 350 ((db + (ctodb(1) - 1)) >> (PAGE_SHIFT - DEV_BSHIFT)) 351 352 #define ctodb(db) /* calculates pages to devblks */ \ 353 ((db) << (PAGE_SHIFT - DEV_BSHIFT)) 354 355 /* 356 * Old spelling of __containerof(). 357 */ 358 #define member2struct(s, m, x) \ 359 ((struct s *)(void *)((char *)(x) - offsetof(struct s, m))) 360 361 /* 362 * Access a variable length array that has been declared as a fixed 363 * length array. 364 */ 365 #define __PAST_END(array, offset) (((__typeof__(*(array)) *)(array))[offset]) 366 367 #endif /* _SYS_PARAM_H_ */ 368