|
|
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: *
1.1.1.3 ! root 33: * from: @(#)limits.h 7.2 (Berkeley) 6/28/90
! 34: * limits.h,v 1.2 1993/05/22 08:00:21 cgd Exp
1.1 root 35: */
36:
37: #define CHAR_BIT 8 /* number of bits in a char */
38: #define CLK_TCK 60 /* ticks per second */
39: #define MB_LEN_MAX 1 /* no multibyte characters */
40:
1.1.1.2 root 41: #define SCHAR_MIN (-0x7f-1) /* max value for a signed char */
1.1 root 42: #define SCHAR_MAX 0x7f /* min value for a signed char */
43:
44: #define UCHAR_MAX 0xff /* max value for an unsigned char */
45: #define CHAR_MAX 0x7f /* max value for a char */
1.1.1.2 root 46: #define CHAR_MIN (-0x7f-1) /* min value for a char */
1.1 root 47:
48: #define USHRT_MAX 0xffff /* max value for an unsigned short */
49: #define SHRT_MAX 0x7fff /* max value for a short */
1.1.1.2 root 50: #define SHRT_MIN (-0x7fff-1) /* min value for a short */
1.1 root 51:
52: #define UINT_MAX 0xffffffff /* max value for an unsigned int */
53: #define INT_MAX 0x7fffffff /* max value for an int */
1.1.1.2 root 54: #define INT_MIN (-0x7fffffff-1) /* min value for an int */
1.1 root 55:
56: #define ULONG_MAX 0xffffffff /* max value for an unsigned long */
57: #define LONG_MAX 0x7fffffff /* max value for a long */
1.1.1.2 root 58: #define LONG_MIN (-0x7fffffff-1) /* min value for a long */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.