[thirdparty/systemd.git] / src / basic / macro.h

/* SPDX-License-Identifier: LGPL-2.1+ */
#pragma once

#include <assert.h>
#include <inttypes.h>
#include <stdbool.h>
#include <sys/param.h>
#include <sys/sysmacros.h>
#include <sys/types.h>

#define _printf_(a, b) __attribute__((__format__(printf, a, b)))
#ifdef __clang__
#  define _alloc_(...)
#else
#  define _alloc_(...) __attribute__((__alloc_size__(__VA_ARGS__)))
#endif
#define _sentinel_ __attribute__((__sentinel__))
#define _section_(x) __attribute__((__section__(x)))
#define _used_ __attribute__((__used__))
#define _unused_ __attribute__((__unused__))
#define _destructor_ __attribute__((__destructor__))
#define _pure_ __attribute__((__pure__))
#define _const_ __attribute__((__const__))
#define _deprecated_ __attribute__((__deprecated__))
#define _packed_ __attribute__((__packed__))
#define _malloc_ __attribute__((__malloc__))
#define _weak_ __attribute__((__weak__))
#define _likely_(x) (__builtin_expect(!!(x), 1))
#define _unlikely_(x) (__builtin_expect(!!(x), 0))
#define _public_ __attribute__((__visibility__("default")))
#define _hidden_ __attribute__((__visibility__("hidden")))
#define _weakref_(x) __attribute__((__weakref__(#x)))
#define _align_(x) __attribute__((__aligned__(x)))
#define _alignas_(x) __attribute__((__aligned__(__alignof(x))))
#define _alignptr_ __attribute__((__aligned__(sizeof(void*))))
#define _cleanup_(x) __attribute__((__cleanup__(x)))
#if __GNUC__ >= 7
#define _fallthrough_ __attribute__((__fallthrough__))
#else
#define _fallthrough_
#endif
/* Define C11 noreturn without <stdnoreturn.h> and even on older gcc
 * compiler versions */
#ifndef _noreturn_
#if __STDC_VERSION__ >= 201112L
#define _noreturn_ _Noreturn
#else
#define _noreturn_ __attribute__((__noreturn__))
#endif
#endif

#if !defined(HAS_FEATURE_MEMORY_SANITIZER)
#  if defined(__has_feature)
#    if __has_feature(memory_sanitizer)
#      define HAS_FEATURE_MEMORY_SANITIZER 1
#    endif
#  endif
#  if !defined(HAS_FEATURE_MEMORY_SANITIZER)
#    define HAS_FEATURE_MEMORY_SANITIZER 0
#  endif
#endif

#if !defined(HAS_FEATURE_ADDRESS_SANITIZER)
#  ifdef __SANITIZE_ADDRESS__
#      define HAS_FEATURE_ADDRESS_SANITIZER 1
#  elif defined(__has_feature)
#    if __has_feature(address_sanitizer)
#      define HAS_FEATURE_ADDRESS_SANITIZER 1
#    endif
#  endif
#  if !defined(HAS_FEATURE_ADDRESS_SANITIZER)
#    define HAS_FEATURE_ADDRESS_SANITIZER 0
#  endif
#endif

/* Temporarily disable some warnings */
#define DISABLE_WARNING_FORMAT_NONLITERAL                               \
        _Pragma("GCC diagnostic push");                                 \
        _Pragma("GCC diagnostic ignored \"-Wformat-nonliteral\"")

#define DISABLE_WARNING_MISSING_PROTOTYPES                              \
        _Pragma("GCC diagnostic push");                                 \
        _Pragma("GCC diagnostic ignored \"-Wmissing-prototypes\"")

#define DISABLE_WARNING_NONNULL                                         \
        _Pragma("GCC diagnostic push");                                 \
        _Pragma("GCC diagnostic ignored \"-Wnonnull\"")

#define DISABLE_WARNING_SHADOW                                          \
        _Pragma("GCC diagnostic push");                                 \
        _Pragma("GCC diagnostic ignored \"-Wshadow\"")

#define DISABLE_WARNING_INCOMPATIBLE_POINTER_TYPES                      \
        _Pragma("GCC diagnostic push");                                 \
        _Pragma("GCC diagnostic ignored \"-Wincompatible-pointer-types\"")

#define REENABLE_WARNING                                                \
        _Pragma("GCC diagnostic pop")

/* automake test harness */
#define EXIT_TEST_SKIP 77

#define XSTRINGIFY(x) #x
#define STRINGIFY(x) XSTRINGIFY(x)

#define XCONCATENATE(x, y) x ## y
#define CONCATENATE(x, y) XCONCATENATE(x, y)

#define UNIQ_T(x, uniq) CONCATENATE(__unique_prefix_, CONCATENATE(x, uniq))
#define UNIQ __COUNTER__

/* builtins */
#if __SIZEOF_INT__ == 4
#define BUILTIN_FFS_U32(x) __builtin_ffs(x);
#elif __SIZEOF_LONG__ == 4
#define BUILTIN_FFS_U32(x) __builtin_ffsl(x);
#else
#error "neither int nor long are four bytes long?!?"
#endif

/* Rounds up */

#define ALIGN4(l) (((l) + 3) & ~3)
#define ALIGN8(l) (((l) + 7) & ~7)

#if __SIZEOF_POINTER__ == 8
#define ALIGN(l) ALIGN8(l)
#elif __SIZEOF_POINTER__ == 4
#define ALIGN(l) ALIGN4(l)
#else
#error "Wut? Pointers are neither 4 nor 8 bytes long?"
#endif

#define ALIGN_PTR(p) ((void*) ALIGN((unsigned long) (p)))
#define ALIGN4_PTR(p) ((void*) ALIGN4((unsigned long) (p)))
#define ALIGN8_PTR(p) ((void*) ALIGN8((unsigned long) (p)))

static inline size_t ALIGN_TO(size_t l, size_t ali) {
        return ((l + ali - 1) & ~(ali - 1));
}

#define ALIGN_TO_PTR(p, ali) ((void*) ALIGN_TO((unsigned long) (p), (ali)))

/* align to next higher power-of-2 (except for: 0 => 0, overflow => 0) */
static inline unsigned long ALIGN_POWER2(unsigned long u) {
        /* clz(0) is undefined */
        if (u == 1)
                return 1;

        /* left-shift overflow is undefined */
        if (__builtin_clzl(u - 1UL) < 1)
                return 0;

        return 1UL << (sizeof(u) * 8 - __builtin_clzl(u - 1UL));
}

#ifndef __COVERITY__
#  define VOID_0 ((void)0)
#else
#  define VOID_0 ((void*)0)
#endif

#define ELEMENTSOF(x)                                                   \
        (__builtin_choose_expr(                                         \
                !__builtin_types_compatible_p(typeof(x), typeof(&*(x))), \
                sizeof(x)/sizeof((x)[0]),                               \
                VOID_0))

/*
 * STRLEN - return the length of a string literal, minus the trailing NUL byte.
 *          Contrary to strlen(), this is a constant expression.
 * @x: a string literal.
 */
#define STRLEN(x) (sizeof(""x"") - 1)

/*
 * container_of - cast a member of a structure out to the containing structure
 * @ptr: the pointer to the member.
 * @type: the type of the container struct this is embedded in.
 * @member: the name of the member within the struct.
 */
#define container_of(ptr, type, member) __container_of(UNIQ, (ptr), type, member)
#define __container_of(uniq, ptr, type, member)                         \
        ({                                                              \
                const typeof( ((type*)0)->member ) *UNIQ_T(A, uniq) = (ptr); \
                (type*)( (char *)UNIQ_T(A, uniq) - offsetof(type, member) ); \
        })

#undef MAX
#define MAX(a, b) __MAX(UNIQ, (a), UNIQ, (b))
#define __MAX(aq, a, bq, b)                             \
        ({                                              \
                const typeof(a) UNIQ_T(A, aq) = (a);    \
                const typeof(b) UNIQ_T(B, bq) = (b);    \
                UNIQ_T(A, aq) > UNIQ_T(B, bq) ? UNIQ_T(A, aq) : UNIQ_T(B, bq); \
        })

/* evaluates to (void) if _A or _B are not constant or of different types */
#define CONST_MAX(_A, _B) \
        (__builtin_choose_expr(                                         \
                __builtin_constant_p(_A) &&                             \
                __builtin_constant_p(_B) &&                             \
                __builtin_types_compatible_p(typeof(_A), typeof(_B)),   \
                ((_A) > (_B)) ? (_A) : (_B),                            \
                VOID_0))

/* takes two types and returns the size of the larger one */
#define MAXSIZE(A, B) (sizeof(union _packed_ { typeof(A) a; typeof(B) b; }))

#define MAX3(x, y, z)                                   \
        ({                                              \
                const typeof(x) _c = MAX(x, y);         \
                MAX(_c, z);                             \
        })

#undef MIN
#define MIN(a, b) __MIN(UNIQ, (a), UNIQ, (b))
#define __MIN(aq, a, bq, b)                             \
        ({                                              \
                const typeof(a) UNIQ_T(A, aq) = (a);    \
                const typeof(b) UNIQ_T(B, bq) = (b);    \
                UNIQ_T(A, aq) < UNIQ_T(B, bq) ? UNIQ_T(A, aq) : UNIQ_T(B, bq); \
        })

#define MIN3(x, y, z)                                   \
        ({                                              \
                const typeof(x) _c = MIN(x, y);         \
                MIN(_c, z);                             \
        })

#define LESS_BY(a, b) __LESS_BY(UNIQ, (a), UNIQ, (b))
#define __LESS_BY(aq, a, bq, b)                         \
        ({                                              \
                const typeof(a) UNIQ_T(A, aq) = (a);    \
                const typeof(b) UNIQ_T(B, bq) = (b);    \
                UNIQ_T(A, aq) > UNIQ_T(B, bq) ? UNIQ_T(A, aq) - UNIQ_T(B, bq) : 0; \
        })

#define CMP(a, b) __CMP(UNIQ, (a), UNIQ, (b))
#define __CMP(aq, a, bq, b)                             \
        ({                                              \
                const typeof(a) UNIQ_T(A, aq) = (a);    \
                const typeof(b) UNIQ_T(B, bq) = (b);    \
                UNIQ_T(A, aq) < UNIQ_T(B, bq) ? -1 :    \
                UNIQ_T(A, aq) > UNIQ_T(B, bq) ? 1 : 0;  \
        })

#undef CLAMP
#define CLAMP(x, low, high) __CLAMP(UNIQ, (x), UNIQ, (low), UNIQ, (high))
#define __CLAMP(xq, x, lowq, low, highq, high)                          \
        ({                                                              \
                const typeof(x) UNIQ_T(X, xq) = (x);                    \
                const typeof(low) UNIQ_T(LOW, lowq) = (low);            \
                const typeof(high) UNIQ_T(HIGH, highq) = (high);        \
                        UNIQ_T(X, xq) > UNIQ_T(HIGH, highq) ?           \
                                UNIQ_T(HIGH, highq) :                   \
                                UNIQ_T(X, xq) < UNIQ_T(LOW, lowq) ?     \
                                        UNIQ_T(LOW, lowq) :             \
                                        UNIQ_T(X, xq);                  \
        })

/* [(x + y - 1) / y] suffers from an integer overflow, even though the
 * computation should be possible in the given type. Therefore, we use
 * [x / y + !!(x % y)]. Note that on "Real CPUs" a division returns both the
 * quotient and the remainder, so both should be equally fast. */
#define DIV_ROUND_UP(x, y) __DIV_ROUND_UP(UNIQ, (x), UNIQ, (y))
#define __DIV_ROUND_UP(xq, x, yq, y)                                    \
        ({                                                              \
                const typeof(x) UNIQ_T(X, xq) = (x);                    \
                const typeof(y) UNIQ_T(Y, yq) = (y);                    \
                (UNIQ_T(X, xq) / UNIQ_T(Y, yq) + !!(UNIQ_T(X, xq) % UNIQ_T(Y, yq))); \
        })

#ifdef __COVERITY__

/* Use special definitions of assertion macros in order to prevent
 * false positives of ASSERT_SIDE_EFFECT on Coverity static analyzer
 * for uses of assert_se() and assert_return().
 *
 * These definitions make expression go through a (trivial) function
 * call to ensure they are not discarded. Also use ! or !! to ensure
 * the boolean expressions are seen as such.
 *
 * This technique has been described and recommended in:
 * https://community.synopsys.com/s/question/0D534000046Yuzb/suppressing-assertsideeffect-for-functions-that-allow-for-sideeffects
 */

extern void __coverity_panic__(void);

static inline int __coverity_check__(int condition) {
        return condition;
}

#define assert_message_se(expr, message)                                \
        do {                                                            \
                if (__coverity_check__(!(expr)))                        \
                        __coverity_panic__();                           \
        } while (false)

#define assert_log(expr, message) __coverity_check__(!!(expr))

#else  /* ! __COVERITY__ */

#define assert_message_se(expr, message)                                \
        do {                                                            \
                if (_unlikely_(!(expr)))                                \
                        log_assert_failed(message, __FILE__, __LINE__, __PRETTY_FUNCTION__); \
        } while (false)

#define assert_log(expr, message) ((_likely_(expr))                     \
        ? (true)                                                        \
        : (log_assert_failed_return(message, __FILE__, __LINE__, __PRETTY_FUNCTION__), false))

#endif  /* __COVERITY__ */

#define assert_se(expr) assert_message_se(expr, #expr)

/* We override the glibc assert() here. */
#undef assert
#ifdef NDEBUG
#define assert(expr) do {} while (false)
#else
#define assert(expr) assert_message_se(expr, #expr)
#endif

#define assert_not_reached(t)                                           \
        do {                                                            \
                log_assert_failed_unreachable(t, __FILE__, __LINE__, __PRETTY_FUNCTION__); \
        } while (false)

#if defined(static_assert)
#define assert_cc(expr)                                                 \
        static_assert(expr, #expr);
#else
#define assert_cc(expr)                                                 \
        struct CONCATENATE(_assert_struct_, __COUNTER__) {              \
                char x[(expr) ? 0 : -1];                                \
        };
#endif

#define assert_return(expr, r)                                          \
        do {                                                            \
                if (!assert_log(expr, #expr))                           \
                        return (r);                                     \
        } while (false)

#define assert_return_errno(expr, r, err)                               \
        do {                                                            \
                if (!assert_log(expr, #expr)) {                         \
                        errno = err;                                    \
                        return (r);                                     \
                }                                                       \
        } while (false)

#define return_with_errno(r, err)                     \
        do {                                          \
                errno = abs(err);                     \
                return r;                             \
        } while (false)

#define PTR_TO_INT(p) ((int) ((intptr_t) (p)))
#define INT_TO_PTR(u) ((void *) ((intptr_t) (u)))
#define PTR_TO_UINT(p) ((unsigned) ((uintptr_t) (p)))
#define UINT_TO_PTR(u) ((void *) ((uintptr_t) (u)))

#define PTR_TO_LONG(p) ((long) ((intptr_t) (p)))
#define LONG_TO_PTR(u) ((void *) ((intptr_t) (u)))
#define PTR_TO_ULONG(p) ((unsigned long) ((uintptr_t) (p)))
#define ULONG_TO_PTR(u) ((void *) ((uintptr_t) (u)))

#define PTR_TO_INT32(p) ((int32_t) ((intptr_t) (p)))
#define INT32_TO_PTR(u) ((void *) ((intptr_t) (u)))
#define PTR_TO_UINT32(p) ((uint32_t) ((uintptr_t) (p)))
#define UINT32_TO_PTR(u) ((void *) ((uintptr_t) (u)))

#define PTR_TO_INT64(p) ((int64_t) ((intptr_t) (p)))
#define INT64_TO_PTR(u) ((void *) ((intptr_t) (u)))
#define PTR_TO_UINT64(p) ((uint64_t) ((uintptr_t) (p)))
#define UINT64_TO_PTR(u) ((void *) ((uintptr_t) (u)))

#define PTR_TO_SIZE(p) ((size_t) ((uintptr_t) (p)))
#define SIZE_TO_PTR(u) ((void *) ((uintptr_t) (u)))

#define CHAR_TO_STR(x) ((char[2]) { x, 0 })

#define char_array_0(x) x[sizeof(x)-1] = 0;

/* Returns the number of chars needed to format variables of the
 * specified type as a decimal string. Adds in extra space for a
 * negative '-' prefix (hence works correctly on signed
 * types). Includes space for the trailing NUL. */
#define DECIMAL_STR_MAX(type)                                           \
        (2+(sizeof(type) <= 1 ? 3 :                                     \
            sizeof(type) <= 2 ? 5 :                                     \
            sizeof(type) <= 4 ? 10 :                                    \
            sizeof(type) <= 8 ? 20 : sizeof(int[-2*(sizeof(type) > 8)])))

#define DECIMAL_STR_WIDTH(x)                            \
        ({                                              \
                typeof(x) _x_ = (x);                    \
                unsigned ans = 1;                       \
                while ((_x_ /= 10) != 0)                \
                        ans++;                          \
                ans;                                    \
        })

#define SET_FLAG(v, flag, b) \
        (v) = (b) ? ((v) | (flag)) : ((v) & ~(flag))
#define FLAGS_SET(v, flags) \
        ((~(v) & (flags)) == 0)

#define CASE_F(X) case X:
#define CASE_F_1(CASE, X) CASE_F(X)
#define CASE_F_2(CASE, X, ...)  CASE(X) CASE_F_1(CASE, __VA_ARGS__)
#define CASE_F_3(CASE, X, ...)  CASE(X) CASE_F_2(CASE, __VA_ARGS__)
#define CASE_F_4(CASE, X, ...)  CASE(X) CASE_F_3(CASE, __VA_ARGS__)
#define CASE_F_5(CASE, X, ...)  CASE(X) CASE_F_4(CASE, __VA_ARGS__)
#define CASE_F_6(CASE, X, ...)  CASE(X) CASE_F_5(CASE, __VA_ARGS__)
#define CASE_F_7(CASE, X, ...)  CASE(X) CASE_F_6(CASE, __VA_ARGS__)
#define CASE_F_8(CASE, X, ...)  CASE(X) CASE_F_7(CASE, __VA_ARGS__)
#define CASE_F_9(CASE, X, ...)  CASE(X) CASE_F_8(CASE, __VA_ARGS__)
#define CASE_F_10(CASE, X, ...) CASE(X) CASE_F_9(CASE, __VA_ARGS__)
#define CASE_F_11(CASE, X, ...) CASE(X) CASE_F_10(CASE, __VA_ARGS__)
#define CASE_F_12(CASE, X, ...) CASE(X) CASE_F_11(CASE, __VA_ARGS__)
#define CASE_F_13(CASE, X, ...) CASE(X) CASE_F_12(CASE, __VA_ARGS__)
#define CASE_F_14(CASE, X, ...) CASE(X) CASE_F_13(CASE, __VA_ARGS__)
#define CASE_F_15(CASE, X, ...) CASE(X) CASE_F_14(CASE, __VA_ARGS__)
#define CASE_F_16(CASE, X, ...) CASE(X) CASE_F_15(CASE, __VA_ARGS__)
#define CASE_F_17(CASE, X, ...) CASE(X) CASE_F_16(CASE, __VA_ARGS__)
#define CASE_F_18(CASE, X, ...) CASE(X) CASE_F_17(CASE, __VA_ARGS__)
#define CASE_F_19(CASE, X, ...) CASE(X) CASE_F_18(CASE, __VA_ARGS__)
#define CASE_F_20(CASE, X, ...) CASE(X) CASE_F_19(CASE, __VA_ARGS__)

#define GET_CASE_F(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,_11,_12,_13,_14,_15,_16,_17,_18,_19,_20,NAME,...) NAME
#define FOR_EACH_MAKE_CASE(...) \
        GET_CASE_F(__VA_ARGS__,CASE_F_20,CASE_F_19,CASE_F_18,CASE_F_17,CASE_F_16,CASE_F_15,CASE_F_14,CASE_F_13,CASE_F_12,CASE_F_11, \
                               CASE_F_10,CASE_F_9,CASE_F_8,CASE_F_7,CASE_F_6,CASE_F_5,CASE_F_4,CASE_F_3,CASE_F_2,CASE_F_1) \
                   (CASE_F,__VA_ARGS__)

#define IN_SET(x, ...)                          \
        ({                                      \
                bool _found = false;            \
                /* If the build breaks in the line below, you need to extend the case macros. (We use "long double" as  \
                 * type for the array, in the hope that checkers such as ubsan don't complain that the initializers for \
                 * the array are not representable by the base type. Ideally we'd use typeof(x) as base type, but that  \
                 * doesn't work, as we want to use this on bitfields and gcc refuses typeof() on bitfields.) */         \
                assert_cc((sizeof((long double[]){__VA_ARGS__})/sizeof(long double)) <= 20); \
                switch(x) {                     \
                FOR_EACH_MAKE_CASE(__VA_ARGS__) \
                        _found = true;          \
                        break;                  \
                default:                        \
                        break;                  \
                }                               \
                _found;                         \
        })

#define SWAP_TWO(x, y) do {                        \
                typeof(x) _t = (x);                \
                (x) = (y);                         \
                (y) = (_t);                        \
        } while (false)

/* Define C11 thread_local attribute even on older gcc compiler
 * version */
#ifndef thread_local
/*
 * Don't break on glibc < 2.16 that doesn't define __STDC_NO_THREADS__
 * see http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53769
 */
#if __STDC_VERSION__ >= 201112L && !(defined(__STDC_NO_THREADS__) || (defined(__GNU_LIBRARY__) && __GLIBC__ == 2 && __GLIBC_MINOR__ < 16))
#define thread_local _Thread_local
#else
#define thread_local __thread
#endif
#endif

#define DEFINE_TRIVIAL_CLEANUP_FUNC(type, func)                 \
        static inline void func##p(type *p) {                   \
                if (*p)                                         \
                        func(*p);                               \
        }

#define _DEFINE_TRIVIAL_REF_FUNC(type, name, scope)             \
        scope type *name##_ref(type *p) {                       \
                if (!p)                                         \
                        return NULL;                            \
                                                                \
                assert(p->n_ref > 0);                           \
                p->n_ref++;                                     \
                return p;                                       \
        }

#define _DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func, scope) \
        scope type *name##_unref(type *p) {                      \
                if (!p)                                          \
                        return NULL;                             \
                                                                 \
                assert(p->n_ref > 0);                            \
                p->n_ref--;                                      \
                if (p->n_ref > 0)                                \
                        return NULL;                             \
                                                                 \
                return free_func(p);                             \
        }

#define DEFINE_TRIVIAL_REF_FUNC(type, name)     \
        _DEFINE_TRIVIAL_REF_FUNC(type, name,)
#define DEFINE_PRIVATE_TRIVIAL_REF_FUNC(type, name)     \
        _DEFINE_TRIVIAL_REF_FUNC(type, name, static)
#define DEFINE_PUBLIC_TRIVIAL_REF_FUNC(type, name)      \
        _DEFINE_TRIVIAL_REF_FUNC(type, name, _public_)

#define DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func)        \
        _DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func,)
#define DEFINE_PRIVATE_TRIVIAL_UNREF_FUNC(type, name, free_func)        \
        _DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func, static)
#define DEFINE_PUBLIC_TRIVIAL_UNREF_FUNC(type, name, free_func)         \
        _DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func, _public_)

#define DEFINE_TRIVIAL_REF_UNREF_FUNC(type, name, free_func)    \
        DEFINE_TRIVIAL_REF_FUNC(type, name);                    \
        DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func);

#define DEFINE_PRIVATE_TRIVIAL_REF_UNREF_FUNC(type, name, free_func)    \
        DEFINE_PRIVATE_TRIVIAL_REF_FUNC(type, name);                    \
        DEFINE_PRIVATE_TRIVIAL_UNREF_FUNC(type, name, free_func);

#define DEFINE_PUBLIC_TRIVIAL_REF_UNREF_FUNC(type, name, free_func)    \
        DEFINE_PUBLIC_TRIVIAL_REF_FUNC(type, name);                    \
        DEFINE_PUBLIC_TRIVIAL_UNREF_FUNC(type, name, free_func);

#include "log.h"
Commit	Line	Data
53e1b683	1	/* SPDX-License-Identifier: LGPL-2.1+ */
c2f1db8f	2	#pragma once
60918275	3
7e61bd0f	4	#include <assert.h>
c31e1495	5	#include <inttypes.h>
c01ff965	6	#include <stdbool.h>
afc5dbf3	7	#include <sys/param.h>
27d13af7	8	#include <sys/sysmacros.h>
afc5dbf3	9	#include <sys/types.h>
60918275	10
2ee1c55d	11	#define _printf_(a, b) __attribute__((__format__(printf, a, b)))
26e9e10b ZJS	12	#ifdef __clang__
	13	# define _alloc_(...)
	14	#else
2ee1c55d	15	# define _alloc_(...) __attribute__((__alloc_size__(__VA_ARGS__)))
26e9e10b	16	#endif
2ee1c55d	17	#define _sentinel_ __attribute__((__sentinel__))
d752090f LP	18	#define _section_(x) __attribute__((__section__(x)))
d752090f LP	19	#define _used_ __attribute__((__used__))
2ee1c55d LP	20	#define _unused_ __attribute__((__unused__))
	21	#define _destructor_ __attribute__((__destructor__))
	22	#define _pure_ __attribute__((__pure__))
	23	#define _const_ __attribute__((__const__))
	24	#define _deprecated_ __attribute__((__deprecated__))
	25	#define _packed_ __attribute__((__packed__))
	26	#define _malloc_ __attribute__((__malloc__))
	27	#define _weak_ __attribute__((__weak__))
117efe06 FB	28	#define _likely_(x) (__builtin_expect(!!(x), 1))
117efe06 FB	29	#define _unlikely_(x) (__builtin_expect(!!(x), 0))
2ee1c55d LP	30	#define _public_ __attribute__((__visibility__("default")))
2ee1c55d LP	31	#define _hidden_ __attribute__((__visibility__("hidden")))
012c2f76	32	#define _weakref_(x) __attribute__((__weakref__(#x)))
d752090f	33	#define _align_(x) __attribute__((__aligned__(x)))
012c2f76	34	#define _alignas_(x) __attribute__((__aligned__(__alignof(x))))
d752090f	35	#define _alignptr_ __attribute__((__aligned__(sizeof(void*))))
012c2f76	36	#define _cleanup_(x) __attribute__((__cleanup__(x)))
fb8e74a4	37	#if __GNUC__ >= 7
012c2f76	38	#define _fallthrough_ __attribute__((__fallthrough__))
fb8e74a4 SL	39	#else
	40	#define _fallthrough_
	41	#endif
848e863a FB	42	/* Define C11 noreturn without <stdnoreturn.h> and even on older gcc
	43	* compiler versions */
	44	#ifndef _noreturn_
	45	#if __STDC_VERSION__ >= 201112L
	46	#define _noreturn_ _Noreturn
	47	#else
012c2f76	48	#define _noreturn_ __attribute__((__noreturn__))
848e863a FB	49	#endif
848e863a FB	50	#endif
60918275	51
989290db ZJS	52	#if !defined(HAS_FEATURE_MEMORY_SANITIZER)
	53	# if defined(__has_feature)
	54	# if __has_feature(memory_sanitizer)
	55	# define HAS_FEATURE_MEMORY_SANITIZER 1
	56	# endif
	57	# endif
	58	# if !defined(HAS_FEATURE_MEMORY_SANITIZER)
	59	# define HAS_FEATURE_MEMORY_SANITIZER 0
	60	# endif
	61	#endif
	62
289acab9	63	#if !defined(HAS_FEATURE_ADDRESS_SANITIZER)
be5f77b2 LP	64	# ifdef __SANITIZE_ADDRESS__
	65	# define HAS_FEATURE_ADDRESS_SANITIZER 1
	66	# elif defined(__has_feature)
289acab9 EV	67	# if __has_feature(address_sanitizer)
	68	# define HAS_FEATURE_ADDRESS_SANITIZER 1
	69	# endif
	70	# endif
	71	# if !defined(HAS_FEATURE_ADDRESS_SANITIZER)
	72	# define HAS_FEATURE_ADDRESS_SANITIZER 0
	73	# endif
	74	#endif
	75
7ebe131a	76	/* Temporarily disable some warnings */
bcfce235 LP	77	#define DISABLE_WARNING_FORMAT_NONLITERAL \
	78	_Pragma("GCC diagnostic push"); \
	79	_Pragma("GCC diagnostic ignored \"-Wformat-nonliteral\"")
	80
f0f2e63b LP	81	#define DISABLE_WARNING_MISSING_PROTOTYPES \
	82	_Pragma("GCC diagnostic push"); \
	83	_Pragma("GCC diagnostic ignored \"-Wmissing-prototypes\"")
	84
8fca4e30 LP	85	#define DISABLE_WARNING_NONNULL \
	86	_Pragma("GCC diagnostic push"); \
	87	_Pragma("GCC diagnostic ignored \"-Wnonnull\"")
	88
d442e2ec DH	89	#define DISABLE_WARNING_SHADOW \
	90	_Pragma("GCC diagnostic push"); \
	91	_Pragma("GCC diagnostic ignored \"-Wshadow\"")
	92
df99a9ef ZJS	93	#define DISABLE_WARNING_INCOMPATIBLE_POINTER_TYPES \
	94	_Pragma("GCC diagnostic push"); \
	95	_Pragma("GCC diagnostic ignored \"-Wincompatible-pointer-types\"")
	96
7ebe131a LP	97	#define REENABLE_WARNING \
	98	_Pragma("GCC diagnostic pop")
	99
49e5de64 ZJS	100	/* automake test harness */
	101	#define EXIT_TEST_SKIP 77
	102
bef2733f LP	103	#define XSTRINGIFY(x) #x
	104	#define STRINGIFY(x) XSTRINGIFY(x)
	105
ab9cbe34 LS	106	#define XCONCATENATE(x, y) x ## y
	107	#define CONCATENATE(x, y) XCONCATENATE(x, y)
	108
fb835651 DH	109	#define UNIQ_T(x, uniq) CONCATENATE(__unique_prefix_, CONCATENATE(x, uniq))
	110	#define UNIQ __COUNTER__
	111
13b498f9 TJ	112	/* builtins */
	113	#if __SIZEOF_INT__ == 4
	114	#define BUILTIN_FFS_U32(x) __builtin_ffs(x);
	115	#elif __SIZEOF_LONG__ == 4
	116	#define BUILTIN_FFS_U32(x) __builtin_ffsl(x);
	117	#else
	118	#error "neither int nor long are four bytes long?!?"
	119	#endif
	120
60918275	121	/* Rounds up */
9be9c7cf LP	122
	123	#define ALIGN4(l) (((l) + 3) & ~3)
	124	#define ALIGN8(l) (((l) + 7) & ~7)
	125
	126	#if __SIZEOF_POINTER__ == 8
	127	#define ALIGN(l) ALIGN8(l)
	128	#elif __SIZEOF_POINTER__ == 4
	129	#define ALIGN(l) ALIGN4(l)
	130	#else
	131	#error "Wut? Pointers are neither 4 nor 8 bytes long?"
	132	#endif
	133
5f86c1f4 LP	134	#define ALIGN_PTR(p) ((void*) ALIGN((unsigned long) (p)))
	135	#define ALIGN4_PTR(p) ((void*) ALIGN4((unsigned long) (p)))
	136	#define ALIGN8_PTR(p) ((void*) ALIGN8((unsigned long) (p)))
e86b80b8	137
37f85e66	138	static inline size_t ALIGN_TO(size_t l, size_t ali) {
37f85e66	139	return ((l + ali - 1) & ~(ali - 1));
22be093f LP	140	}
22be093f LP	141
5f86c1f4	142	#define ALIGN_TO_PTR(p, ali) ((void*) ALIGN_TO((unsigned long) (p), (ali)))
49aa47c7	143
625e870b DH	144	/* align to next higher power-of-2 (except for: 0 => 0, overflow => 0) */
	145	static inline unsigned long ALIGN_POWER2(unsigned long u) {
	146	/* clz(0) is undefined */
	147	if (u == 1)
	148	return 1;
	149
	150	/* left-shift overflow is undefined */
	151	if (__builtin_clzl(u - 1UL) < 1)
	152	return 0;
	153
	154	return 1UL << (sizeof(u) * 8 - __builtin_clzl(u - 1UL));
	155	}
	156
963c6c90 ZJS	157	#ifndef __COVERITY__
	158	# define VOID_0 ((void)0)
	159	#else
	160	# define VOID_0 ((void*)0)
	161	#endif
	162
117efe06 FB	163	#define ELEMENTSOF(x) \
117efe06 FB	164	(__builtin_choose_expr( \
7f39a210	165	!__builtin_types_compatible_p(typeof(x), typeof(&*(x))), \
117efe06	166	sizeof(x)/sizeof((x)[0]), \
963c6c90	167	VOID_0))
6febe75d TH	168
	169	/*
	170	* STRLEN - return the length of a string literal, minus the trailing NUL byte.
	171	* Contrary to strlen(), this is a constant expression.
	172	* @x: a string literal.
	173	*/
	174	#define STRLEN(x) (sizeof(""x"") - 1)
	175
bbc98d32 KS	176	/*
	177	* container_of - cast a member of a structure out to the containing structure
	178	* @ptr: the pointer to the member.
	179	* @type: the type of the container struct this is embedded in.
	180	* @member: the name of the member within the struct.
bbc98d32	181	*/
fb835651 DH	182	#define container_of(ptr, type, member) __container_of(UNIQ, (ptr), type, member)
fb835651 DH	183	#define __container_of(uniq, ptr, type, member) \
117efe06	184	({ \
fb835651	185	const typeof( ((type)0)->member ) UNIQ_T(A, uniq) = (ptr); \
117efe06	186	(type)( (char )UNIQ_T(A, uniq) - offsetof(type, member) ); \
fb835651	187	})
bbc98d32	188
9607d947	189	#undef MAX
667a0377 DH	190	#define MAX(a, b) __MAX(UNIQ, (a), UNIQ, (b))
667a0377 DH	191	#define __MAX(aq, a, bq, b) \
117efe06	192	({ \
667a0377 DH	193	const typeof(a) UNIQ_T(A, aq) = (a); \
667a0377 DH	194	const typeof(b) UNIQ_T(B, bq) = (b); \
117efe06	195	UNIQ_T(A, aq) > UNIQ_T(B, bq) ? UNIQ_T(A, aq) : UNIQ_T(B, bq); \
667a0377	196	})
60918275	197
7242d742 DH	198	/* evaluates to (void) if _A or _B are not constant or of different types */
7242d742 DH	199	#define CONST_MAX(_A, _B) \
117efe06	200	(__builtin_choose_expr( \
7242d742 DH	201	__builtin_constant_p(_A) && \
	202	__builtin_constant_p(_B) && \
	203	__builtin_types_compatible_p(typeof(_A), typeof(_B)), \
	204	((_A) > (_B)) ? (_A) : (_B), \
963c6c90	205	VOID_0))
7242d742	206
40a1eebd DH	207	/* takes two types and returns the size of the larger one */
	208	#define MAXSIZE(A, B) (sizeof(union _packed_ { typeof(A) a; typeof(B) b; }))
	209
117efe06 FB	210	#define MAX3(x, y, z) \
	211	({ \
	212	const typeof(x) _c = MAX(x, y); \
	213	MAX(_c, z); \
	214	})
3b63d2d3	215
9607d947	216	#undef MIN
667a0377 DH	217	#define MIN(a, b) __MIN(UNIQ, (a), UNIQ, (b))
667a0377 DH	218	#define __MIN(aq, a, bq, b) \
117efe06	219	({ \
667a0377 DH	220	const typeof(a) UNIQ_T(A, aq) = (a); \
667a0377 DH	221	const typeof(b) UNIQ_T(B, bq) = (b); \
117efe06	222	UNIQ_T(A, aq) < UNIQ_T(B, bq) ? UNIQ_T(A, aq) : UNIQ_T(B, bq); \
667a0377	223	})
60918275	224
117efe06 FB	225	#define MIN3(x, y, z) \
	226	({ \
	227	const typeof(x) _c = MIN(x, y); \
	228	MIN(_c, z); \
	229	})
7df23077	230
667a0377 DH	231	#define LESS_BY(a, b) __LESS_BY(UNIQ, (a), UNIQ, (b))
667a0377 DH	232	#define __LESS_BY(aq, a, bq, b) \
117efe06	233	({ \
667a0377 DH	234	const typeof(a) UNIQ_T(A, aq) = (a); \
667a0377 DH	235	const typeof(b) UNIQ_T(B, bq) = (b); \
117efe06	236	UNIQ_T(A, aq) > UNIQ_T(B, bq) ? UNIQ_T(A, aq) - UNIQ_T(B, bq) : 0; \
667a0377	237	})
348ced90	238
84fb2131 FB	239	#define CMP(a, b) __CMP(UNIQ, (a), UNIQ, (b))
	240	#define __CMP(aq, a, bq, b) \
	241	({ \
	242	const typeof(a) UNIQ_T(A, aq) = (a); \
	243	const typeof(b) UNIQ_T(B, bq) = (b); \
	244	UNIQ_T(A, aq) < UNIQ_T(B, bq) ? -1 : \
	245	UNIQ_T(A, aq) > UNIQ_T(B, bq) ? 1 : 0; \
	246	})
	247
667a0377 DH	248	#undef CLAMP
	249	#define CLAMP(x, low, high) __CLAMP(UNIQ, (x), UNIQ, (low), UNIQ, (high))
	250	#define __CLAMP(xq, x, lowq, low, highq, high) \
117efe06 FB	251	({ \
	252	const typeof(x) UNIQ_T(X, xq) = (x); \
	253	const typeof(low) UNIQ_T(LOW, lowq) = (low); \
	254	const typeof(high) UNIQ_T(HIGH, highq) = (high); \
	255	UNIQ_T(X, xq) > UNIQ_T(HIGH, highq) ? \
	256	UNIQ_T(HIGH, highq) : \
	257	UNIQ_T(X, xq) < UNIQ_T(LOW, lowq) ? \
	258	UNIQ_T(LOW, lowq) : \
	259	UNIQ_T(X, xq); \
667a0377	260	})
60918275	261
180a60bc DH	262	/* [(x + y - 1) / y] suffers from an integer overflow, even though the
	263	* computation should be possible in the given type. Therefore, we use
	264	* [x / y + !!(x % y)]. Note that on "Real CPUs" a division returns both the
	265	* quotient and the remainder, so both should be equally fast. */
8a453c9d LP	266	#define DIV_ROUND_UP(x, y) __DIV_ROUND_UP(UNIQ, (x), UNIQ, (y))
8a453c9d LP	267	#define __DIV_ROUND_UP(xq, x, yq, y) \
117efe06	268	({ \
8a453c9d LP	269	const typeof(x) UNIQ_T(X, xq) = (x); \
	270	const typeof(y) UNIQ_T(Y, yq) = (y); \
	271	(UNIQ_T(X, xq) / UNIQ_T(Y, yq) + !!(UNIQ_T(X, xq) % UNIQ_T(Y, yq))); \
180a60bc DH	272	})
180a60bc DH	273
d9fb7afb FB	274	#ifdef __COVERITY__
	275
	276	/* Use special definitions of assertion macros in order to prevent
	277	* false positives of ASSERT_SIDE_EFFECT on Coverity static analyzer
	278	* for uses of assert_se() and assert_return().
	279	*
	280	* These definitions make expression go through a (trivial) function
	281	* call to ensure they are not discarded. Also use ! or !! to ensure
	282	* the boolean expressions are seen as such.
	283	*
	284	* This technique has been described and recommended in:
	285	* https://community.synopsys.com/s/question/0D534000046Yuzb/suppressing-assertsideeffect-for-functions-that-allow-for-sideeffects
	286	*/
	287
	288	extern void __coverity_panic__(void);
	289
	290	static inline int __coverity_check__(int condition) {
	291	return condition;
	292	}
	293
	294	#define assert_message_se(expr, message) \
	295	do { \
	296	if (__coverity_check__(!(expr))) \
	297	__coverity_panic__(); \
	298	} while (false)
	299
	300	#define assert_log(expr, message) __coverity_check__(!!(expr))
	301
	302	#else /* ! __COVERITY__ */
	303
34c38d2a	304	#define assert_message_se(expr, message) \
dd8f71ee	305	do { \
93a46b0b	306	if (_unlikely_(!(expr))) \
34c38d2a MS	307	log_assert_failed(message, __FILE__, __LINE__, __PRETTY_FUNCTION__); \
	308	} while (false)
	309
d9fb7afb FB	310	#define assert_log(expr, message) ((_likely_(expr)) \
	311	? (true) \
	312	: (log_assert_failed_return(message, __FILE__, __LINE__, __PRETTY_FUNCTION__), false))
	313
	314	#endif /* __COVERITY__ */
	315
34c38d2a	316	#define assert_se(expr) assert_message_se(expr, #expr)
dd8f71ee LP	317
	318	/* We override the glibc assert() here. */
	319	#undef assert
	320	#ifdef NDEBUG
9ed794a3	321	#define assert(expr) do {} while (false)
dd8f71ee	322	#else
34c38d2a	323	#define assert(expr) assert_message_se(expr, #expr)
dd8f71ee	324	#endif
60918275	325
dd8f71ee LP	326	#define assert_not_reached(t) \
dd8f71ee LP	327	do { \
b7f33638	328	log_assert_failed_unreachable(t, __FILE__, __LINE__, __PRETTY_FUNCTION__); \
dd8f71ee	329	} while (false)
60918275	330
f791c684	331	#if defined(static_assert)
7ebe131a	332	#define assert_cc(expr) \
696c0b89	333	static_assert(expr, #expr);
f791c684	334	#else
7ebe131a	335	#define assert_cc(expr) \
6825a04d	336	struct CONCATENATE(_assert_struct_, __COUNTER__) { \
7ebe131a	337	char x[(expr) ? 0 : -1]; \
696c0b89	338	};
f791c684	339	#endif
60918275	340
80514f9c LP	341	#define assert_return(expr, r) \
80514f9c LP	342	do { \
34c38d2a	343	if (!assert_log(expr, #expr)) \
80514f9c	344	return (r); \
18387b59 LP	345	} while (false)
18387b59 LP	346
aa029628 TG	347	#define assert_return_errno(expr, r, err) \
aa029628 TG	348	do { \
34c38d2a	349	if (!assert_log(expr, #expr)) { \
aa029628 TG	350	errno = err; \
	351	return (r); \
	352	} \
	353	} while (false)
	354
fd05c424 YW	355	#define return_with_errno(r, err) \
	356	do { \
	357	errno = abs(err); \
	358	return r; \
	359	} while (false)
	360
a3dc3547 KS	361	#define PTR_TO_INT(p) ((int) ((intptr_t) (p)))
a3dc3547 KS	362	#define INT_TO_PTR(u) ((void *) ((intptr_t) (u)))
14cb109d	363	#define PTR_TO_UINT(p) ((unsigned) ((uintptr_t) (p)))
a3dc3547	364	#define UINT_TO_PTR(u) ((void *) ((uintptr_t) (u)))
60918275	365
a3dc3547 KS	366	#define PTR_TO_LONG(p) ((long) ((intptr_t) (p)))
a3dc3547 KS	367	#define LONG_TO_PTR(u) ((void *) ((intptr_t) (u)))
c6c18be3	368	#define PTR_TO_ULONG(p) ((unsigned long) ((uintptr_t) (p)))
a3dc3547	369	#define ULONG_TO_PTR(u) ((void *) ((uintptr_t) (u)))
c6c18be3	370
a3dc3547 KS	371	#define PTR_TO_INT32(p) ((int32_t) ((intptr_t) (p)))
	372	#define INT32_TO_PTR(u) ((void *) ((intptr_t) (u)))
	373	#define PTR_TO_UINT32(p) ((uint32_t) ((uintptr_t) (p)))
	374	#define UINT32_TO_PTR(u) ((void *) ((uintptr_t) (u)))
60918275	375
a3dc3547 KS	376	#define PTR_TO_INT64(p) ((int64_t) ((intptr_t) (p)))
	377	#define INT64_TO_PTR(u) ((void *) ((intptr_t) (u)))
	378	#define PTR_TO_UINT64(p) ((uint64_t) ((uintptr_t) (p)))
	379	#define UINT64_TO_PTR(u) ((void *) ((uintptr_t) (u)))
c6c18be3	380
74b2466e LP	381	#define PTR_TO_SIZE(p) ((size_t) ((uintptr_t) (p)))
	382	#define SIZE_TO_PTR(u) ((void *) ((uintptr_t) (u)))
	383
a9c55a88 LP	384	#define CHAR_TO_STR(x) ((char[2]) { x, 0 })
a9c55a88 LP	385
034c6ed7 LP	386	#define char_array_0(x) x[sizeof(x)-1] = 0;
034c6ed7 LP	387
fa70beaa LP	388	/* Returns the number of chars needed to format variables of the
fa70beaa LP	389	* specified type as a decimal string. Adds in extra space for a
b7ce6b59 LP	390	* negative '-' prefix (hence works correctly on signed
b7ce6b59 LP	391	* types). Includes space for the trailing NUL. */
fa70beaa	392	#define DECIMAL_STR_MAX(type) \
5bcb0f2b	393	(2+(sizeof(type) <= 1 ? 3 : \
fa70beaa LP	394	sizeof(type) <= 2 ? 5 : \
	395	sizeof(type) <= 4 ? 10 : \
	396	sizeof(type) <= 8 ? 20 : sizeof(int[-2*(sizeof(type) > 8)])))
	397
0d1dbeb3 LP	398	#define DECIMAL_STR_WIDTH(x) \
	399	({ \
	400	typeof(x) _x_ = (x); \
	401	unsigned ans = 1; \
ce2090ab	402	while ((_x_ /= 10) != 0) \
0d1dbeb3 LP	403	ans++; \
	404	ans; \
	405	})
	406
264ad849 LP	407	#define SET_FLAG(v, flag, b) \
264ad849 LP	408	(v) = (b) ? ((v) \| (flag)) : ((v) & ~(flag))
d94a24ca	409	#define FLAGS_SET(v, flags) \
222c8d4e	410	((~(v) & (flags)) == 0)
264ad849	411
d5b26d50 DM	412	#define CASE_F(X) case X:
	413	#define CASE_F_1(CASE, X) CASE_F(X)
	414	#define CASE_F_2(CASE, X, ...) CASE(X) CASE_F_1(CASE, __VA_ARGS__)
	415	#define CASE_F_3(CASE, X, ...) CASE(X) CASE_F_2(CASE, __VA_ARGS__)
	416	#define CASE_F_4(CASE, X, ...) CASE(X) CASE_F_3(CASE, __VA_ARGS__)
	417	#define CASE_F_5(CASE, X, ...) CASE(X) CASE_F_4(CASE, __VA_ARGS__)
	418	#define CASE_F_6(CASE, X, ...) CASE(X) CASE_F_5(CASE, __VA_ARGS__)
	419	#define CASE_F_7(CASE, X, ...) CASE(X) CASE_F_6(CASE, __VA_ARGS__)
	420	#define CASE_F_8(CASE, X, ...) CASE(X) CASE_F_7(CASE, __VA_ARGS__)
	421	#define CASE_F_9(CASE, X, ...) CASE(X) CASE_F_8(CASE, __VA_ARGS__)
	422	#define CASE_F_10(CASE, X, ...) CASE(X) CASE_F_9(CASE, __VA_ARGS__)
	423	#define CASE_F_11(CASE, X, ...) CASE(X) CASE_F_10(CASE, __VA_ARGS__)
	424	#define CASE_F_12(CASE, X, ...) CASE(X) CASE_F_11(CASE, __VA_ARGS__)
	425	#define CASE_F_13(CASE, X, ...) CASE(X) CASE_F_12(CASE, __VA_ARGS__)
	426	#define CASE_F_14(CASE, X, ...) CASE(X) CASE_F_13(CASE, __VA_ARGS__)
	427	#define CASE_F_15(CASE, X, ...) CASE(X) CASE_F_14(CASE, __VA_ARGS__)
	428	#define CASE_F_16(CASE, X, ...) CASE(X) CASE_F_15(CASE, __VA_ARGS__)
	429	#define CASE_F_17(CASE, X, ...) CASE(X) CASE_F_16(CASE, __VA_ARGS__)
	430	#define CASE_F_18(CASE, X, ...) CASE(X) CASE_F_17(CASE, __VA_ARGS__)
	431	#define CASE_F_19(CASE, X, ...) CASE(X) CASE_F_18(CASE, __VA_ARGS__)
	432	#define CASE_F_20(CASE, X, ...) CASE(X) CASE_F_19(CASE, __VA_ARGS__)
	433
	434	#define GET_CASE_F(_1,_2,_3,_4,_5,_6,_7,_8,_9,_10,_11,_12,_13,_14,_15,_16,_17,_18,_19,_20,NAME,...) NAME
	435	#define FOR_EACH_MAKE_CASE(...) \
	436	GET_CASE_F(__VA_ARGS__,CASE_F_20,CASE_F_19,CASE_F_18,CASE_F_17,CASE_F_16,CASE_F_15,CASE_F_14,CASE_F_13,CASE_F_12,CASE_F_11, \
	437	CASE_F_10,CASE_F_9,CASE_F_8,CASE_F_7,CASE_F_6,CASE_F_5,CASE_F_4,CASE_F_3,CASE_F_2,CASE_F_1) \
	438	(CASE_F,__VA_ARGS__)
	439
	440	#define IN_SET(x, ...) \
	441	({ \
	442	bool _found = false; \
8e2b6879 LP	443	/* If the build breaks in the line below, you need to extend the case macros. (We use "long double" as \
	444	* type for the array, in the hope that checkers such as ubsan don't complain that the initializers for \
	445	* the array are not representable by the base type. Ideally we'd use typeof(x) as base type, but that \
	446	* doesn't work, as we want to use this on bitfields and gcc refuses typeof() on bitfields.) */ \
	447	assert_cc((sizeof((long double[]){__VA_ARGS__})/sizeof(long double)) <= 20); \
d5b26d50 DM	448	switch(x) { \
	449	FOR_EACH_MAKE_CASE(__VA_ARGS__) \
	450	_found = true; \
	451	break; \
	452	default: \
	453	break; \
	454	} \
	455	_found; \
cabb7806 LP	456	})
cabb7806 LP	457
35aa04e9 LP	458	#define SWAP_TWO(x, y) do { \
	459	typeof(x) _t = (x); \
	460	(x) = (y); \
	461	(y) = (_t); \
	462	} while (false)
	463
919ce0b7 SL	464	/* Define C11 thread_local attribute even on older gcc compiler
919ce0b7 SL	465	* version */
ec202eae SL	466	#ifndef thread_local
	467	/*
	468	* Don't break on glibc < 2.16 that doesn't define __STDC_NO_THREADS__
	469	* see http://gcc.gnu.org/bugzilla/show_bug.cgi?id=53769
	470	*/
	471	#if __STDC_VERSION__ >= 201112L && !(defined(__STDC_NO_THREADS__) \|\| (defined(__GNU_LIBRARY__) && __GLIBC__ == 2 && __GLIBC_MINOR__ < 16))
	472	#define thread_local _Thread_local
	473	#else
	474	#define thread_local __thread
	475	#endif
	476	#endif
cabb7806	477
a2341f68 ZJS	478	#define DEFINE_TRIVIAL_CLEANUP_FUNC(type, func) \
	479	static inline void func##p(type *p) { \
	480	if (*p) \
	481	func(*p); \
f6a8265b	482	}
a2341f68	483
a6a08596 YW	484	#define _DEFINE_TRIVIAL_REF_FUNC(type, name, scope) \
	485	scope type name##_ref(type p) { \
	486	if (!p) \
	487	return NULL; \
	488	\
	489	assert(p->n_ref > 0); \
	490	p->n_ref++; \
	491	return p; \
	492	}
	493
	494	#define _DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func, scope) \
	495	scope type name##_unref(type p) { \
	496	if (!p) \
	497	return NULL; \
	498	\
	499	assert(p->n_ref > 0); \
	500	p->n_ref--; \
	501	if (p->n_ref > 0) \
	502	return NULL; \
	503	\
	504	return free_func(p); \
	505	}
	506
	507	#define DEFINE_TRIVIAL_REF_FUNC(type, name) \
	508	_DEFINE_TRIVIAL_REF_FUNC(type, name,)
	509	#define DEFINE_PRIVATE_TRIVIAL_REF_FUNC(type, name) \
	510	_DEFINE_TRIVIAL_REF_FUNC(type, name, static)
	511	#define DEFINE_PUBLIC_TRIVIAL_REF_FUNC(type, name) \
	512	_DEFINE_TRIVIAL_REF_FUNC(type, name, _public_)
	513
	514	#define DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func) \
	515	_DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func,)
	516	#define DEFINE_PRIVATE_TRIVIAL_UNREF_FUNC(type, name, free_func) \
	517	_DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func, static)
	518	#define DEFINE_PUBLIC_TRIVIAL_UNREF_FUNC(type, name, free_func) \
	519	_DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func, _public_)
	520
	521	#define DEFINE_TRIVIAL_REF_UNREF_FUNC(type, name, free_func) \
	522	DEFINE_TRIVIAL_REF_FUNC(type, name); \
	523	DEFINE_TRIVIAL_UNREF_FUNC(type, name, free_func);
	524
	525	#define DEFINE_PRIVATE_TRIVIAL_REF_UNREF_FUNC(type, name, free_func) \
	526	DEFINE_PRIVATE_TRIVIAL_REF_FUNC(type, name); \
	527	DEFINE_PRIVATE_TRIVIAL_UNREF_FUNC(type, name, free_func);
	528
	529	#define DEFINE_PUBLIC_TRIVIAL_REF_UNREF_FUNC(type, name, free_func) \
	530	DEFINE_PUBLIC_TRIVIAL_REF_FUNC(type, name); \
	531	DEFINE_PUBLIC_TRIVIAL_UNREF_FUNC(type, name, free_func);
	532
dd8f71ee	533	#include "log.h"