• Home
  • Line#
  • Scopes#
  • Navigate#
  • Raw
  • Download
1 /*	$NetBSD: cdefs.h,v 1.58 2004/12/11 05:59:00 christos Exp $	*/
2 
3 /*
4  * Copyright (c) 1991, 1993
5  *	The Regents of the University of California.  All rights reserved.
6  *
7  * This code is derived from software contributed to Berkeley by
8  * Berkeley Software Design, Inc.
9  *
10  * Redistribution and use in source and binary forms, with or without
11  * modification, are permitted provided that the following conditions
12  * are met:
13  * 1. Redistributions of source code must retain the above copyright
14  *    notice, this list of conditions and the following disclaimer.
15  * 2. Redistributions in binary form must reproduce the above copyright
16  *    notice, this list of conditions and the following disclaimer in the
17  *    documentation and/or other materials provided with the distribution.
18  * 3. Neither the name of the University nor the names of its contributors
19  *    may be used to endorse or promote products derived from this software
20  *    without specific prior written permission.
21  *
22  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
23  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
24  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
25  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
26  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
27  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
28  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
29  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
30  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
31  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
32  * SUCH DAMAGE.
33  *
34  *	@(#)cdefs.h	8.8 (Berkeley) 1/9/95
35  */
36 
37 #pragma once
38 
39 /**
40  * `__BIONIC__` is always defined if you're building with bionic. See
41  * https://android.googlesource.com/platform/bionic/+/master/docs/defines.md.
42  */
43 #define __BIONIC__ 1
44 
45 #if defined(__cplusplus)
46 #define __BEGIN_DECLS extern "C" {
47 #define __END_DECLS }
48 #else
49 #define __BEGIN_DECLS
50 #define __END_DECLS
51 #endif
52 
53 #define __strong_alias(alias, sym) \
54     __asm__(".global " #alias "\n" \
55             #alias " = " #sym);
56 
57 #if defined(__cplusplus)
58 #define __BIONIC_CAST(_k,_t,_v) (_k<_t>(_v))
59 #else
60 #define __BIONIC_CAST(_k,_t,_v) ((_t) (_v))
61 #endif
62 
63 #define __BIONIC_ALIGN(__value, __alignment) (((__value) + (__alignment)-1) & ~((__alignment)-1))
64 
65 /*
66  * The nullness constraints of this parameter or return value are
67  * quite complex. This is used to highlight spots where developers
68  * are encouraged to read relevant manuals or code to understand
69  * the full picture of nullness for this pointer.
70  */
71 #define __BIONIC_COMPLICATED_NULLNESS _Null_unspecified
72 
73 /*
74  * The __CONCAT macro is used to concatenate parts of symbol names, e.g.
75  * with "#define OLD(foo) __CONCAT(old,foo)", OLD(foo) produces oldfoo.
76  * The __CONCAT macro is a bit tricky -- make sure you don't put spaces
77  * in between its arguments.  __CONCAT can also concatenate double-quoted
78  * strings produced by the __STRING macro, but this only works with ANSI C.
79  */
80 
81 #define	__P(protos)	protos		/* full-blown ANSI C */
82 
83 #define	__CONCAT1(x,y)	x ## y
84 #define	__CONCAT(x,y)	__CONCAT1(x,y)
85 #define	___CONCAT(x,y)	__CONCAT(x,y)
86 
87 #define	__STRING(x)	#x
88 #define	___STRING(x)	__STRING(x)
89 
90 #if defined(__cplusplus)
91 #define	__inline	inline		/* convert to C++ keyword */
92 #endif /* !__cplusplus */
93 
94 #define __always_inline __attribute__((__always_inline__))
95 #define __attribute_const__ __attribute__((__const__))
96 #define __attribute_pure__ __attribute__((__pure__))
97 #define __dead __attribute__((__noreturn__))
98 #define __noreturn __attribute__((__noreturn__))
99 #define __mallocfunc  __attribute__((__malloc__))
100 #define __packed __attribute__((__packed__))
101 #define __returns_twice __attribute__((__returns_twice__))
102 #define __unused __attribute__((__unused__))
103 #define __used __attribute__((__used__))
104 
105 #define __printflike(x, y) __attribute__((__format__(printf, x, y)))
106 #define __scanflike(x, y) __attribute__((__format__(scanf, x, y)))
107 #define __strftimelike(x) __attribute__((__format__(strftime, x, 0)))
108 
109 /*
110  * GNU C version 2.96 added explicit branch prediction so that
111  * the CPU back-end can hint the processor and also so that
112  * code blocks can be reordered such that the predicted path
113  * sees a more linear flow, thus improving cache behavior, etc.
114  *
115  * The following two macros provide us with a way to use this
116  * compiler feature.  Use __predict_true() if you expect the expression
117  * to evaluate to true, and __predict_false() if you expect the
118  * expression to evaluate to false.
119  *
120  * A few notes about usage:
121  *
122  *	* Generally, __predict_false() error condition checks (unless
123  *	  you have some _strong_ reason to do otherwise, in which case
124  *	  document it), and/or __predict_true() `no-error' condition
125  *	  checks, assuming you want to optimize for the no-error case.
126  *
127  *	* Other than that, if you don't know the likelihood of a test
128  *	  succeeding from empirical or other `hard' evidence, don't
129  *	  make predictions.
130  *
131  *	* These are meant to be used in places that are run `a lot'.
132  *	  It is wasteful to make predictions in code that is run
133  *	  seldomly (e.g. at subsystem initialization time) as the
134  *	  basic block reordering that this affects can often generate
135  *	  larger code.
136  */
137 #define	__predict_true(exp)	__builtin_expect((exp) != 0, 1)
138 #define	__predict_false(exp)	__builtin_expect((exp) != 0, 0)
139 
140 #define __wur __attribute__((__warn_unused_result__))
141 
142 #define __errorattr(msg) __attribute__((unavailable(msg)))
143 #define __warnattr(msg) __attribute__((deprecated(msg)))
144 #define __warnattr_real(msg) __attribute__((deprecated(msg)))
145 #define __enable_if(cond, msg) __attribute__((enable_if(cond, msg)))
146 #define __clang_error_if(cond, msg) __attribute__((diagnose_if(cond, msg, "error")))
147 #define __clang_warning_if(cond, msg) __attribute__((diagnose_if(cond, msg, "warning")))
148 
149 #if defined(ANDROID_STRICT)
150 /*
151  * For things that are sketchy, but not necessarily an error. FIXME: Enable
152  * this.
153  */
154 #  define __warnattr_strict(msg) /* __warnattr(msg) */
155 #else
156 #  define __warnattr_strict(msg)
157 #endif
158 
159 /*
160  * Some BSD source needs these macros.
161  * Originally they embedded the rcs versions of each source file
162  * in the generated binary. We strip strings during build anyway,.
163  */
164 #define __IDSTRING(_prefix,_s) /* nothing */
165 #define __COPYRIGHT(_s) /* nothing */
166 #define __FBSDID(_s) /* nothing */
167 #define __RCSID(_s) /* nothing */
168 #define __SCCSID(_s) /* nothing */
169 
170 /*
171  * With bionic, you always get all C and POSIX API.
172  *
173  * If you want BSD and/or GNU extensions, _BSD_SOURCE and/or _GNU_SOURCE are
174  * expected to be defined by callers before *any* standard header file is
175  * included.
176  *
177  * In our header files we test against __USE_BSD and __USE_GNU.
178  */
179 #if defined(_GNU_SOURCE)
180 #  define __USE_BSD 1
181 #  define __USE_GNU 1
182 #endif
183 
184 #if defined(_BSD_SOURCE)
185 #  define __USE_BSD 1
186 #endif
187 
188 /*
189  * _FILE_OFFSET_BITS 64 support.
190  * See https://android.googlesource.com/platform/bionic/+/master/docs/32-bit-abi.md
191  */
192 #if !defined(__LP64__) && defined(_FILE_OFFSET_BITS) && _FILE_OFFSET_BITS == 64
193 #  define __USE_FILE_OFFSET64 1
194 /*
195  * Note that __RENAME_IF_FILE_OFFSET64 is only valid if the off_t and off64_t
196  * functions were both added at the same API level because if you use this,
197  * you only have one declaration to attach __INTRODUCED_IN to.
198  */
199 #  define __RENAME_IF_FILE_OFFSET64(func) __RENAME(func)
200 #else
201 #  define __RENAME_IF_FILE_OFFSET64(func)
202 #endif
203 
204 /*
205  * For LP32, `long double` == `double`. Historically many `long double` functions were incorrect
206  * on x86, missing on most architectures, and even if they are present and correct, linking to
207  * them just bloats your ELF file by adding extra relocations. The __BIONIC_LP32_USE_LONG_DOUBLE
208  * macro lets us test the headers both ways (and adds an escape valve).
209  *
210  * Note that some functions have their __RENAME_LDBL commented out as a sign that although we could
211  * use __RENAME_LDBL it would actually cause the function to be introduced later because the
212  * `long double` variant appeared before the `double` variant.
213  *
214  * The _NO_GUARD_FOR_NDK variants keep the __VERSIONER_NO_GUARD behavior working for the NDK. This
215  * allows libc++ to refer to these functions in inlines without needing to guard them, needed since
216  * libc++ doesn't currently guard these calls. There's no risk to the apps though because using
217  * those APIs will still cause a link error.
218  */
219 #if defined(__LP64__) || defined(__BIONIC_LP32_USE_LONG_DOUBLE)
220 #define __RENAME_LDBL(rewrite,rewrite_api_level,regular_api_level) __INTRODUCED_IN(regular_api_level)
221 #define __RENAME_LDBL_NO_GUARD_FOR_NDK(rewrite,rewrite_api_level,regular_api_level) __INTRODUCED_IN_NO_GUARD_FOR_NDK(regular_api_level)
222 #else
223 #define __RENAME_LDBL(rewrite,rewrite_api_level,regular_api_level) __RENAME(rewrite) __INTRODUCED_IN(rewrite_api_level)
224 #define __RENAME_LDBL_NO_GUARD_FOR_NDK(rewrite,rewrite_api_level,regular_api_level) __RENAME(rewrite) __INTRODUCED_IN_NO_GUARD_FOR_NDK(rewrite_api_level)
225 #endif
226 
227 /*
228  * On all architectures, `struct stat` == `struct stat64`, but LP32 didn't gain the *64 functions
229  * until API level 21.
230  */
231 #if defined(__LP64__) || defined(__BIONIC_LP32_USE_STAT64)
232 #define __RENAME_STAT64(rewrite,rewrite_api_level,regular_api_level) __INTRODUCED_IN(regular_api_level)
233 #else
234 #define __RENAME_STAT64(rewrite,rewrite_api_level,regular_api_level) __RENAME(rewrite) __INTRODUCED_IN(rewrite_api_level)
235 #endif
236 
237 /* glibc compatibility. */
238 #if defined(__LP64__)
239 #define __WORDSIZE 64
240 #else
241 #define __WORDSIZE 32
242 #endif
243 
244 /*
245  * When _FORTIFY_SOURCE is defined, automatic bounds checking is
246  * added to commonly used libc functions. If a buffer overrun is
247  * detected, the program is safely aborted.
248  *
249  * https://android-developers.googleblog.com/2017/04/fortify-in-android.html
250  */
251 
252 #define __BIONIC_FORTIFY_UNKNOWN_SIZE ((size_t) -1)
253 
254 #if defined(_FORTIFY_SOURCE) && _FORTIFY_SOURCE > 0
255 /* FORTIFY can interfere with pattern-matching of clang-tidy/the static analyzer.  */
256 #  if !defined(__clang_analyzer__)
257 #    define __BIONIC_FORTIFY 1
258 /* ASAN has interceptors that FORTIFY's _chk functions can break.  */
259 #    if __has_feature(address_sanitizer)
260 #      define __BIONIC_FORTIFY_RUNTIME_CHECKS_ENABLED 0
261 #    else
262 #      define __BIONIC_FORTIFY_RUNTIME_CHECKS_ENABLED 1
263 #    endif
264 #  endif
265 #endif
266 
267 // As we move some FORTIFY checks to be always on, __bos needs to be
268 // always available.
269 #if defined(__BIONIC_FORTIFY)
270 #  if _FORTIFY_SOURCE == 2
271 #    define __bos_level 1
272 #  else
273 #    define __bos_level 0
274 #  endif
275 #else
276 #  define __bos_level 0
277 #endif
278 
279 #define __bosn(s, n) __builtin_object_size((s), (n))
280 #define __bos(s) __bosn((s), __bos_level)
281 
282 #if defined(__BIONIC_FORTIFY)
283 #  define __bos0(s) __bosn((s), 0)
284 #  define __pass_object_size_n(n) __attribute__((pass_object_size(n)))
285 /*
286  * FORTIFY'ed functions all have either enable_if or pass_object_size, which
287  * makes taking their address impossible. Saying (&read)(foo, bar, baz); will
288  * therefore call the unFORTIFYed version of read.
289  */
290 #  define __call_bypassing_fortify(fn) (&fn)
291 /*
292  * Because clang-FORTIFY uses overloads, we can't mark functions as `extern inline` without making
293  * them available externally. FORTIFY'ed functions try to be as close to possible as 'invisible';
294  * having stack protectors detracts from that (b/182948263).
295  */
296 #  define __BIONIC_FORTIFY_INLINE static __inline__ __attribute__((no_stack_protector)) \
297       __always_inline __VERSIONER_FORTIFY_INLINE
298 /*
299  * We should use __BIONIC_FORTIFY_VARIADIC instead of __BIONIC_FORTIFY_INLINE
300  * for variadic functions because compilers cannot inline them.
301  * The __always_inline attribute is useless, misleading, and could trigger
302  * clang compiler bug to incorrectly inline variadic functions.
303  */
304 #  define __BIONIC_FORTIFY_VARIADIC static __inline__
305 /* Error functions don't have bodies, so they can just be static. */
306 #  define __BIONIC_ERROR_FUNCTION_VISIBILITY static __attribute__((unused))
307 #else
308 /* Further increase sharing for some inline functions */
309 #  define __pass_object_size_n(n)
310 #endif
311 #define __pass_object_size __pass_object_size_n(__bos_level)
312 #define __pass_object_size0 __pass_object_size_n(0)
313 
314 /* Intended for use in unevaluated contexts, e.g. diagnose_if conditions. */
315 #define __bos_unevaluated_lt(bos_val, val) \
316   ((bos_val) != __BIONIC_FORTIFY_UNKNOWN_SIZE && (bos_val) < (val))
317 
318 #define __bos_unevaluated_le(bos_val, val) \
319   ((bos_val) != __BIONIC_FORTIFY_UNKNOWN_SIZE && (bos_val) <= (val))
320 
321 /* Intended for use in evaluated contexts. */
322 #define __bos_dynamic_check_impl_and(bos_val, op, index, cond) \
323   ((bos_val) == __BIONIC_FORTIFY_UNKNOWN_SIZE ||                 \
324    (__builtin_constant_p(index) && bos_val op index && (cond)))
325 
326 #define __bos_dynamic_check_impl(bos_val, op, index) \
327   __bos_dynamic_check_impl_and(bos_val, op, index, 1)
328 
329 #define __bos_trivially_ge(bos_val, index) __bos_dynamic_check_impl((bos_val), >=, (index))
330 #define __bos_trivially_gt(bos_val, index) __bos_dynamic_check_impl((bos_val), >, (index))
331 
332 #if defined(__BIONIC_FORTIFY) || defined(__BIONIC_DECLARE_FORTIFY_HELPERS)
333 #  define __BIONIC_INCLUDE_FORTIFY_HEADERS 1
334 #endif
335 
336 #define __overloadable __attribute__((overloadable))
337 
338 #define __diagnose_as_builtin(...) __attribute__((diagnose_as_builtin(__VA_ARGS__)))
339 
340 /* Used to tag non-static symbols that are private and never exposed by the shared library. */
341 #define __LIBC_HIDDEN__ __attribute__((visibility("hidden")))
342 
343 /*
344  * Used to tag symbols that should be hidden for 64-bit,
345  * but visible to preserve binary compatibility for LP32.
346  */
347 #ifdef __LP64__
348 #define __LIBC32_LEGACY_PUBLIC__ __attribute__((visibility("hidden")))
349 #else
350 #define __LIBC32_LEGACY_PUBLIC__ __attribute__((visibility("default")))
351 #endif
352 
353 /* Used to rename functions so that the compiler emits a call to 'x' rather than the function this was applied to. */
354 #define __RENAME(x) __asm__(#x)
355 
356 #if __has_builtin(__builtin_umul_overflow) || __GNUC__ >= 5
357 #if defined(__LP64__)
358 #define __size_mul_overflow(a, b, result) __builtin_umull_overflow(a, b, result)
359 #else
360 #define __size_mul_overflow(a, b, result) __builtin_umul_overflow(a, b, result)
361 #endif
362 #else
363 extern __inline__ __always_inline __attribute__((gnu_inline))
__size_mul_overflow(__SIZE_TYPE__ a,__SIZE_TYPE__ b,__SIZE_TYPE__ * result)364 int __size_mul_overflow(__SIZE_TYPE__ a, __SIZE_TYPE__ b, __SIZE_TYPE__ *result) {
365     *result = a * b;
366     static const __SIZE_TYPE__ mul_no_overflow = 1UL << (sizeof(__SIZE_TYPE__) * 4);
367     return (a >= mul_no_overflow || b >= mul_no_overflow) && a > 0 && (__SIZE_TYPE__)-1 / a < b;
368 }
369 #endif
370 
371 /*
372  * Used when we need to check for overflow when multiplying x and y. This
373  * should only be used where __size_mul_overflow can not work, because it makes
374  * assumptions that __size_mul_overflow doesn't (x and y are positive, ...),
375  * *and* doesn't make use of compiler intrinsics, so it's probably slower than
376  * __size_mul_overflow.
377  */
378 #define __unsafe_check_mul_overflow(x, y) ((__SIZE_TYPE__)-1 / (x) < (y))
379 
380 #include <android/versioning.h>
381 #include <android/api-level.h>
382 #if __has_include(<android/ndk-version.h>)
383 #include <android/ndk-version.h>
384 #endif
385