![[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: *
1.1.1.3 ! root 33: * from: @(#)param.h 7.23 (Berkeley) 5/6/91
! 34: * param.h,v 1.5.2.1 1993/07/20 05:52:43 cgd Exp
1.1 root 35: */
36:
1.1.1.3 ! root 37: #ifndef _SYS_PARAM_H_
! 38: #define _SYS_PARAM_H_
! 39:
1.1.1.2 root 40: #define BSD 199103 /* CSRG: March, 1991 system version (year & month) */
1.1 root 41: #define BSD4_3 1
42: #define BSD4_4 0.5
43:
1.1.1.3 ! root 44: #define NetBSD 1993070 /* NetBSD date: 1993, July, release 0 */
! 45: #define NetBSD0_9 1
! 46:
1.1 root 47: #ifndef NULL
48: #define NULL 0
49: #endif
50:
51: #ifndef LOCORE
52: #include <sys/types.h>
53: #endif
54:
55: /*
56: * Machine-independent constants (some used in following include files).
57: * Redefined constants are from POSIX 1003.1 limits file.
58: *
59: * MAXCOMLEN should be >= sizeof(ac_comm) (see <acct.h>)
60: * MAXLOGNAME should be >= UT_NAMESIZE (see <utmp.h>)
61: */
62: #include <sys/syslimits.h>
63:
64: #define MAXCOMLEN 16 /* max command name remembered */
1.1.1.3 ! root 65: #define MAXINTERP 64 /* max interpreter file name length */
1.1 root 66: #define MAXLOGNAME 12 /* max login name length */
67: #define MAXUPRC CHILD_MAX /* max simultaneous processes */
68: #define NCARGS ARG_MAX /* max bytes for an exec function */
69: #define NGROUPS NGROUPS_MAX /* max number groups */
70: #define NOFILE OPEN_MAX /* max open files per process */
71: #define NOGROUP 65535 /* marker for empty group set member */
72: #define MAXHOSTNAMELEN 256 /* max hostname size */
73:
74: /* More types and definitions used throughout the kernel. */
75: #ifdef KERNEL
76: #include <sys/cdefs.h>
77: #include <sys/errno.h>
78: #include <sys/time.h>
79: #include <sys/resource.h>
80: #include <sys/ucred.h>
81: #include <sys/uio.h>
82: #endif
83:
84: /* Signals. */
85: #include <sys/signal.h>
86:
87: /* Machine type dependent parameters. */
88: #include <machine/param.h>
89: #include <machine/endian.h>
90: #include <machine/limits.h>
91:
92: /*
93: * Priorities. Note that with 32 run queues, differences less than 4 are
94: * insignificant.
95: */
96: #define PSWP 0
97: #define PVM 4
98: #define PINOD 8
99: #define PRIBIO 16
100: #define PVFS 20
101: #define PZERO 22 /* No longer magic, shouldn't be here. XXX */
102: #define PSOCK 24
103: #define PWAIT 32
104: #define PLOCK 36
105: #define PPAUSE 40
106: #define PUSER 50
107: #define MAXPRI 127 /* Priorities range from 0 through MAXPRI. */
108:
109: #define PRIMASK 0x0ff
110: #define PCATCH 0x100 /* OR'd with pri for tsleep to check signals */
111:
112: #define NZERO 0 /* default "nice" */
113:
114: #define NBPW sizeof(int) /* number of bytes per word (integer) */
115:
116: #define CMASK 022 /* default file mask: S_IWGRP|S_IWOTH */
117: #define NODEV (dev_t)(-1) /* non-existent device */
118:
119: /*
120: * Clustering of hardware pages on machines with ridiculously small
121: * page sizes is done here. The paging subsystem deals with units of
122: * CLSIZE pte's describing NBPG (from machine/machparam.h) pages each.
123: */
124: #define CLBYTES (CLSIZE*NBPG)
125: #define CLOFSET (CLSIZE*NBPG-1) /* for clusters, like PGOFSET */
126: #define claligned(x) ((((int)(x))&CLOFSET)==0)
127: #define CLOFF CLOFSET
128: #define CLSHIFT (PGSHIFT+CLSIZELOG2)
129:
130: #if CLSIZE==1
131: #define clbase(i) (i)
132: #define clrnd(i) (i)
133: #else
134: /* Give the base virtual address (first of CLSIZE). */
135: #define clbase(i) ((i) &~ (CLSIZE-1))
136: /* Round a number of clicks up to a whole cluster. */
137: #define clrnd(i) (((i) + (CLSIZE-1)) &~ (CLSIZE-1))
138: #endif
139:
140: #define CBLOCK 64 /* Clist block size, must be a power of 2. */
141: #define CBQSIZE (CBLOCK/NBBY) /* Quote bytes/cblock - can do better. */
142: /* Data chars/clist. */
143: #define CBSIZE (CBLOCK - sizeof(struct cblock *) - CBQSIZE)
144: #define CROUND (CBLOCK - 1) /* Clist rounding. */
145:
146: /*
147: * File system parameters and macros.
148: *
149: * The file system is made out of blocks of at most MAXBSIZE units, with
150: * smaller units (fragments) only in the last direct block. MAXBSIZE
151: * primarily determines the size of buffers in the buffer pool. It may be
152: * made larger without any effect on existing file systems; however making
153: * it smaller make make some file systems unmountable.
154: */
155: #define MAXBSIZE 8192
156: #define MAXFRAG 8
157:
158: /*
159: * MAXPATHLEN defines the longest permissable path length after expanding
160: * symbolic links. It is used to allocate a temporary buffer from the buffer
161: * pool in which to do the name expansion, hence should be a power of two,
162: * and must be less than or equal to MAXBSIZE. MAXSYMLINKS defines the
163: * maximum number of symbolic links that may be expanded in a path name.
164: * It should be set high enough to allow all legitimate uses, but halt
165: * infinite loops reasonably quickly.
166: */
167: #define MAXPATHLEN PATH_MAX
168: #define MAXSYMLINKS 8
169:
170: /* Bit map related macros. */
171: #define setbit(a,i) ((a)[(i)/NBBY] |= 1<<((i)%NBBY))
172: #define clrbit(a,i) ((a)[(i)/NBBY] &= ~(1<<((i)%NBBY)))
173: #define isset(a,i) ((a)[(i)/NBBY] & (1<<((i)%NBBY)))
174: #define isclr(a,i) (((a)[(i)/NBBY] & (1<<((i)%NBBY))) == 0)
175:
176: /* Macros for counting and rounding. */
177: #ifndef howmany
178: #define howmany(x, y) (((x)+((y)-1))/(y))
179: #endif
180: #define roundup(x, y) ((((x)+((y)-1))/(y))*(y))
181: #define powerof2(x) ((((x)-1)&(x))==0)
182:
183: /* Macros for fast min/max: with inline expansion, the "function" is faster. */
184: #ifdef KERNEL
185: #define MIN(a,b) min((a), (b))
186: #define MAX(a,b) max((a), (b))
187: #else
188: #define MIN(a,b) (((a)<(b))?(a):(b))
189: #define MAX(a,b) (((a)>(b))?(a):(b))
190: #endif
191:
192: /*
193: * Constants for setting the parameters of the kernel memory allocator.
194: *
195: * 2 ** MINBUCKET is the smallest unit of memory that will be
196: * allocated. It must be at least large enough to hold a pointer.
197: *
198: * Units of memory less or equal to MAXALLOCSAVE will permanently
199: * allocate physical memory; requests for these size pieces of
200: * memory are quite fast. Allocations greater than MAXALLOCSAVE must
201: * always allocate and free physical memory; requests for these
202: * size allocations should be done infrequently as they will be slow.
203: *
204: * Constraints: CLBYTES <= MAXALLOCSAVE <= 2 ** (MINBUCKET + 14), and
205: * MAXALLOCSIZE must be a power of two.
206: */
207: #define MINBUCKET 4 /* 4 => min allocation of 16 bytes */
208: #define MAXALLOCSAVE (2 * CLBYTES)
209:
210: /*
211: * Scale factor for scaled integers used to count %cpu time and load avgs.
212: *
213: * The number of CPU `tick's that map to a unique `%age' can be expressed
214: * by the formula (1 / (2 ^ (FSHIFT - 11))). The maximum load average that
215: * can be calculated (assuming 32 bits) can be closely approximated using
216: * the formula (2 ^ (2 * (16 - FSHIFT))) for (FSHIFT < 15).
217: *
218: * For the scheduler to maintain a 1:1 mapping of CPU `tick' to `%age',
219: * FSHIFT must be at least 11; this gives us a maximum load avg of ~1024.
220: */
221: #define FSHIFT 11 /* bits to right of fixed binary point */
222: #define FSCALE (1<<FSHIFT)
1.1.1.3 ! root 223:
! 224: #endif /* !_SYS_PARAM_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.