|
|
1.1 root 1: /*
2: * Copyright (c) 1988 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: * @(#)syslimits.h 7.4 (Berkeley) 2/4/91
34: */
35:
36: #define ARG_MAX 20480 /* max bytes for an exec function */
37: #define CHILD_MAX 40 /* max simultaneous processes */
38: #define LINK_MAX 32767 /* max file link count */
39: #define MAX_CANON 255 /* max bytes in terminal canonical input line */
40: #define MAX_INPUT 255 /* max bytes in terminal input */
41: #define NAME_MAX 255 /* max number of bytes in a file name */
42: #define NGROUPS_MAX 16 /* max number of supplemental group id's */
43: #define OPEN_MAX 64 /* max open files per process */
44: #define PATH_MAX 1024 /* max number of bytes in pathname */
45: #define PIPE_BUF 512 /* max number of bytes for atomic pipe writes */
46:
47: #define BC_BASE_MAX 99 /* max ibase/obase values allowed by bc(1) */
48: #define BC_DIM_MAX 2048 /* max array elements allowed by bc(1) */
49: #define BC_SCALE_MAX 99 /* max scale value allowed by bc(1) */
50: #define BC_STRING_MAX 1000 /* max const string length allowed by bc(1) */
51: #define EQUIV_CLASS_MAX 2 /* max weights for order keyword; see locale */
52: #define EXPR_NEST_MAX 32 /* max expressions nested in expr(1) */
53: #define LINE_MAX 2048 /* max length in bytes of an input line */
54: #define RE_DUP_MAX 255 /* max repeated RE's using interval notation */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.