| 1 | /*␊ |
| 2 | * Copyright (c) 2000 Apple Computer, Inc. All rights reserved.␊ |
| 3 | *␊ |
| 4 | * @APPLE_OSREFERENCE_LICENSE_HEADER_START@␊ |
| 5 | * ␊ |
| 6 | * This file contains Original Code and/or Modifications of Original Code␊ |
| 7 | * as defined in and that are subject to the Apple Public Source License␊ |
| 8 | * Version 2.0 (the 'License'). You may not use this file except in␊ |
| 9 | * compliance with the License. The rights granted to you under the License␊ |
| 10 | * may not be used to create, or enable the creation or redistribution of,␊ |
| 11 | * unlawful or unlicensed copies of an Apple operating system, or to␊ |
| 12 | * circumvent, violate, or enable the circumvention or violation of, any␊ |
| 13 | * terms of an Apple operating system software license agreement.␊ |
| 14 | * ␊ |
| 15 | * Please obtain a copy of the License at␊ |
| 16 | * http://www.opensource.apple.com/apsl/ and read it before using this file.␊ |
| 17 | * ␊ |
| 18 | * The Original Code and all software distributed under the License are␊ |
| 19 | * distributed on an 'AS IS' basis, WITHOUT WARRANTY OF ANY KIND, EITHER␊ |
| 20 | * EXPRESS OR IMPLIED, AND APPLE HEREBY DISCLAIMS ALL SUCH WARRANTIES,␊ |
| 21 | * INCLUDING WITHOUT LIMITATION, ANY WARRANTIES OF MERCHANTABILITY,␊ |
| 22 | * FITNESS FOR A PARTICULAR PURPOSE, QUIET ENJOYMENT OR NON-INFRINGEMENT.␊ |
| 23 | * Please see the License for the specific language governing rights and␊ |
| 24 | * limitations under the License.␊ |
| 25 | * ␊ |
| 26 | * @APPLE_OSREFERENCE_LICENSE_HEADER_END@␊ |
| 27 | */␊ |
| 28 | /* Copyright (c) 1995, 1997 Apple Computer, Inc. All Rights Reserved */␊ |
| 29 | /*-␊ |
| 30 | * Copyright (c) 1982, 1986, 1989, 1993␊ |
| 31 | *␉The Regents of the University of California. All rights reserved.␊ |
| 32 | * (c) UNIX System Laboratories, Inc.␊ |
| 33 | * All or some portions of this file are derived from material licensed␊ |
| 34 | * to the University of California by American Telephone and Telegraph␊ |
| 35 | * Co. or Unix System Laboratories, Inc. and are reproduced herein with␊ |
| 36 | * the permission of UNIX System Laboratories, Inc.␊ |
| 37 | *␊ |
| 38 | * Redistribution and use in source and binary forms, with or without␊ |
| 39 | * modification, are permitted provided that the following conditions␊ |
| 40 | * are met:␊ |
| 41 | * 1. Redistributions of source code must retain the above copyright␊ |
| 42 | * notice, this list of conditions and the following disclaimer.␊ |
| 43 | * 2. Redistributions in binary form must reproduce the above copyright␊ |
| 44 | * notice, this list of conditions and the following disclaimer in the␊ |
| 45 | * documentation and/or other materials provided with the distribution.␊ |
| 46 | * 3. All advertising materials mentioning features or use of this software␊ |
| 47 | * must display the following acknowledgement:␊ |
| 48 | *␉This product includes software developed by the University of␊ |
| 49 | *␉California, Berkeley and its contributors.␊ |
| 50 | * 4. Neither the name of the University nor the names of its contributors␊ |
| 51 | * may be used to endorse or promote products derived from this software␊ |
| 52 | * without specific prior written permission.␊ |
| 53 | *␊ |
| 54 | * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND␊ |
| 55 | * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE␊ |
| 56 | * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE␊ |
| 57 | * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE␊ |
| 58 | * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL␊ |
| 59 | * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS␊ |
| 60 | * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)␊ |
| 61 | * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT␊ |
| 62 | * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY␊ |
| 63 | * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF␊ |
| 64 | * SUCH DAMAGE.␊ |
| 65 | *␊ |
| 66 | *␉@(#)param.h␉8.3 (Berkeley) 4/4/95␊ |
| 67 | */␊ |
| 68 | ␊ |
| 69 | #ifndef␉_SYS_PARAM_H_␊ |
| 70 | #define _SYS_PARAM_H_␊ |
| 71 | ␊ |
| 72 | #define␉BSD␉199506␉␉/* System version (year & month). */␊ |
| 73 | #define BSD4_3␉1␊ |
| 74 | #define BSD4_4␉1␊ |
| 75 | ␊ |
| 76 | #define NeXTBSD␉1995064␉␉/* NeXTBSD version (year, month, release) */␊ |
| 77 | #define NeXTBSD4_0 0␉␉/* NeXTBSD 4.0 */␊ |
| 78 | ␊ |
| 79 | #include <sys/_types.h>␊ |
| 80 | ␊ |
| 81 | #ifndef NULL␊ |
| 82 | #define␉NULL␉__DARWIN_NULL␊ |
| 83 | #endif /* ! NULL */␊ |
| 84 | ␊ |
| 85 | #ifndef LOCORE␊ |
| 86 | #include <sys/types.h>␊ |
| 87 | #endif␊ |
| 88 | ␊ |
| 89 | /*␊ |
| 90 | * Machine-independent constants (some used in following include files).␊ |
| 91 | * Redefined constants are from POSIX 1003.1 limits file.␊ |
| 92 | *␊ |
| 93 | * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>)␊ |
| 94 | * MAXLOGNAME should be >= UT_NAMESIZE (see <utmp.h>)␊ |
| 95 | */␊ |
| 96 | #include <sys/syslimits.h>␊ |
| 97 | ␊ |
| 98 | #define␉MAXCOMLEN␉16␉␉/* max command name remembered */␊ |
| 99 | #define␉MAXINTERP␉64␉␉/* max interpreter file name length */␊ |
| 100 | #define␉MAXLOGNAME␉255␉␉/* max login name length */␊ |
| 101 | #define␉MAXUPRC␉␉CHILD_MAX␉/* max simultaneous processes */␊ |
| 102 | #define␉NCARGS␉␉ARG_MAX␉␉/* max bytes for an exec function */␊ |
| 103 | #define␉NGROUPS␉␉NGROUPS_MAX␉/* max number groups */␊ |
| 104 | #define␉NOFILE␉␉256␉␉/* default max open files per process */␊ |
| 105 | #define␉NOGROUP␉␉65535␉␉/* marker for empty group set member */␊ |
| 106 | #define MAXHOSTNAMELEN␉256␉␉/* max hostname size */␊ |
| 107 | #define MAXDOMNAMELEN␉256␉␉/* maximum domain name length */␊ |
| 108 | ␊ |
| 109 | /* Machine type dependent parameters. */␊ |
| 110 | #include <machine/param.h>␊ |
| 111 | ␊ |
| 112 | /* More types and definitions used throughout the kernel. */␊ |
| 113 | #include <limits.h>␊ |
| 114 | ␊ |
| 115 | /* Signals. */␊ |
| 116 | #include <sys/signal.h>␊ |
| 117 | ␊ |
| 118 | /*␊ |
| 119 | * Priorities. Note that with 32 run queues, differences less than 4 are␊ |
| 120 | * insignificant.␊ |
| 121 | */␊ |
| 122 | #define␉PSWP␉0␊ |
| 123 | #define␉PVM␉4␊ |
| 124 | #define␉PINOD␉8␊ |
| 125 | #define␉PRIBIO␉16␊ |
| 126 | #define␉PVFS␉20␊ |
| 127 | #define␉PZERO␉22␉␉/* No longer magic, shouldn't be here. XXX */␊ |
| 128 | #define␉PSOCK␉24␊ |
| 129 | #define␉PWAIT␉32␊ |
| 130 | #define␉PLOCK␉36␊ |
| 131 | #define␉PPAUSE␉40␊ |
| 132 | #define␉PUSER␉50␊ |
| 133 | #define␉MAXPRI␉127␉␉/* Priorities range from 0 through MAXPRI. */␊ |
| 134 | ␊ |
| 135 | #define␉PRIMASK␉0x0ff␊ |
| 136 | #define␉PCATCH␉0x100␉␉/* OR'd with pri for tsleep to check signals */␊ |
| 137 | #define PTTYBLOCK 0x200␉␉/* for tty SIGTTOU and SIGTTIN blocking */␊ |
| 138 | #define PDROP␉0x400␉␉/* OR'd with pri to stop re-aquistion of mutex upon wakeup */␊ |
| 139 | #define PSPIN␉0x800␉␉/* OR'd with pri to require mutex in spin mode upon wakeup */␊ |
| 140 | ␊ |
| 141 | #define␉NBPW␉sizeof(int)␉/* number of bytes per word (integer) */␊ |
| 142 | ␊ |
| 143 | #define␉CMASK␉022␉␉/* default file mask: S_IWGRP|S_IWOTH */␊ |
| 144 | #define␉NODEV␉(dev_t)(-1)␉/* non-existent device */␊ |
| 145 | ␊ |
| 146 | /*␊ |
| 147 | * Clustering of hardware pages on machines with ridiculously small␊ |
| 148 | * page sizes is done here. The paging subsystem deals with units of␊ |
| 149 | * CLSIZE pte's describing NBPG (from machine/param.h) pages each.␊ |
| 150 | */␊ |
| 151 | #define␉CLBYTES␉␉(CLSIZE*NBPG)␊ |
| 152 | #define␉CLOFSET␉␉(CLSIZE*NBPG-1)␉/* for clusters, like PGOFSET */␊ |
| 153 | #define␉claligned(x)␉((((int)(x))&CLOFSET)==0)␊ |
| 154 | #define␉CLOFF␉␉CLOFSET␊ |
| 155 | #define␉CLSHIFT␉␉(PGSHIFT+CLSIZELOG2)␊ |
| 156 | ␊ |
| 157 | #if CLSIZE==1␊ |
| 158 | #define␉clbase(i)␉(i)␊ |
| 159 | #define␉clrnd(i)␉(i)␊ |
| 160 | #else␊ |
| 161 | /* Give the base virtual address (first of CLSIZE). */␊ |
| 162 | #define␉clbase(i)␉((i) &~ (CLSIZE-1))␊ |
| 163 | /* Round a number of clicks up to a whole cluster. */␊ |
| 164 | #define␉clrnd(i)␉(((i) + (CLSIZE-1)) &~ (CLSIZE-1))␊ |
| 165 | #endif␊ |
| 166 | ␊ |
| 167 | #define␉CBLOCK␉64␉␉/* Clist block size, must be a power of 2. */␊ |
| 168 | #define CBQSIZE␉(CBLOCK/NBBY)␉/* Quote bytes/cblock - can do better. */␊ |
| 169 | ␉␉␉␉/* Data chars/clist. */␊ |
| 170 | #define␉CBSIZE␉(CBLOCK - sizeof(struct cblock *) - CBQSIZE)␊ |
| 171 | #define␉CROUND␉(CBLOCK - 1)␉/* Clist rounding. */␊ |
| 172 | ␊ |
| 173 | /*␊ |
| 174 | * File system parameters and macros.␊ |
| 175 | *␊ |
| 176 | * The file system is made out of blocks of at most MAXPHYS units, with␊ |
| 177 | * smaller units (fragments) only in the last direct block. MAXBSIZE␊ |
| 178 | * primarily determines the size of buffers in the buffer pool. It may be␊ |
| 179 | * made larger than MAXPHYS without any effect on existing file systems;␊ |
| 180 | * however making it smaller may make some file systems unmountable.␊ |
| 181 | * We set this to track the value of (MAX_UPL_TRANSFER*PAGE_SIZE) from␊ |
| 182 | * osfmk/mach/memory_object_types.h to bound it at the maximum UPL size.␊ |
| 183 | */␊ |
| 184 | #define␉MAXBSIZE␉(256 * 4096)␊ |
| 185 | #define MAXPHYSIO␉MAXPHYS␊ |
| 186 | #define MAXFRAG ␉8␊ |
| 187 | ␊ |
| 188 | #define␉MAXPHYSIO_WIRED␉(16 * 1024 * 1024)␊ |
| 189 | ␊ |
| 190 | /*␊ |
| 191 | * MAXPATHLEN defines the longest permissable path length after expanding␊ |
| 192 | * symbolic links. It is used to allocate a temporary buffer from the buffer␊ |
| 193 | * pool in which to do the name expansion, hence should be a power of two,␊ |
| 194 | * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the␊ |
| 195 | * maximum number of symbolic links that may be expanded in a path name.␊ |
| 196 | * It should be set high enough to allow all legitimate uses, but halt␊ |
| 197 | * infinite loops reasonably quickly.␊ |
| 198 | */␊ |
| 199 | #define␉MAXPATHLEN␉PATH_MAX␊ |
| 200 | #define MAXSYMLINKS␉32␊ |
| 201 | ␊ |
| 202 | /* Bit map related macros. */␊ |
| 203 | #define␉setbit(a,i)␉(((char *)(a))[(i)/NBBY] |= 1<<((i)%NBBY))␊ |
| 204 | #define␉clrbit(a,i)␉(((char *)(a))[(i)/NBBY] &= ~(1<<((i)%NBBY)))␊ |
| 205 | #define␉isset(a,i)␉(((char *)(a))[(i)/NBBY] & (1<<((i)%NBBY)))␊ |
| 206 | #define␉isclr(a,i)␉((((char *)(a))[(i)/NBBY] & (1<<((i)%NBBY))) == 0)␊ |
| 207 | ␊ |
| 208 | /* Macros for counting and rounding. */␊ |
| 209 | #ifndef howmany␊ |
| 210 | #define␉howmany(x, y)␉((((x) % (y)) == 0) ? ((x) / (y)) : (((x) / (y)) + 1))␊ |
| 211 | #endif␊ |
| 212 | #define␉roundup(x, y)␉((((x)+((y)-1))/(y))*(y))␊ |
| 213 | #define powerof2(x)␉((((x)-1)&(x))==0)␊ |
| 214 | ␊ |
| 215 | /* Macros for min/max. */␊ |
| 216 | #ifndef MIN␊ |
| 217 | #define␉MIN(a,b) (((a)<(b))?(a):(b))␊ |
| 218 | #endif /* MIN */␊ |
| 219 | #ifndef MAX␊ |
| 220 | #define␉MAX(a,b) (((a)>(b))?(a):(b))␊ |
| 221 | #endif␉/* MAX */␊ |
| 222 | ␊ |
| 223 | /*␊ |
| 224 | * Constants for setting the parameters of the kernel memory allocator.␊ |
| 225 | *␊ |
| 226 | * 2 ** MINBUCKET is the smallest unit of memory that will be␊ |
| 227 | * allocated. It must be at least large enough to hold a pointer.␊ |
| 228 | *␊ |
| 229 | * Units of memory less or equal to MAXALLOCSAVE will permanently␊ |
| 230 | * allocate physical memory; requests for these size pieces of␊ |
| 231 | * memory are quite fast. Allocations greater than MAXALLOCSAVE must␊ |
| 232 | * always allocate and free physical memory; requests for these␊ |
| 233 | * size allocations should be done infrequently as they will be slow.␊ |
| 234 | *␊ |
| 235 | * Constraints: CLBYTES <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14), and␊ |
| 236 | * MAXALLOCSIZE must be a power of two.␊ |
| 237 | */␊ |
| 238 | #define MINBUCKET␉4␉␉/* 4 => min allocation of 16 bytes */␊ |
| 239 | #define MAXALLOCSAVE␉(2 * CLBYTES)␊ |
| 240 | ␊ |
| 241 | /*␊ |
| 242 | * Scale factor for scaled integers used to count %cpu time and load avgs.␊ |
| 243 | *␊ |
| 244 | * The number of CPU `tick's that map to a unique `%age' can be expressed␊ |
| 245 | * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that␊ |
| 246 | * can be calculated (assuming 32 bits) can be closely approximated using␊ |
| 247 | * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).␊ |
| 248 | *␊ |
| 249 | * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',␊ |
| 250 | * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.␊ |
| 251 | */␊ |
| 252 | #define␉FSHIFT␉11␉␉/* bits to right of fixed binary point */␊ |
| 253 | #define FSCALE␉(1<<FSHIFT)␊ |
| 254 | ␊ |
| 255 | #endif␉/* _SYS_PARAM_H_ */␊ |
| 256 | |
