![[BACK]](/cvsweb/icons/back.gif){kind=icon}
Return to param.h CVS log ![[TXT]](/cvsweb/icons/text.gif){kind=icon}
![[DIR]](/cvsweb/icons/dir.gif){kind=icon}
Up to [Net/2] / Net2 / sys|
Return to param.h CVS log | Up to [Net/2] / Net2 / sys |
1.1 root 1: /*-
2: * Copyright (c) 1982, 1986, 1989 The Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms, with or without
6: * modification, are permitted provided that the following conditions
7: * are met:
8: * 1. Redistributions of source code must retain the above copyright
9: * notice, this list of conditions and the following disclaimer.
10: * 2. Redistributions in binary form must reproduce the above copyright
11: * notice, this list of conditions and the following disclaimer in the
12: * documentation and/or other materials provided with the distribution.
13: * 3. All advertising materials mentioning features or use of this software
14: * must display the following acknowledgement:
15: * This product includes software developed by the University of
16: * California, Berkeley and its contributors.
17: * 4. Neither the name of the University nor the names of its contributors
18: * may be used to endorse or promote products derived from this software
19: * without specific prior written permission.
20: *
21: * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
22: * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
23: * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
24: * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
25: * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
26: * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
27: * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
28: * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
29: * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
30: * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
31: * SUCH DAMAGE.
32: *
33: * @(#)param.h 7.23 (Berkeley) 5/6/91
34: */
35:
1.1.1.2 ! root 36: #define __386BSDREL__ 0.1 /* Release 0.1 */
! 37: #define BSD 199103 /* CSRG: March, 1991 system version (year & month) */
1.1 root 38: #define BSD4_3 1
39: #define BSD4_4 0.5
40:
41: #ifndef NULL
42: #define NULL 0
43: #endif
44:
45: #ifndef LOCORE
46: #include <sys/types.h>
47: #endif
48:
49: /*
50: * Machine-independent constants (some used in following include files).
51: * Redefined constants are from POSIX 1003.1 limits file.
52: *
53: * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>)
54: * MAXLOGNAME should be >= UT_NAMESIZE (see <utmp.h>)
55: */
56: #include <sys/syslimits.h>
57:
58: #define MAXCOMLEN 16 /* max command name remembered */
59: #define MAXINTERP 32 /* max interpreter file name length */
60: #define MAXLOGNAME 12 /* max login name length */
61: #define MAXUPRC CHILD_MAX /* max simultaneous processes */
62: #define NCARGS ARG_MAX /* max bytes for an exec function */
63: #define NGROUPS NGROUPS_MAX /* max number groups */
64: #define NOFILE OPEN_MAX /* max open files per process */
65: #define NOGROUP 65535 /* marker for empty group set member */
66: #define MAXHOSTNAMELEN 256 /* max hostname size */
67:
68: /* More types and definitions used throughout the kernel. */
69: #ifdef KERNEL
70: #include <sys/cdefs.h>
71: #include <sys/errno.h>
72: #include <sys/time.h>
73: #include <sys/resource.h>
74: #include <sys/ucred.h>
75: #include <sys/uio.h>
76: #endif
77:
78: /* Signals. */
79: #include <sys/signal.h>
80:
81: /* Machine type dependent parameters. */
82: #include <machine/param.h>
83: #include <machine/endian.h>
84: #include <machine/limits.h>
85:
86: /*
87: * Priorities. Note that with 32 run queues, differences less than 4 are
88: * insignificant.
89: */
90: #define PSWP 0
91: #define PVM 4
92: #define PINOD 8
93: #define PRIBIO 16
94: #define PVFS 20
95: #define PZERO 22 /* No longer magic, shouldn't be here. XXX */
96: #define PSOCK 24
97: #define PWAIT 32
98: #define PLOCK 36
99: #define PPAUSE 40
100: #define PUSER 50
101: #define MAXPRI 127 /* Priorities range from 0 through MAXPRI. */
102:
103: #define PRIMASK 0x0ff
104: #define PCATCH 0x100 /* OR'd with pri for tsleep to check signals */
105:
106: #define NZERO 0 /* default "nice" */
107:
108: #define NBPW sizeof(int) /* number of bytes per word (integer) */
109:
110: #define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */
111: #define NODEV (dev_t)(-1) /* non-existent device */
112:
113: /*
114: * Clustering of hardware pages on machines with ridiculously small
115: * page sizes is done here. The paging subsystem deals with units of
116: * CLSIZE pte's describing NBPG (from machine/machparam.h) pages each.
117: */
118: #define CLBYTES (CLSIZE*NBPG)
119: #define CLOFSET (CLSIZE*NBPG-1) /* for clusters, like PGOFSET */
120: #define claligned(x) ((((int)(x))&CLOFSET)==0)
121: #define CLOFF CLOFSET
122: #define CLSHIFT (PGSHIFT+CLSIZELOG2)
123:
124: #if CLSIZE==1
125: #define clbase(i) (i)
126: #define clrnd(i) (i)
127: #else
128: /* Give the base virtual address (first of CLSIZE). */
129: #define clbase(i) ((i) &~ (CLSIZE-1))
130: /* Round a number of clicks up to a whole cluster. */
131: #define clrnd(i) (((i) + (CLSIZE-1)) &~ (CLSIZE-1))
132: #endif
133:
134: #define CBLOCK 64 /* Clist block size, must be a power of 2. */
135: #define CBQSIZE (CBLOCK/NBBY) /* Quote bytes/cblock - can do better. */
136: /* Data chars/clist. */
137: #define CBSIZE (CBLOCK - sizeof(struct cblock *) - CBQSIZE)
138: #define CROUND (CBLOCK - 1) /* Clist rounding. */
139:
140: /*
141: * File system parameters and macros.
142: *
143: * The file system is made out of blocks of at most MAXBSIZE units, with
144: * smaller units (fragments) only in the last direct block. MAXBSIZE
145: * primarily determines the size of buffers in the buffer pool. It may be
146: * made larger without any effect on existing file systems; however making
147: * it smaller make make some file systems unmountable.
148: */
149: #define MAXBSIZE 8192
150: #define MAXFRAG 8
151:
152: /*
153: * MAXPATHLEN defines the longest permissable path length after expanding
154: * symbolic links. It is used to allocate a temporary buffer from the buffer
155: * pool in which to do the name expansion, hence should be a power of two,
156: * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the
157: * maximum number of symbolic links that may be expanded in a path name.
158: * It should be set high enough to allow all legitimate uses, but halt
159: * infinite loops reasonably quickly.
160: */
161: #define MAXPATHLEN PATH_MAX
162: #define MAXSYMLINKS 8
163:
164: /* Bit map related macros. */
165: #define setbit(a,i) ((a)[(i)/NBBY] |= 1<<((i)%NBBY))
166: #define clrbit(a,i) ((a)[(i)/NBBY] &= ~(1<<((i)%NBBY)))
167: #define isset(a,i) ((a)[(i)/NBBY] & (1<<((i)%NBBY)))
168: #define isclr(a,i) (((a)[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
169:
170: /* Macros for counting and rounding. */
171: #ifndef howmany
172: #define howmany(x, y) (((x)+((y)-1))/(y))
173: #endif
174: #define roundup(x, y) ((((x)+((y)-1))/(y))*(y))
175: #define powerof2(x) ((((x)-1)&(x))==0)
176:
177: /* Macros for fast min/max: with inline expansion, the "function" is faster. */
178: #ifdef KERNEL
179: #define MIN(a,b) min((a), (b))
180: #define MAX(a,b) max((a), (b))
181: #else
182: #define MIN(a,b) (((a)<(b))?(a):(b))
183: #define MAX(a,b) (((a)>(b))?(a):(b))
184: #endif
185:
186: /*
187: * Constants for setting the parameters of the kernel memory allocator.
188: *
189: * 2 ** MINBUCKET is the smallest unit of memory that will be
190: * allocated. It must be at least large enough to hold a pointer.
191: *
192: * Units of memory less or equal to MAXALLOCSAVE will permanently
193: * allocate physical memory; requests for these size pieces of
194: * memory are quite fast. Allocations greater than MAXALLOCSAVE must
195: * always allocate and free physical memory; requests for these
196: * size allocations should be done infrequently as they will be slow.
197: *
198: * Constraints: CLBYTES <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14), and
199: * MAXALLOCSIZE must be a power of two.
200: */
201: #define MINBUCKET 4 /* 4 => min allocation of 16 bytes */
202: #define MAXALLOCSAVE (2 * CLBYTES)
203:
204: /*
205: * Scale factor for scaled integers used to count %cpu time and load avgs.
206: *
207: * The number of CPU `tick's that map to a unique `%age' can be expressed
208: * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that
209: * can be calculated (assuming 32 bits) can be closely approximated using
210: * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).
211: *
212: * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',
213: * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.
214: */
215: #define FSHIFT 11 /* bits to right of fixed binary point */
216: #define FSCALE (1<<FSHIFT)
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.