|
|
1.1 root 1: /*
2: * Copyright (c) 1991 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.2 ! root 33: * from: @(#)cdefs.h 7.6 (Berkeley) 5/4/91
! 34: * cdefs.h,v 1.4 1993/05/26 14:52:56 cgd Exp
1.1 root 35: */
36:
1.1.1.2 ! root 37: #ifndef _SYS_CDEFS_H_
! 38: #define _SYS_CDEFS_H_
1.1 root 39:
40: #if defined(__cplusplus)
41: #define __BEGIN_DECLS extern "C" {
42: #define __END_DECLS };
43: #else
44: #define __BEGIN_DECLS
45: #define __END_DECLS
46: #endif
47:
48: /*
49: * The __CONCAT macro is used to concatenate parts of symbol names, e.g.
50: * with "#define OLD(foo) __CONCAT(old,foo)", OLD(foo) produces oldfoo.
51: * The __CONCAT macro is a bit tricky -- make sure you don't put spaces
52: * in between its arguments. __CONCAT can also concatenate double-quoted
53: * strings produced by the __STRING macro, but this only works with ANSI C.
54: */
55: #if defined(__STDC__) || defined(__cplusplus)
56: #define __P(protos) protos /* full-blown ANSI C */
57: #define __CONCAT(x,y) x ## y
58: #define __STRING(x) #x
59:
60: #else /* !(__STDC__ || __cplusplus) */
61: #define __P(protos) () /* traditional C preprocessor */
62: #define __CONCAT(x,y) x/**/y
63: #define __STRING(x) "x"
64:
65: #ifdef __GNUC__
66: #define const __const /* GCC: ANSI C with -traditional */
67: #define inline __inline
68: #define signed __signed
69: #define volatile __volatile
70:
71: #else /* !__GNUC__ */
72: #define const /* delete ANSI C keywords */
73: #define inline
74: #define signed
75: #define volatile
76: #endif /* !__GNUC__ */
77: #endif /* !(__STDC__ || __cplusplus) */
78:
1.1.1.2 ! root 79: /*
! 80: * GCC has extensions for declaring functions as `pure' (always returns
! 81: * the same value given the same inputs, i.e., has no external state and
! 82: * no side effects) and `dead' (nonreturning). These mainly affect
! 83: * optimization and warnings. Unfortunately, GCC complains if these are
! 84: * used under strict ANSI mode (`gcc -ansi -pedantic'), hence we need to
! 85: * define them only if compiling without this.
! 86: */
! 87: #if defined(__GNUC__) && !defined(__STRICT_ANSI__)
! 88: #define __dead __volatile
! 89: #define __pure __const
! 90: #else
! 91: #define __dead
! 92: #define __pure
! 93: #endif
! 94:
! 95: #endif /* !_SYS_CDEFS_H_ */
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.