// Code generated by 'ccgo signal/gen.c -crt-import-path "" -export-defines "" -export-enums "" -export-externs X -export-fields F -export-structs "" -export-typedefs "" -header -hide _OSSwapInt16,_OSSwapInt32,_OSSwapInt64 -ignore-unsupported-alignment -o signal/signal_freebsd_arm.go -pkgname signal', DO NOT EDIT. package signal import ( "math" "reflect" "sync/atomic" "unsafe" ) var _ = math.Pi var _ reflect.Kind var _ atomic.Value var _ unsafe.Pointer const ( BUS_ADRALN = 1 // signal.h:315:1: BUS_ADRERR = 2 // signal.h:316:1: BUS_OBJERR = 3 // signal.h:317:1: BUS_OOMERR = 100 // signal.h:318:1: CLD_CONTINUED = 6 // signal.h:350:1: CLD_DUMPED = 3 // signal.h:346:1: CLD_EXITED = 1 // signal.h:343:1: CLD_KILLED = 2 // signal.h:344:1: CLD_STOPPED = 5 // signal.h:349:1: CLD_TRAPPED = 4 // signal.h:348:1: FPE_FLTDIV = 3 // signal.h:329:1: FPE_FLTINV = 7 // signal.h:333:1: FPE_FLTOVF = 4 // signal.h:330:1: FPE_FLTRES = 6 // signal.h:332:1: FPE_FLTSUB = 8 // signal.h:334:1: FPE_FLTUND = 5 // signal.h:331:1: FPE_INTDIV = 2 // signal.h:328:1: FPE_INTOVF = 1 // signal.h:327:1: ILL_BADSTK = 8 // signal.h:312:1: ILL_COPROC = 7 // signal.h:311:1: ILL_ILLADR = 3 // signal.h:307:1: ILL_ILLOPC = 1 // signal.h:305:1: ILL_ILLOPN = 2 // signal.h:306:1: ILL_ILLTRP = 4 // signal.h:308:1: ILL_PRVOPC = 5 // signal.h:309:1: ILL_PRVREG = 6 // signal.h:310:1: MINSIGSTKSZ = 4096 // signal.h:432:1: NSIG = 32 // signal.h:399:1: POLL_ERR = 4 // signal.h:356:1: POLL_HUP = 6 // signal.h:358:1: POLL_IN = 1 // signal.h:353:1: POLL_MSG = 3 // signal.h:355:1: POLL_OUT = 2 // signal.h:354:1: POLL_PRI = 5 // signal.h:357:1: SA_NOCLDSTOP = 0x0008 // signal.h:386:1: SA_NOCLDWAIT = 0x0020 // signal.h:394:1: SA_NODEFER = 0x0010 // signal.h:393:1: SA_ONSTACK = 0x0001 // signal.h:390:1: SA_RESETHAND = 0x0004 // signal.h:392:1: SA_RESTART = 0x0002 // signal.h:391:1: SA_SIGINFO = 0x0040 // signal.h:395:1: SEGV_ACCERR = 2 // signal.h:322:1: SEGV_MAPERR = 1 // signal.h:321:1: SEGV_PKUERR = 100 // signal.h:324:1: SIGABRT = 6 // signal.h:81:1: SIGALRM = 14 // signal.h:99:1: SIGBUS = 10 // signal.h:91:1: SIGCHLD = 20 // signal.h:109:1: SIGCONT = 19 // signal.h:108:1: SIGEMT = 7 // signal.h:84:1: SIGEV_KEVENT = 3 // signal.h:222:1: SIGEV_NONE = 0 // signal.h:218:1: SIGEV_SIGNAL = 1 // signal.h:219:1: SIGEV_THREAD = 2 // signal.h:220:1: SIGEV_THREAD_ID = 4 // signal.h:223:1: SIGFPE = 8 // signal.h:86:1: SIGHUP = 1 // signal.h:71:1: SIGILL = 4 // signal.h:77:1: SIGINFO = 29 // signal.h:124:1: SIGINT = 2 // signal.h:73:1: SIGIO = 23 // signal.h:114:1: SIGIOT = 6 // signal.h:83:1: SIGKILL = 9 // signal.h:88:1: SIGLIBRT = 33 // signal.h:133:1: SIGLWP = 32 // signal.h:132:1: SIGPIPE = 13 // signal.h:98:1: SIGPROF = 27 // signal.h:120:1: SIGQUIT = 3 // signal.h:75:1: SIGRTMAX = 126 // signal.h:137:1: SIGRTMIN = 65 // signal.h:136:1: SIGSEGV = 11 // signal.h:93:1: SIGSTKSZ = 36864 // signal.h:433:1: SIGSTOP = 17 // signal.h:106:1: SIGSYS = 12 // signal.h:95:1: SIGTERM = 15 // signal.h:101:1: SIGTHR = 32 // signal.h:131:1: SIGTRAP = 5 // signal.h:79:1: SIGTSTP = 18 // signal.h:107:1: SIGTTIN = 21 // signal.h:110:1: SIGTTOU = 22 // signal.h:111:1: SIGURG = 16 // signal.h:103:1: SIGUSR1 = 30 // signal.h:127:1: SIGUSR2 = 31 // signal.h:128:1: SIGVTALRM = 26 // signal.h:119:1: SIGWINCH = 28 // signal.h:123:1: SIGXCPU = 24 // signal.h:117:1: SIGXFSZ = 25 // signal.h:118:1: SIG_BLOCK = 1 // signal.h:501:1: SIG_SETMASK = 3 // signal.h:503:1: SIG_UNBLOCK = 2 // signal.h:502:1: SI_ASYNCIO = 0x10004 // signal.h:408:1: SI_KERNEL = 0x10006 // signal.h:412:1: SI_LWP = 0x10007 // signal.h:413:1: SI_MESGQ = 0x10005 // signal.h:410:1: SI_NOINFO = 0 // signal.h:403:1: SI_QUEUE = 0x10002 // signal.h:405:1: SI_TIMER = 0x10003 // signal.h:406:1: SI_UNDEFINED = 0 // signal.h:416:1: SI_USER = 0x10001 // signal.h:404:1: SS_DISABLE = 0x0004 // signal.h:431:1: SS_ONSTACK = 0x0001 // signal.h:430:1: SV_INTERRUPT = 2 // signal.h:459:1: SV_NOCLDSTOP = 8 // signal.h:462:1: SV_NODEFER = 16 // signal.h:461:1: SV_ONSTACK = 1 // signal.h:458:1: SV_RESETHAND = 4 // signal.h:460:1: SV_SIGINFO = 64 // signal.h:463:1: TRAP_BRKPT = 1 // signal.h:337:1: TRAP_CAP = 4 // signal.h:340:1: TRAP_DTRACE = 3 // signal.h:339:1: TRAP_TRACE = 2 // signal.h:338:1: UC_ = 0 // ucontext.h:88:1: X_FILE_OFFSET_BITS = 64 // :25:1: X_ILP32 = 1 // :1:1: X_MACHINE_MCONTEXT_H_ = 0 // ucontext.h:37:1: X_MACHINE_SIGNAL_H_ = 0 // signal.h:38:1: X_MACHINE__LIMITS_H_ = 0 // _limits.h:36:1: X_MACHINE__TYPES_H_ = 0 // _types.h:42:1: X_NGREG = 17 // ucontext.h:41:1: X_Nonnull = 0 // cdefs.h:790:1: X_Null_unspecified = 0 // cdefs.h:792:1: X_Nullable = 0 // cdefs.h:791:1: X_PID_T_DECLARED = 0 // signal.h:61:1: X_PTHREAD_T_DECLARED = 0 // _pthreadtypes.h:68:1: X_REG_CPSR = 16 // ucontext.h:61:1: X_REG_FP = 11 // ucontext.h:63:1: X_REG_LR = 14 // ucontext.h:65:1: X_REG_PC = 15 // ucontext.h:66:1: X_REG_R0 = 0 // ucontext.h:45:1: X_REG_R1 = 1 // ucontext.h:46:1: X_REG_R10 = 10 // ucontext.h:55:1: X_REG_R11 = 11 // ucontext.h:56:1: X_REG_R12 = 12 // ucontext.h:57:1: X_REG_R13 = 13 // ucontext.h:58:1: X_REG_R14 = 14 // ucontext.h:59:1: X_REG_R15 = 15 // ucontext.h:60:1: X_REG_R2 = 2 // ucontext.h:47:1: X_REG_R3 = 3 // ucontext.h:48:1: X_REG_R4 = 4 // ucontext.h:49:1: X_REG_R5 = 5 // ucontext.h:50:1: X_REG_R6 = 6 // ucontext.h:51:1: X_REG_R7 = 7 // ucontext.h:52:1: X_REG_R8 = 8 // ucontext.h:53:1: X_REG_R9 = 9 // ucontext.h:54:1: X_REG_SP = 13 // ucontext.h:64:1: X_SIGNAL_H_ = 0 // signal.h:36:1: X_SIGSET_T_DECLARED = 0 // signal.h:165:1: X_SIG_MAXSIG = 128 // _sigset.h:47:1: X_SIG_WORDS = 4 // _sigset.h:46:1: X_SIZE_T_DECLARED = 0 // signal.h:57:1: X_SYS_CDEFS_H_ = 0 // cdefs.h:39:1: X_SYS_SIGNAL_H_ = 0 // signal.h:41:1: X_SYS__PTHREADTYPES_H_ = 0 // _pthreadtypes.h:39:1: X_SYS__SIGSET_H_ = 0 // _sigset.h:41:1: X_SYS__TIMESPEC_H_ = 0 // _timespec.h:37:1: X_SYS__TYPES_H_ = 0 // _types.h:32:1: X_SYS__UCONTEXT_H_ = 0 // _ucontext.h:34:1: X_TIME_T_DECLARED = 0 // _timespec.h:43:1: X_UID_T_DECLARED = 0 // signal.h:62:1: Unix = 1 // :367:1: ) type Ptrdiff_t = int32 /* :3:26 */ type Size_t = uint32 /* :9:23 */ type Wchar_t = uint32 /* :15:24 */ type X__builtin_va_list = uintptr /* :46:14 */ type X__float128 = float64 /* :47:21 */ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1991, 1993 // The Regents of the University of California. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)signal.h 8.3 (Berkeley) 3/30/94 // $FreeBSD$ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1991, 1993 // The Regents of the University of California. All rights reserved. // // This code is derived from software contributed to Berkeley by // Berkeley Software Design, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)cdefs.h 8.8 (Berkeley) 1/9/95 // $FreeBSD$ // Testing against Clang-specific extensions. // This code has been put in place to help reduce the addition of // compiler specific defines in FreeBSD code. It helps to aid in // having a compiler-agnostic source tree. // Compiler memory barriers, specific to gcc and clang. // XXX: if __GNUC__ >= 2: not tested everywhere originally, where replaced // Macro to test if we're using a specific version of gcc or later. // The __CONCAT macro is used to concatenate parts of symbol names, e.g. // with "#define OLD(foo) __CONCAT(old,foo)", OLD(foo) produces oldfoo. // The __CONCAT macro is a bit tricky to use if it must work in non-ANSI // mode -- there must be no spaces between its arguments, and for nested // __CONCAT's, all the __CONCAT's must be at the left. __CONCAT can also // concatenate double-quoted strings produced by the __STRING macro, but // this only works with ANSI C. // // __XSTRING is like __STRING, but it expands any macros in its argument // first. It is only available with ANSI C. // Compiler-dependent macros to help declare dead (non-returning) and // pure (no side effects) functions, and unused variables. They are // null except for versions of gcc that are known to support the features // properly (old versions of gcc-2 supported the dead and pure features // in a different (wrong) way). If we do not provide an implementation // for a given compiler, let the compile fail if it is told to use // a feature that we cannot live without. // Keywords added in C11. // Emulation of C11 _Generic(). Unlike the previously defined C11 // keywords, it is not possible to implement this using exactly the same // syntax. Therefore implement something similar under the name // __generic(). Unlike _Generic(), this macro can only distinguish // between a single type, so it requires nested invocations to // distinguish multiple cases. // C99 Static array indices in function parameter declarations. Syntax such as: // void bar(int myArray[static 10]); // is allowed in C99 but not in C++. Define __min_size appropriately so // headers using it can be compiled in either language. Use like this: // void bar(int myArray[__min_size(10)]); // XXX: should use `#if __STDC_VERSION__ < 199901'. // C++11 exposes a load of C99 stuff // GCC 2.95 provides `__restrict' as an extension to C90 to support the // C99-specific `restrict' type qualifier. We happen to use `__restrict' as // a way to define the `restrict' type qualifier without disturbing older // software that is unaware of C99 keywords. // GNU C version 2.96 adds explicit branch prediction so that // the CPU back-end can hint the processor and also so that // code blocks can be reordered such that the predicted path // sees a more linear flow, thus improving cache behavior, etc. // // The following two macros provide us with a way to utilize this // compiler feature. Use __predict_true() if you expect the expression // to evaluate to true, and __predict_false() if you expect the // expression to evaluate to false. // // A few notes about usage: // // * Generally, __predict_false() error condition checks (unless // you have some _strong_ reason to do otherwise, in which case // document it), and/or __predict_true() `no-error' condition // checks, assuming you want to optimize for the no-error case. // // * Other than that, if you don't know the likelihood of a test // succeeding from empirical or other `hard' evidence, don't // make predictions. // // * These are meant to be used in places that are run `a lot'. // It is wasteful to make predictions in code that is run // seldomly (e.g. at subsystem initialization time) as the // basic block reordering that this affects can often generate // larger code. // We define this here since , , and // require it. // Given the pointer x to the member m of the struct s, return // a pointer to the containing structure. When using GCC, we first // assign pointer x to a local variable, to check that its type is // compatible with member m. // Compiler-dependent macros to declare that functions take printf-like // or scanf-like arguments. They are null except for versions of gcc // that are known to support the features properly (old versions of gcc-2 // didn't permit keeping the keywords out of the application namespace). // Compiler-dependent macros that rely on FreeBSD-specific extensions. // Embed the rcs id of a source file in the resulting library. Note that in // more recent ELF binutils, we use .ident allowing the ID to be stripped. // Usage: // __FBSDID("$FreeBSD$"); // - // The following definitions are an extension of the behavior originally // implemented in , but with a different level of granularity. // POSIX.1 requires that the macros we test be defined before any standard // header file is included. // // Here's a quick run-down of the versions: // defined(_POSIX_SOURCE) 1003.1-1988 // _POSIX_C_SOURCE == 1 1003.1-1990 // _POSIX_C_SOURCE == 2 1003.2-1992 C Language Binding Option // _POSIX_C_SOURCE == 199309 1003.1b-1993 // _POSIX_C_SOURCE == 199506 1003.1c-1995, 1003.1i-1995, // and the omnibus ISO/IEC 9945-1: 1996 // _POSIX_C_SOURCE == 200112 1003.1-2001 // _POSIX_C_SOURCE == 200809 1003.1-2008 // // In addition, the X/Open Portability Guide, which is now the Single UNIX // Specification, defines a feature-test macro which indicates the version of // that specification, and which subsumes _POSIX_C_SOURCE. // // Our macros begin with two underscores to avoid namespace screwage. // Deal with IEEE Std. 1003.1-1990, in which _POSIX_C_SOURCE == 1. // Deal with IEEE Std. 1003.2-1992, in which _POSIX_C_SOURCE == 2. // Deal with various X/Open Portability Guides and Single UNIX Spec. // Deal with all versions of POSIX. The ordering relative to the tests above is // important. // - // Deal with _ANSI_SOURCE: // If it is defined, and no other compilation environment is explicitly // requested, then define our internal feature-test macros to zero. This // makes no difference to the preprocessor (undefined symbols in preprocessing // expressions are defined to have value zero), but makes it more convenient for // a test program to print out the values. // // If a program mistakenly defines _ANSI_SOURCE and some other macro such as // _POSIX_C_SOURCE, we will assume that it wants the broader compilation // environment (and in fact we will never get here). // User override __EXT1_VISIBLE // Old versions of GCC use non-standard ARM arch symbols; acle-compat.h // translates them to __ARM_ARCH and the modern feature symbols defined by ARM. // Nullability qualifiers: currently only supported by Clang. // Type Safety Checking // // Clang provides additional attributes to enable checking type safety // properties that cannot be enforced by the C type system. // Lock annotations. // // Clang provides support for doing basic thread-safety tests at // compile-time, by marking which locks will/should be held when // entering/leaving a functions. // // Furthermore, it is also possible to annotate variables and structure // members to enforce that they are only accessed when certain locks are // held. // Structure implements a lock. // Function acquires an exclusive or shared lock. // Function attempts to acquire an exclusive or shared lock. // Function releases a lock. // Function asserts that an exclusive or shared lock is held. // Function requires that an exclusive or shared lock is or is not held. // Function should not be analyzed. // Function or variable should not be sanitized, e.g., by AddressSanitizer. // GCC has the nosanitize attribute, but as a function attribute only, and // warns on use as a variable attribute. // Guard variables and structure members by lock. // Alignment builtins for better type checking and improved code generation. // Provide fallback versions for other compilers (GCC/Clang < 10): // - // SPDX-License-Identifier: BSD-2-Clause-FreeBSD // // Copyright (c) 2002 Mike Barcroft // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // $FreeBSD$ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1991, 1993 // The Regents of the University of California. All rights reserved. // // This code is derived from software contributed to Berkeley by // Berkeley Software Design, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)cdefs.h 8.8 (Berkeley) 1/9/95 // $FreeBSD$ // - // SPDX-License-Identifier: BSD-4-Clause // // Copyright (c) 2002 Mike Barcroft // Copyright (c) 1990, 1993 // The Regents of the University of California. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. All advertising materials mentioning features or use of this software // must display the following acknowledgement: // This product includes software developed by the University of // California, Berkeley and its contributors. // 4. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // From: @(#)ansi.h 8.2 (Berkeley) 1/4/94 // From: @(#)types.h 8.3 (Berkeley) 1/5/94 // $FreeBSD$ // Basic types upon which most other types are built. type X__int8_t = int8 /* _types.h:51:22 */ type X__uint8_t = uint8 /* _types.h:52:24 */ type X__int16_t = int16 /* _types.h:53:17 */ type X__uint16_t = uint16 /* _types.h:54:25 */ type X__int32_t = int32 /* _types.h:55:15 */ type X__uint32_t = uint32 /* _types.h:56:23 */ // LONGLONG type X__int64_t = int64 /* _types.h:61:20 */ // LONGLONG type X__uint64_t = uint64 /* _types.h:66:28 */ // Standard type definitions. type X__clock_t = X__uint32_t /* _types.h:71:20 */ // clock()... type X__critical_t = X__int32_t /* _types.h:72:19 */ type X__double_t = float64 /* _types.h:74:17 */ type X__float_t = float32 /* _types.h:75:16 */ type X__intfptr_t = X__int32_t /* _types.h:77:19 */ type X__intmax_t = X__int64_t /* _types.h:78:19 */ type X__intptr_t = X__int32_t /* _types.h:79:19 */ type X__int_fast8_t = X__int32_t /* _types.h:80:19 */ type X__int_fast16_t = X__int32_t /* _types.h:81:19 */ type X__int_fast32_t = X__int32_t /* _types.h:82:19 */ type X__int_fast64_t = X__int64_t /* _types.h:83:19 */ type X__int_least8_t = X__int8_t /* _types.h:84:18 */ type X__int_least16_t = X__int16_t /* _types.h:85:19 */ type X__int_least32_t = X__int32_t /* _types.h:86:19 */ type X__int_least64_t = X__int64_t /* _types.h:87:19 */ type X__ptrdiff_t = X__int32_t /* _types.h:88:19 */ // ptr1 - ptr2 type X__register_t = X__int32_t /* _types.h:89:19 */ type X__segsz_t = X__int32_t /* _types.h:90:19 */ // segment size (in pages) type X__size_t = X__uint32_t /* _types.h:91:20 */ // sizeof() type X__ssize_t = X__int32_t /* _types.h:92:19 */ // byte count or error type X__time_t = X__int64_t /* _types.h:93:19 */ // time()... type X__uintfptr_t = X__uint32_t /* _types.h:94:20 */ type X__uintmax_t = X__uint64_t /* _types.h:95:20 */ type X__uintptr_t = X__uint32_t /* _types.h:96:20 */ type X__uint_fast8_t = X__uint32_t /* _types.h:97:20 */ type X__uint_fast16_t = X__uint32_t /* _types.h:98:20 */ type X__uint_fast32_t = X__uint32_t /* _types.h:99:20 */ type X__uint_fast64_t = X__uint64_t /* _types.h:100:20 */ type X__uint_least8_t = X__uint8_t /* _types.h:101:19 */ type X__uint_least16_t = X__uint16_t /* _types.h:102:20 */ type X__uint_least32_t = X__uint32_t /* _types.h:103:20 */ type X__uint_least64_t = X__uint64_t /* _types.h:104:20 */ type X__u_register_t = X__uint32_t /* _types.h:105:20 */ type X__vm_offset_t = X__uint32_t /* _types.h:106:20 */ type X__vm_paddr_t = X__uint32_t /* _types.h:107:20 */ type X__vm_size_t = X__uint32_t /* _types.h:108:20 */ type X___wchar_t = uint32 /* _types.h:110:22 */ // Standard type definitions. type X__blksize_t = X__int32_t /* _types.h:40:19 */ // file block size type X__blkcnt_t = X__int64_t /* _types.h:41:19 */ // file block count type X__clockid_t = X__int32_t /* _types.h:42:19 */ // clock_gettime()... type X__fflags_t = X__uint32_t /* _types.h:43:20 */ // file flags type X__fsblkcnt_t = X__uint64_t /* _types.h:44:20 */ type X__fsfilcnt_t = X__uint64_t /* _types.h:45:20 */ type X__gid_t = X__uint32_t /* _types.h:46:20 */ type X__id_t = X__int64_t /* _types.h:47:19 */ // can hold a gid_t, pid_t, or uid_t type X__ino_t = X__uint64_t /* _types.h:48:20 */ // inode number type X__key_t = int32 /* _types.h:49:15 */ // IPC key (for Sys V IPC) type X__lwpid_t = X__int32_t /* _types.h:50:19 */ // Thread ID (a.k.a. LWP) type X__mode_t = X__uint16_t /* _types.h:51:20 */ // permissions type X__accmode_t = int32 /* _types.h:52:14 */ // access permissions type X__nl_item = int32 /* _types.h:53:14 */ type X__nlink_t = X__uint64_t /* _types.h:54:20 */ // link count type X__off_t = X__int64_t /* _types.h:55:19 */ // file offset type X__off64_t = X__int64_t /* _types.h:56:19 */ // file offset (alias) type X__pid_t = X__int32_t /* _types.h:57:19 */ // process [group] type X__rlim_t = X__int64_t /* _types.h:58:19 */ // resource limit - intentionally // signed, because of legacy code // that uses -1 for RLIM_INFINITY type X__sa_family_t = X__uint8_t /* _types.h:61:19 */ type X__socklen_t = X__uint32_t /* _types.h:62:20 */ type X__suseconds_t = int32 /* _types.h:63:15 */ // microseconds (signed) type X__timer_t = uintptr /* _types.h:64:24 */ // timer_gettime()... type X__mqd_t = uintptr /* _types.h:65:21 */ // mq_open()... type X__uid_t = X__uint32_t /* _types.h:66:20 */ type X__useconds_t = uint32 /* _types.h:67:22 */ // microseconds (unsigned) type X__cpuwhich_t = int32 /* _types.h:68:14 */ // which parameter for cpuset. type X__cpulevel_t = int32 /* _types.h:69:14 */ // level parameter for cpuset. type X__cpusetid_t = int32 /* _types.h:70:14 */ // cpuset identifier. type X__daddr_t = X__int64_t /* _types.h:71:19 */ // bwrite(3), FIOBMAP2, etc // Unusual type definitions. // rune_t is declared to be an “int” instead of the more natural // “unsigned long” or “long”. Two things are happening here. It is not // unsigned so that EOF (-1) can be naturally assigned to it and used. Also, // it looks like 10646 will be a 31 bit standard. This means that if your // ints cannot hold 32 bits, you will be in trouble. The reason an int was // chosen over a long is that the is*() and to*() routines take ints (says // ANSI C), but they use __ct_rune_t instead of int. // // NOTE: rune_t is not covered by ANSI nor other standards, and should not // be instantiated outside of lib/libc/locale. Use wchar_t. wint_t and // rune_t must be the same type. Also, wint_t should be able to hold all // members of the largest character set plus one extra value (WEOF), and // must be at least 16 bits. type X__ct_rune_t = int32 /* _types.h:91:14 */ // arg type for ctype funcs type X__rune_t = X__ct_rune_t /* _types.h:92:21 */ // rune_t (see above) type X__wint_t = X__ct_rune_t /* _types.h:93:21 */ // wint_t (see above) // Clang already provides these types as built-ins, but only in C++ mode. type X__char16_t = X__uint_least16_t /* _types.h:97:26 */ type X__char32_t = X__uint_least32_t /* _types.h:98:26 */ // In C++11, char16_t and char32_t are built-in types. type X__max_align_t = struct { F__max_align1 int64 F__max_align2 float64 } /* _types.h:111:3 */ type X__dev_t = X__uint64_t /* _types.h:113:20 */ // device number type X__fixpt_t = X__uint32_t /* _types.h:115:20 */ // fixed point number // mbstate_t is an opaque object to keep conversion state during multibyte // stream conversions. type X__mbstate_t = struct { F__ccgo_pad1 [0]uint64 F__mbstate8 [128]uint8 } /* _types.h:124:3 */ type X__rman_res_t = X__uintmax_t /* _types.h:126:25 */ // Types for varargs. These are all provided by builtin types these // days, so centralize their definition. type X__va_list = X__builtin_va_list /* _types.h:133:27 */ // internally known to gcc type X__gnuc_va_list = X__va_list /* _types.h:140:20 */ // compatibility w/GNU headers // When the following macro is defined, the system uses 64-bit inode numbers. // Programs can use this to avoid including , with its associated // namespace pollution. // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1982, 1986, 1989, 1991, 1993 // The Regents of the University of California. All rights reserved. // (c) UNIX System Laboratories, Inc. // All or some portions of this file are derived from material licensed // to the University of California by American Telephone and Telegraph // Co. or Unix System Laboratories, Inc. and are reproduced herein with // the permission of UNIX System Laboratories, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)signal.h 8.4 (Berkeley) 5/4/95 // $FreeBSD$ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1991, 1993 // The Regents of the University of California. All rights reserved. // // This code is derived from software contributed to Berkeley by // Berkeley Software Design, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)cdefs.h 8.8 (Berkeley) 1/9/95 // $FreeBSD$ // - // SPDX-License-Identifier: BSD-2-Clause-FreeBSD // // Copyright (c) 2002 Mike Barcroft // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // $FreeBSD$ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1982, 1986, 1989, 1991, 1993 // The Regents of the University of California. All rights reserved. // (c) UNIX System Laboratories, Inc. // All or some portions of this file are derived from material licensed // to the University of California by American Telephone and Telegraph // Co. or Unix System Laboratories, Inc. and are reproduced herein with // the permission of UNIX System Laboratories, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)signal.h 8.4 (Berkeley) 5/4/95 // $FreeBSD$ // sigset_t macros. type X__sigset = struct{ F__bits [4]X__uint32_t } /* _sigset.h:53:9 */ // compatibility w/GNU headers // When the following macro is defined, the system uses 64-bit inode numbers. // Programs can use this to avoid including , with its associated // namespace pollution. // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1982, 1986, 1989, 1991, 1993 // The Regents of the University of California. All rights reserved. // (c) UNIX System Laboratories, Inc. // All or some portions of this file are derived from material licensed // to the University of California by American Telephone and Telegraph // Co. or Unix System Laboratories, Inc. and are reproduced herein with // the permission of UNIX System Laboratories, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)signal.h 8.4 (Berkeley) 5/4/95 // $FreeBSD$ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1991, 1993 // The Regents of the University of California. All rights reserved. // // This code is derived from software contributed to Berkeley by // Berkeley Software Design, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)cdefs.h 8.8 (Berkeley) 1/9/95 // $FreeBSD$ // - // SPDX-License-Identifier: BSD-2-Clause-FreeBSD // // Copyright (c) 2002 Mike Barcroft // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // $FreeBSD$ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1982, 1986, 1989, 1991, 1993 // The Regents of the University of California. All rights reserved. // (c) UNIX System Laboratories, Inc. // All or some portions of this file are derived from material licensed // to the University of California by American Telephone and Telegraph // Co. or Unix System Laboratories, Inc. and are reproduced herein with // the permission of UNIX System Laboratories, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)signal.h 8.4 (Berkeley) 5/4/95 // $FreeBSD$ // sigset_t macros. type X__sigset_t = X__sigset /* _sigset.h:55:3 */ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1988, 1993 // The Regents of the University of California. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)limits.h 8.3 (Berkeley) 1/4/94 // $FreeBSD$ // According to ANSI (section 2.2.4.2), the values below must be usable by // #if preprocessing directives. Additionally, the expression must have the // same type as would an expression that is an object of the corresponding // type converted according to the integral promotions. The subtraction for // INT_MIN, etc., is so the value is not unsigned; e.g., 0x80000000 is an // unsigned int for 32-bit two's complement ANSI compilers (section 3.1.3.2). // max value for an unsigned long long // Quads and long longs are the same size. Ensure they stay in sync. // Minimum signal stack size. // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1986, 1989, 1991, 1993 // The Regents of the University of California. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)signal.h 8.1 (Berkeley) 6/11/93 // from: FreeBSD: src/sys/i386/include/signal.h,v 1.13 2000/11/09 // from: FreeBSD: src/sys/sparc64/include/signal.h,v 1.6 2001/09/30 18:52:17 // $FreeBSD$ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1991, 1993 // The Regents of the University of California. All rights reserved. // // This code is derived from software contributed to Berkeley by // Berkeley Software Design, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)cdefs.h 8.8 (Berkeley) 1/9/95 // $FreeBSD$ type Sig_atomic_t = int32 /* signal.h:42:14 */ type Sigcontext = struct{ F_dummy int32 } /* signal.h:46:1 */ type Pthread_once = struct { Fstate int32 Fmutex Pthread_mutex_t } /* _pthreadtypes.h:52:1 */ // Primitive system data type definitions required by P1003.1c. // // Note that P1003.1c specifies that there are no defined comparison // or assignment operators for the types pthread_attr_t, pthread_cond_t, // pthread_condattr_t, pthread_mutex_t, pthread_mutexattr_t. type Pthread_t = uintptr /* _pthreadtypes.h:67:26 */ type Pthread_attr_t = uintptr /* _pthreadtypes.h:70:30 */ type Pthread_mutex_t = uintptr /* _pthreadtypes.h:71:31 */ type Pthread_mutexattr_t = uintptr /* _pthreadtypes.h:72:35 */ type Pthread_cond_t = uintptr /* _pthreadtypes.h:73:30 */ type Pthread_condattr_t = uintptr /* _pthreadtypes.h:74:34 */ type Pthread_key_t = int32 /* _pthreadtypes.h:75:20 */ type Pthread_once_t = Pthread_once /* _pthreadtypes.h:76:30 */ type Pthread_rwlock_t = uintptr /* _pthreadtypes.h:77:32 */ type Pthread_rwlockattr_t = uintptr /* _pthreadtypes.h:78:35 */ type Pthread_barrier_t = uintptr /* _pthreadtypes.h:79:33 */ type Pthread_barrierattr_t = uintptr /* _pthreadtypes.h:80:36 */ type Pthread_spinlock_t = uintptr /* _pthreadtypes.h:81:33 */ // Additional type definitions: // // Note that P1003.1c reserves the prefixes pthread_ and PTHREAD_ for // use in header symbols. type Pthread_addr_t = uintptr /* _pthreadtypes.h:89:14 */ type Pthread_startroutine_t = uintptr /* _pthreadtypes.h:90:14 */ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1982, 1986, 1993 // The Regents of the University of California. All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. Neither the name of the University nor the names of its contributors // may be used to endorse or promote products derived from this software // without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // @(#)time.h 8.5 (Berkeley) 5/4/95 // from: FreeBSD: src/sys/sys/time.h,v 1.43 2000/03/20 14:09:05 phk Exp // $FreeBSD$ // - // SPDX-License-Identifier: BSD-2-Clause-FreeBSD // // Copyright (c) 2002 Mike Barcroft // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND // ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE // ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE // FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL // DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS // OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) // HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT // LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY // OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF // SUCH DAMAGE. // // $FreeBSD$ type Time_t = X__time_t /* _timespec.h:42:18 */ type Timespec = struct { Ftv_sec Time_t Ftv_nsec int32 F__ccgo_pad1 [4]byte } /* _timespec.h:46:1 */ type Uid_t = X__uid_t /* signal.h:61:18 */ type Sigset_t = X__sigset_t /* signal.h:166:20 */ type Sigval = struct{ Fsival_int int32 } /* signal.h:171:1 */ type Sigevent = struct { Fsigev_notify int32 Fsigev_signo int32 Fsigev_value struct{ Fsival_int int32 } F_sigev_un struct { F_threadid X__lwpid_t F__ccgo_pad1 [28]byte } } /* signal.h:195:1 */ type X__siginfo = struct { Fsi_signo int32 Fsi_errno int32 Fsi_code int32 Fsi_pid X__pid_t Fsi_uid X__uid_t Fsi_status int32 Fsi_addr uintptr Fsi_value struct{ Fsival_int int32 } F_reason struct { F_fault struct{ F_trapno int32 } F__ccgo_pad1 [28]byte } } /* signal.h:229:9 */ type Siginfo_t = X__siginfo /* signal.h:263:3 */ // Signal vector "template" used in sigaction call. type Sigaction = struct { F__sigaction_u struct{ F__sa_handler uintptr } Fsa_flags int32 Fsa_mask Sigset_t } /* signal.h:368:1 */ // If SA_SIGINFO is set, sa_sigaction must be used instead of sa_handler. // a timer set by timer_settime(). // an asynchronous I/O request. // message on an empty message queue. type Sig_t = uintptr /* signal.h:420:24 */ type Sigaltstack = struct { Fss_sp uintptr Fss_size X__size_t Fss_flags int32 } /* signal.h:428:9 */ type Stack_t = Sigaltstack /* signal.h:428:26 */ // 4.3 compatibility: // Signal vector "template" used in sigvec call. type Sigvec = struct { Fsv_handler uintptr Fsv_mask int32 Fsv_flags int32 } /* signal.h:452:1 */ // Keep this in one place only // Structure used in sigstack call. type Sigstack = struct { Fss_sp uintptr Fss_onstack int32 } /* signal.h:479:1 */ // $NetBSD: mcontext.h,v 1.4 2003/10/08 22:43:01 thorpej Exp $ // - // SPDX-License-Identifier: BSD-2-Clause-NetBSD // // Copyright (c) 2001, 2002 The NetBSD Foundation, Inc. // All rights reserved. // // This code is derived from software contributed to The NetBSD Foundation // by Klaus Klein and by Jason R. Thorpe of Wasabi Systems, Inc. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // // THIS SOFTWARE IS PROVIDED BY THE NETBSD FOUNDATION, INC. AND CONTRIBUTORS // ``AS IS'' AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED // TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE FOUNDATION OR CONTRIBUTORS // BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR // CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF // SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS // INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN // CONTRACT, STRICT LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) // ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE // POSSIBILITY OF SUCH DAMAGE. // // $FreeBSD$ // General register state type X__greg_t = uint32 /* ucontext.h:42:22 */ type X__gregset_t = [17]X__greg_t /* ucontext.h:43:18 */ // Convenience synonyms // Floating point register state type Mcontext_vfp_t = struct { Fmcv_reg [32]X__uint64_t Fmcv_fpscr X__uint32_t F__ccgo_pad1 [4]byte } /* ucontext.h:74:3 */ type Mcontext_t = struct { F__gregs X__gregset_t Fmc_vfp_size X__size_t Fmc_vfp_ptr uintptr Fmc_spare [33]uint32 } /* ucontext.h:86:3 */ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1999 Marcel Moolenaar // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer // in this position and unchanged. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. The name of the author may not be used to endorse or promote products // derived from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // $FreeBSD$ type X__ucontext = struct { Fuc_sigmask X__sigset_t Fuc_mcontext Mcontext_t Fuc_link uintptr Fuc_stack struct { Fss_sp uintptr Fss_size X__size_t Fss_flags int32 } Fuc_flags int32 F__spare__ [4]int32 } /* _ucontext.h:36:9 */ // - // SPDX-License-Identifier: BSD-3-Clause // // Copyright (c) 1999 Marcel Moolenaar // All rights reserved. // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions // are met: // 1. Redistributions of source code must retain the above copyright // notice, this list of conditions and the following disclaimer // in this position and unchanged. // 2. Redistributions in binary form must reproduce the above copyright // notice, this list of conditions and the following disclaimer in the // documentation and/or other materials provided with the distribution. // 3. The name of the author may not be used to endorse or promote products // derived from this software without specific prior written permission. // // THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR // IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES // OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. // IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT, // INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT // NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, // DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY // THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF // THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. // // $FreeBSD$ type Ucontext_t = X__ucontext /* _ucontext.h:52:3 */ type Pid_t = X__pid_t /* signal.h:60:18 */ // XXX type X__pthread_t = uintptr /* signal.h:67:24 */ var _ uint8 /* gen.c:2:13: */