2017-11-18 17:09:20 +01:00
|
|
|
/* SPDX-License-Identifier: LGPL-2.1+ */
|
2012-07-18 19:07:51 +02:00
|
|
|
#pragma once
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2010-02-03 13:03:47 +01:00
|
|
|
/***
|
|
|
|
This file is part of systemd.
|
|
|
|
|
|
|
|
Copyright 2010 Lennart Poettering
|
|
|
|
|
|
|
|
systemd is free software; you can redistribute it and/or modify it
|
2012-04-12 00:20:58 +02:00
|
|
|
under the terms of the GNU Lesser General Public License as published by
|
|
|
|
the Free Software Foundation; either version 2.1 of the License, or
|
2010-02-03 13:03:47 +01:00
|
|
|
(at your option) any later version.
|
|
|
|
|
|
|
|
systemd is distributed in the hope that it will be useful, but
|
|
|
|
WITHOUT ANY WARRANTY; without even the implied warranty of
|
|
|
|
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
2012-04-12 00:20:58 +02:00
|
|
|
Lesser General Public License for more details.
|
2010-02-03 13:03:47 +01:00
|
|
|
|
2012-04-12 00:20:58 +02:00
|
|
|
You should have received a copy of the GNU Lesser General Public License
|
2010-02-03 13:03:47 +01:00
|
|
|
along with systemd; If not, see <http://www.gnu.org/licenses/>.
|
|
|
|
***/
|
|
|
|
|
2010-09-08 03:07:44 +02:00
|
|
|
#include <inttypes.h>
|
2015-07-09 19:46:20 +02:00
|
|
|
#include <stdbool.h>
|
2015-10-27 01:02:30 +01:00
|
|
|
#include <sys/param.h>
|
2016-03-14 22:44:49 +01:00
|
|
|
#include <sys/sysmacros.h>
|
2015-10-27 01:02:30 +01:00
|
|
|
#include <sys/types.h>
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2013-10-16 03:17:09 +02:00
|
|
|
#define _printf_(a,b) __attribute__ ((format (printf, a, b)))
|
2016-03-16 00:27:28 +01:00
|
|
|
#ifdef __clang__
|
|
|
|
# define _alloc_(...)
|
|
|
|
#else
|
|
|
|
# define _alloc_(...) __attribute__ ((alloc_size(__VA_ARGS__)))
|
|
|
|
#endif
|
2010-06-02 21:34:03 +02:00
|
|
|
#define _sentinel_ __attribute__ ((sentinel))
|
|
|
|
#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))
|
2010-06-21 19:17:47 +02:00
|
|
|
#define _public_ __attribute__ ((visibility("default")))
|
|
|
|
#define _hidden_ __attribute__ ((visibility("hidden")))
|
2010-07-16 03:07:53 +02:00
|
|
|
#define _weakref_(x) __attribute__((weakref(#x)))
|
2012-07-15 14:58:29 +02:00
|
|
|
#define _alignas_(x) __attribute__((aligned(__alignof(x))))
|
2013-04-16 05:25:57 +02:00
|
|
|
#define _cleanup_(x) __attribute__((cleanup(x)))
|
2017-11-24 10:08:12 +01:00
|
|
|
#if __GNUC__ >= 7
|
2017-11-19 19:06:10 +01:00
|
|
|
#define _fallthrough_ __attribute__((fallthrough))
|
2017-11-24 10:08:12 +01:00
|
|
|
#else
|
|
|
|
#define _fallthrough_
|
|
|
|
#endif
|
2018-03-15 06:23:46 +01:00
|
|
|
/* 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
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2014-02-20 18:05:56 +01:00
|
|
|
/* Temporarily disable some warnings */
|
|
|
|
#define DISABLE_WARNING_DECLARATION_AFTER_STATEMENT \
|
|
|
|
_Pragma("GCC diagnostic push"); \
|
|
|
|
_Pragma("GCC diagnostic ignored \"-Wdeclaration-after-statement\"")
|
|
|
|
|
2014-02-20 18:18:32 +01:00
|
|
|
#define DISABLE_WARNING_FORMAT_NONLITERAL \
|
|
|
|
_Pragma("GCC diagnostic push"); \
|
|
|
|
_Pragma("GCC diagnostic ignored \"-Wformat-nonliteral\"")
|
|
|
|
|
2014-02-20 18:35:03 +01:00
|
|
|
#define DISABLE_WARNING_MISSING_PROTOTYPES \
|
|
|
|
_Pragma("GCC diagnostic push"); \
|
|
|
|
_Pragma("GCC diagnostic ignored \"-Wmissing-prototypes\"")
|
|
|
|
|
2014-02-20 18:44:51 +01:00
|
|
|
#define DISABLE_WARNING_NONNULL \
|
|
|
|
_Pragma("GCC diagnostic push"); \
|
|
|
|
_Pragma("GCC diagnostic ignored \"-Wnonnull\"")
|
|
|
|
|
macro: add DISABLE_WARNING_SHADOW
As it turns out, we cannot use _Pragma in compound-statements. Therefore,
constructs like MIN(MAX(a, b), x) will warn due to shadowed variable
declarations. The DISABLE_WARNING_SHADOW macro can be used to suppress
these.
Note that using UNIQUE(_var) does not work either as GCC uses the last
line of a macro-expansion for __LINE__, therefore, still causing both
macros to have the same variables. We could use different variable-names
for MIN and MAX, but that just hides the problem and still fails for
MIN(something(MIN(a, b)), c).
The only working solution is to use __COUNTER__ and pass it pre-evaluated
as extra argument to a macro to use as name-prefix. This, however, makes
all these macros much more complicated so I'll go with manual
DISABLE_WARNING_SHADOW so far.
2014-06-12 17:54:48 +02:00
|
|
|
#define DISABLE_WARNING_SHADOW \
|
|
|
|
_Pragma("GCC diagnostic push"); \
|
|
|
|
_Pragma("GCC diagnostic ignored \"-Wshadow\"")
|
|
|
|
|
2014-01-02 06:02:31 +01:00
|
|
|
#define DISABLE_WARNING_INCOMPATIBLE_POINTER_TYPES \
|
|
|
|
_Pragma("GCC diagnostic push"); \
|
|
|
|
_Pragma("GCC diagnostic ignored \"-Wincompatible-pointer-types\"")
|
|
|
|
|
2014-02-20 18:05:56 +01:00
|
|
|
#define REENABLE_WARNING \
|
|
|
|
_Pragma("GCC diagnostic pop")
|
|
|
|
|
2013-03-27 02:07:46 +01:00
|
|
|
/* automake test harness */
|
|
|
|
#define EXIT_TEST_SKIP 77
|
|
|
|
|
2011-01-04 01:58:38 +01:00
|
|
|
#define XSTRINGIFY(x) #x
|
|
|
|
#define STRINGIFY(x) XSTRINGIFY(x)
|
|
|
|
|
2013-11-22 14:44:45 +01:00
|
|
|
#define XCONCATENATE(x, y) x ## y
|
|
|
|
#define CONCATENATE(x, y) XCONCATENATE(x, y)
|
|
|
|
|
shared: make container_of() use unique variable names
If you stack container_of() macros, you will get warnings due to shadowing
variables of the parent context. To avoid this, use unique names for
variables.
Two new helpers are added:
UNIQ: This evaluates to a truly unique value never returned by any
evaluation of this macro. It's a shortcut for __COUNTER__.
UNIQ_T: Takes two arguments and concatenates them. It is a shortcut for
CONCATENATE, but meant to defined typed local variables.
As you usually want to use variables that you just defined, you need to
reference the same unique value at least two times. However, UNIQ returns
a new value on each evaluation, therefore, you have to pass the unique
values into the macro like this:
#define my_macro(a, b) __max_macro(UNIQ, UNIQ, (a), (b))
#define __my_macro(uniqa, uniqb, a, b) ({
typeof(a) UNIQ_T(A, uniqa) = (a);
typeof(b) UNIQ_T(B, uniqb) = (b);
MY_UNSAFE_MACRO(UNIQ_T(A, uniqa), UNIQ_T(B, uniqb));
})
This way, MY_UNSAFE_MACRO() can safely evaluate it's arguments multiple
times as they are local variables. But you can also stack invocations to
the macro my_macro() without clashing names.
This is the same as if you did:
#define my_macro(a, b) __max_macro(__COUNTER__, __COUNTER__, (a), (b))
#define __my_macro(prefixa, prefixb, a, b) ({
typeof(a) CONCATENATE(A, prefixa) = (a);
typeof(b) CONCATENATE(B, prefixb) = (b);
MY_UNSAFE_MACRO(CONCATENATE(A, prefixa), CONCATENATE(B, prefixb));
})
...but in my opinion, the first macro is easier to write and read.
This patch starts by converting container_of() to use this new helper.
Other macros may follow (like MIN, MAX, CLAMP, ...).
2014-08-22 14:41:37 +02:00
|
|
|
#define UNIQ_T(x, uniq) CONCATENATE(__unique_prefix_, CONCATENATE(x, uniq))
|
|
|
|
#define UNIQ __COUNTER__
|
|
|
|
|
2016-06-01 15:18:21 +02:00
|
|
|
/* 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
|
|
|
|
|
2009-11-18 00:42:52 +01:00
|
|
|
/* Rounds up */
|
2013-04-11 02:07:14 +02:00
|
|
|
|
|
|
|
#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
|
|
|
|
|
2014-12-06 02:39:15 +01:00
|
|
|
#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)))
|
2013-04-12 21:43:50 +02:00
|
|
|
|
2011-03-18 03:03:41 +01:00
|
|
|
static inline size_t ALIGN_TO(size_t l, size_t ali) {
|
|
|
|
return ((l + ali - 1) & ~(ali - 1));
|
2010-09-23 15:01:41 +02:00
|
|
|
}
|
|
|
|
|
2014-12-06 02:39:15 +01:00
|
|
|
#define ALIGN_TO_PTR(p, ali) ((void*) ALIGN_TO((unsigned long) (p), (ali)))
|
2013-04-16 14:50:05 +02:00
|
|
|
|
2014-05-13 19:47:58 +02:00
|
|
|
/* 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));
|
|
|
|
}
|
|
|
|
|
2018-01-04 09:45:23 +01:00
|
|
|
#ifndef __COVERITY__
|
|
|
|
# define VOID_0 ((void)0)
|
|
|
|
#else
|
|
|
|
# define VOID_0 ((void*)0)
|
|
|
|
#endif
|
|
|
|
|
2015-09-14 20:32:17 +02:00
|
|
|
#define ELEMENTSOF(x) \
|
|
|
|
__extension__ (__builtin_choose_expr( \
|
|
|
|
!__builtin_types_compatible_p(typeof(x), typeof(&*(x))), \
|
|
|
|
sizeof(x)/sizeof((x)[0]), \
|
2018-01-04 09:45:23 +01:00
|
|
|
VOID_0))
|
2017-12-13 08:17:07 +01:00
|
|
|
|
|
|
|
/*
|
|
|
|
* 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)
|
|
|
|
|
2012-05-07 21:06:55 +02:00
|
|
|
/*
|
|
|
|
* 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.
|
|
|
|
*/
|
shared: make container_of() use unique variable names
If you stack container_of() macros, you will get warnings due to shadowing
variables of the parent context. To avoid this, use unique names for
variables.
Two new helpers are added:
UNIQ: This evaluates to a truly unique value never returned by any
evaluation of this macro. It's a shortcut for __COUNTER__.
UNIQ_T: Takes two arguments and concatenates them. It is a shortcut for
CONCATENATE, but meant to defined typed local variables.
As you usually want to use variables that you just defined, you need to
reference the same unique value at least two times. However, UNIQ returns
a new value on each evaluation, therefore, you have to pass the unique
values into the macro like this:
#define my_macro(a, b) __max_macro(UNIQ, UNIQ, (a), (b))
#define __my_macro(uniqa, uniqb, a, b) ({
typeof(a) UNIQ_T(A, uniqa) = (a);
typeof(b) UNIQ_T(B, uniqb) = (b);
MY_UNSAFE_MACRO(UNIQ_T(A, uniqa), UNIQ_T(B, uniqb));
})
This way, MY_UNSAFE_MACRO() can safely evaluate it's arguments multiple
times as they are local variables. But you can also stack invocations to
the macro my_macro() without clashing names.
This is the same as if you did:
#define my_macro(a, b) __max_macro(__COUNTER__, __COUNTER__, (a), (b))
#define __my_macro(prefixa, prefixb, a, b) ({
typeof(a) CONCATENATE(A, prefixa) = (a);
typeof(b) CONCATENATE(B, prefixb) = (b);
MY_UNSAFE_MACRO(CONCATENATE(A, prefixa), CONCATENATE(B, prefixb));
})
...but in my opinion, the first macro is easier to write and read.
This patch starts by converting container_of() to use this new helper.
Other macros may follow (like MIN, MAX, CLAMP, ...).
2014-08-22 14:41:37 +02:00
|
|
|
#define container_of(ptr, type, member) __container_of(UNIQ, (ptr), type, member)
|
|
|
|
#define __container_of(uniq, ptr, type, member) \
|
2013-04-02 17:33:19 +02:00
|
|
|
__extension__ ({ \
|
shared: make container_of() use unique variable names
If you stack container_of() macros, you will get warnings due to shadowing
variables of the parent context. To avoid this, use unique names for
variables.
Two new helpers are added:
UNIQ: This evaluates to a truly unique value never returned by any
evaluation of this macro. It's a shortcut for __COUNTER__.
UNIQ_T: Takes two arguments and concatenates them. It is a shortcut for
CONCATENATE, but meant to defined typed local variables.
As you usually want to use variables that you just defined, you need to
reference the same unique value at least two times. However, UNIQ returns
a new value on each evaluation, therefore, you have to pass the unique
values into the macro like this:
#define my_macro(a, b) __max_macro(UNIQ, UNIQ, (a), (b))
#define __my_macro(uniqa, uniqb, a, b) ({
typeof(a) UNIQ_T(A, uniqa) = (a);
typeof(b) UNIQ_T(B, uniqb) = (b);
MY_UNSAFE_MACRO(UNIQ_T(A, uniqa), UNIQ_T(B, uniqb));
})
This way, MY_UNSAFE_MACRO() can safely evaluate it's arguments multiple
times as they are local variables. But you can also stack invocations to
the macro my_macro() without clashing names.
This is the same as if you did:
#define my_macro(a, b) __max_macro(__COUNTER__, __COUNTER__, (a), (b))
#define __my_macro(prefixa, prefixb, a, b) ({
typeof(a) CONCATENATE(A, prefixa) = (a);
typeof(b) CONCATENATE(B, prefixb) = (b);
MY_UNSAFE_MACRO(CONCATENATE(A, prefixa), CONCATENATE(B, prefixb));
})
...but in my opinion, the first macro is easier to write and read.
This patch starts by converting container_of() to use this new helper.
Other macros may follow (like MIN, MAX, CLAMP, ...).
2014-08-22 14:41:37 +02:00
|
|
|
const typeof( ((type*)0)->member ) *UNIQ_T(A, uniq) = (ptr); \
|
|
|
|
(type*)( (char *)UNIQ_T(A, uniq) - offsetof(type,member) ); \
|
|
|
|
})
|
2012-05-07 21:06:55 +02:00
|
|
|
|
2013-04-01 08:08:05 +02:00
|
|
|
#undef MAX
|
2014-08-28 14:45:38 +02:00
|
|
|
#define MAX(a, b) __MAX(UNIQ, (a), UNIQ, (b))
|
|
|
|
#define __MAX(aq, a, bq, b) \
|
2014-08-15 16:16:30 +02:00
|
|
|
__extension__ ({ \
|
2014-08-28 14:45:38 +02:00
|
|
|
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); \
|
|
|
|
})
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2014-08-15 16:54:52 +02:00
|
|
|
/* evaluates to (void) if _A or _B are not constant or of different types */
|
|
|
|
#define CONST_MAX(_A, _B) \
|
|
|
|
__extension__ (__builtin_choose_expr( \
|
|
|
|
__builtin_constant_p(_A) && \
|
|
|
|
__builtin_constant_p(_B) && \
|
|
|
|
__builtin_types_compatible_p(typeof(_A), typeof(_B)), \
|
|
|
|
((_A) > (_B)) ? (_A) : (_B), \
|
2018-01-04 09:45:23 +01:00
|
|
|
VOID_0))
|
2014-08-15 16:54:52 +02:00
|
|
|
|
2014-08-22 13:55:57 +02:00
|
|
|
/* takes two types and returns the size of the larger one */
|
|
|
|
#define MAXSIZE(A, B) (sizeof(union _packed_ { typeof(A) a; typeof(B) b; }))
|
|
|
|
|
2014-08-15 16:16:30 +02:00
|
|
|
#define MAX3(x,y,z) \
|
|
|
|
__extension__ ({ \
|
|
|
|
const typeof(x) _c = MAX(x,y); \
|
|
|
|
MAX(_c, z); \
|
2013-04-01 08:08:05 +02:00
|
|
|
})
|
2010-10-18 22:38:41 +02:00
|
|
|
|
2013-04-01 08:08:05 +02:00
|
|
|
#undef MIN
|
2014-08-28 14:45:38 +02:00
|
|
|
#define MIN(a, b) __MIN(UNIQ, (a), UNIQ, (b))
|
|
|
|
#define __MIN(aq, a, bq, b) \
|
2014-08-15 16:16:30 +02:00
|
|
|
__extension__ ({ \
|
2014-08-28 14:45:38 +02:00
|
|
|
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); \
|
|
|
|
})
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2014-08-15 16:16:30 +02:00
|
|
|
#define MIN3(x,y,z) \
|
|
|
|
__extension__ ({ \
|
|
|
|
const typeof(x) _c = MIN(x,y); \
|
|
|
|
MIN(_c, z); \
|
2014-06-30 15:43:40 +02:00
|
|
|
})
|
|
|
|
|
2014-08-28 14:45:38 +02:00
|
|
|
#define LESS_BY(a, b) __LESS_BY(UNIQ, (a), UNIQ, (b))
|
|
|
|
#define __LESS_BY(aq, a, bq, b) \
|
2014-08-15 16:16:30 +02:00
|
|
|
__extension__ ({ \
|
2014-08-28 14:45:38 +02:00
|
|
|
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; \
|
|
|
|
})
|
journald: do not free space when disk space runs low
Before, journald would remove journal files until both MaxUse= and
KeepFree= settings would be satisfied. The first one depends (if set
automatically) on the size of the file system and is constant. But
the second one depends on current use of the file system, and a spike
in disk usage would cause journald to delete journal files, trying to
reach usage which would leave 15% of the disk free. This behaviour is
surprising for the user who doesn't expect his logs to be purged when
disk usage goes above 85%, which on a large disk could be some
gigabytes from being full. In addition attempting to keep 15% free
provides an attack vector where filling the disk sufficiently disposes
of almost all logs.
Instead, obey KeepFree= only as a limit on adding additional files.
When replacing old files with new, ignore KeepFree=. This means that
if journal disk usage reached some high point that at some later point
start to violate the KeepFree= constraint, journald will not add files
to go above this point, but it will stay (slightly) below it. When
journald is restarted, it forgets the previous maximum usage value,
and sets the limit based on the current usage, so if disk remains to
be filled, journald might use one journal-file-size less on each
restart, if restarts happen just after rotation. This seems like a
reasonable compromise between implementation complexity and robustness.
2013-11-13 06:42:22 +01:00
|
|
|
|
2014-08-28 14:45:38 +02:00
|
|
|
#undef CLAMP
|
|
|
|
#define CLAMP(x, low, high) __CLAMP(UNIQ, (x), UNIQ, (low), UNIQ, (high))
|
|
|
|
#define __CLAMP(xq, x, lowq, low, highq, high) \
|
2009-11-18 00:42:52 +01:00
|
|
|
__extension__ ({ \
|
2014-08-28 14:45:38 +02:00
|
|
|
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); \
|
|
|
|
})
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2014-12-29 17:51:36 +01:00
|
|
|
/* [(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) \
|
|
|
|
__extension__ ({ \
|
|
|
|
const typeof(_x) __x = (_x); \
|
|
|
|
const typeof(_y) __y = (_y); \
|
|
|
|
(__x / __y + !!(__x % __y)); \
|
|
|
|
})
|
|
|
|
|
basic: nicer assert messages
Make sure the assert expression is not macro-expanded before
stringification. This makes several assertion failure messages more
readable.
As an example:
assert(streq("foo", "bar"));
I'd rather see this:
Assertion 'streq("foo", "bar")' failed at foo.c:5, function main(). Aborting.
...than this, though awesome, incomprehensible truncated mess:
Assertion '(__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p ((
"foo")) && __builtin_constant_p (("bar")) && (__s1_len = strlen (("foo")), __s2_
len = strlen (("bar")), (!((size_t)(const void *)((("foo")) + 1) - (size_t)(cons
t void *)(("foo")) == 1) || __s1_len >= 4) && (!((size_t)(const void *)((("bar")
) + 1) - (size_t)(const void *)(("bar")) == 1) || __s2_len >= 4)) ? __builtin_st
rcmp (("foo"), ("bar")) : (__builtin_constant_p (("foo")) && ((size_t)(const voi
d *)((("foo")) + 1) - (size_t)(const void *)(("foo")) == 1) && (__s1_len = strle
n (("foo")), __s1_len < 4) ? (__builtin_constant_p (("bar")) && ((size_t)(const
void *)((("bar")) + 1) - (size_t)(const void *)(("bar")) == 1) ? __builtin_strcm
p (("foo"), ("bar")) : (__extension__ ({ const unsigned char *__s2 = (const unsi
gned char *) (const char *) (("bar")); int __result = (((const unsigned char *)
(const char *) (("foo")))[0] - __s2[0]); if (__s1_len > 0 && __result == 0) { __
result = (((const unsigned char *) (const char *) (("foo")))[1] - __s2[1]); if (
__s1_len > 1 && __result == 0) { __result = (((const unsigned char *) (const cha
r *) (("foo")))[2] - __s2[2]); if (__s1_len > 2 && __result == 0) __result = (((
const unsigned char *) (const char *) (("foo")))[3] - __s2[3]); } } __result; })
)) : (__builtin_constant_p (("bar")) && ((size_t)(const void *)((("bar")) + 1) -
(size_t)(const void *)(("bar")) == 1) && (__s2_len = strlen (("bar")), __s2_len
< 4) ? (__builtin_constant_p (("foo")) && ((size_t)(const void *)((("foo")) + 1
) - (size_t)(const void *)(("foo")) == 1) ? __builtin_strcmp (("foo"), ("bar"))
: (- (__extension__ ({ const unsigned char *__s2 = (const unsigned char *) (cons
t char *) (("foo")); int __result = (((const unsigned char *) (const char *) (("
bar")))[0] - __s2[0]); if (__s2_len > 0 && __result == 0) { __result = (((const
unsigned char *) (const char *) (("bar")))[1] - __s2[1]); if (__s2_len > 1 && __
result == 0) { __result = (((const unsigned char *) (const char *) (("bar")))[2]
- __s2[2]); if (__s2_len > 2 && __result == 0)
2015-09-14 15:53:36 +02:00
|
|
|
#define assert_message_se(expr, message) \
|
2010-04-13 03:59:39 +02:00
|
|
|
do { \
|
2010-06-02 21:34:03 +02:00
|
|
|
if (_unlikely_(!(expr))) \
|
basic: nicer assert messages
Make sure the assert expression is not macro-expanded before
stringification. This makes several assertion failure messages more
readable.
As an example:
assert(streq("foo", "bar"));
I'd rather see this:
Assertion 'streq("foo", "bar")' failed at foo.c:5, function main(). Aborting.
...than this, though awesome, incomprehensible truncated mess:
Assertion '(__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p ((
"foo")) && __builtin_constant_p (("bar")) && (__s1_len = strlen (("foo")), __s2_
len = strlen (("bar")), (!((size_t)(const void *)((("foo")) + 1) - (size_t)(cons
t void *)(("foo")) == 1) || __s1_len >= 4) && (!((size_t)(const void *)((("bar")
) + 1) - (size_t)(const void *)(("bar")) == 1) || __s2_len >= 4)) ? __builtin_st
rcmp (("foo"), ("bar")) : (__builtin_constant_p (("foo")) && ((size_t)(const voi
d *)((("foo")) + 1) - (size_t)(const void *)(("foo")) == 1) && (__s1_len = strle
n (("foo")), __s1_len < 4) ? (__builtin_constant_p (("bar")) && ((size_t)(const
void *)((("bar")) + 1) - (size_t)(const void *)(("bar")) == 1) ? __builtin_strcm
p (("foo"), ("bar")) : (__extension__ ({ const unsigned char *__s2 = (const unsi
gned char *) (const char *) (("bar")); int __result = (((const unsigned char *)
(const char *) (("foo")))[0] - __s2[0]); if (__s1_len > 0 && __result == 0) { __
result = (((const unsigned char *) (const char *) (("foo")))[1] - __s2[1]); if (
__s1_len > 1 && __result == 0) { __result = (((const unsigned char *) (const cha
r *) (("foo")))[2] - __s2[2]); if (__s1_len > 2 && __result == 0) __result = (((
const unsigned char *) (const char *) (("foo")))[3] - __s2[3]); } } __result; })
)) : (__builtin_constant_p (("bar")) && ((size_t)(const void *)((("bar")) + 1) -
(size_t)(const void *)(("bar")) == 1) && (__s2_len = strlen (("bar")), __s2_len
< 4) ? (__builtin_constant_p (("foo")) && ((size_t)(const void *)((("foo")) + 1
) - (size_t)(const void *)(("foo")) == 1) ? __builtin_strcmp (("foo"), ("bar"))
: (- (__extension__ ({ const unsigned char *__s2 = (const unsigned char *) (cons
t char *) (("foo")); int __result = (((const unsigned char *) (const char *) (("
bar")))[0] - __s2[0]); if (__s2_len > 0 && __result == 0) { __result = (((const
unsigned char *) (const char *) (("bar")))[1] - __s2[1]); if (__s2_len > 1 && __
result == 0) { __result = (((const unsigned char *) (const char *) (("bar")))[2]
- __s2[2]); if (__s2_len > 2 && __result == 0)
2015-09-14 15:53:36 +02:00
|
|
|
log_assert_failed(message, __FILE__, __LINE__, __PRETTY_FUNCTION__); \
|
|
|
|
} while (false)
|
|
|
|
|
|
|
|
#define assert_se(expr) assert_message_se(expr, #expr)
|
2010-04-13 03:59:39 +02:00
|
|
|
|
|
|
|
/* We override the glibc assert() here. */
|
|
|
|
#undef assert
|
|
|
|
#ifdef NDEBUG
|
2016-02-23 18:52:52 +01:00
|
|
|
#define assert(expr) do {} while (false)
|
2010-04-13 03:59:39 +02:00
|
|
|
#else
|
basic: nicer assert messages
Make sure the assert expression is not macro-expanded before
stringification. This makes several assertion failure messages more
readable.
As an example:
assert(streq("foo", "bar"));
I'd rather see this:
Assertion 'streq("foo", "bar")' failed at foo.c:5, function main(). Aborting.
...than this, though awesome, incomprehensible truncated mess:
Assertion '(__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p ((
"foo")) && __builtin_constant_p (("bar")) && (__s1_len = strlen (("foo")), __s2_
len = strlen (("bar")), (!((size_t)(const void *)((("foo")) + 1) - (size_t)(cons
t void *)(("foo")) == 1) || __s1_len >= 4) && (!((size_t)(const void *)((("bar")
) + 1) - (size_t)(const void *)(("bar")) == 1) || __s2_len >= 4)) ? __builtin_st
rcmp (("foo"), ("bar")) : (__builtin_constant_p (("foo")) && ((size_t)(const voi
d *)((("foo")) + 1) - (size_t)(const void *)(("foo")) == 1) && (__s1_len = strle
n (("foo")), __s1_len < 4) ? (__builtin_constant_p (("bar")) && ((size_t)(const
void *)((("bar")) + 1) - (size_t)(const void *)(("bar")) == 1) ? __builtin_strcm
p (("foo"), ("bar")) : (__extension__ ({ const unsigned char *__s2 = (const unsi
gned char *) (const char *) (("bar")); int __result = (((const unsigned char *)
(const char *) (("foo")))[0] - __s2[0]); if (__s1_len > 0 && __result == 0) { __
result = (((const unsigned char *) (const char *) (("foo")))[1] - __s2[1]); if (
__s1_len > 1 && __result == 0) { __result = (((const unsigned char *) (const cha
r *) (("foo")))[2] - __s2[2]); if (__s1_len > 2 && __result == 0) __result = (((
const unsigned char *) (const char *) (("foo")))[3] - __s2[3]); } } __result; })
)) : (__builtin_constant_p (("bar")) && ((size_t)(const void *)((("bar")) + 1) -
(size_t)(const void *)(("bar")) == 1) && (__s2_len = strlen (("bar")), __s2_len
< 4) ? (__builtin_constant_p (("foo")) && ((size_t)(const void *)((("foo")) + 1
) - (size_t)(const void *)(("foo")) == 1) ? __builtin_strcmp (("foo"), ("bar"))
: (- (__extension__ ({ const unsigned char *__s2 = (const unsigned char *) (cons
t char *) (("foo")); int __result = (((const unsigned char *) (const char *) (("
bar")))[0] - __s2[0]); if (__s2_len > 0 && __result == 0) { __result = (((const
unsigned char *) (const char *) (("bar")))[1] - __s2[1]); if (__s2_len > 1 && __
result == 0) { __result = (((const unsigned char *) (const char *) (("bar")))[2]
- __s2[2]); if (__s2_len > 2 && __result == 0)
2015-09-14 15:53:36 +02:00
|
|
|
#define assert(expr) assert_message_se(expr, #expr)
|
2010-04-13 03:59:39 +02:00
|
|
|
#endif
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2010-04-13 03:59:39 +02:00
|
|
|
#define assert_not_reached(t) \
|
|
|
|
do { \
|
2012-01-17 12:05:33 +01:00
|
|
|
log_assert_failed_unreachable(t, __FILE__, __LINE__, __PRETTY_FUNCTION__); \
|
2010-04-13 03:59:39 +02:00
|
|
|
} while (false)
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2012-12-25 11:52:14 +01:00
|
|
|
#if defined(static_assert)
|
2014-02-20 18:05:56 +01:00
|
|
|
/* static_assert() is sometimes defined in a way that trips up
|
|
|
|
* -Wdeclaration-after-statement, hence let's temporarily turn off
|
|
|
|
* this warning around it. */
|
|
|
|
#define assert_cc(expr) \
|
|
|
|
DISABLE_WARNING_DECLARATION_AFTER_STATEMENT; \
|
|
|
|
static_assert(expr, #expr); \
|
|
|
|
REENABLE_WARNING
|
2012-12-25 11:52:14 +01:00
|
|
|
#else
|
2014-02-20 18:05:56 +01:00
|
|
|
#define assert_cc(expr) \
|
|
|
|
DISABLE_WARNING_DECLARATION_AFTER_STATEMENT; \
|
2015-01-23 15:06:00 +01:00
|
|
|
struct CONCATENATE(_assert_struct_, __COUNTER__) { \
|
2014-02-20 18:05:56 +01:00
|
|
|
char x[(expr) ? 0 : -1]; \
|
|
|
|
}; \
|
|
|
|
REENABLE_WARNING
|
2012-12-25 11:52:14 +01:00
|
|
|
#endif
|
2009-11-18 00:42:52 +01:00
|
|
|
|
basic: nicer assert messages
Make sure the assert expression is not macro-expanded before
stringification. This makes several assertion failure messages more
readable.
As an example:
assert(streq("foo", "bar"));
I'd rather see this:
Assertion 'streq("foo", "bar")' failed at foo.c:5, function main(). Aborting.
...than this, though awesome, incomprehensible truncated mess:
Assertion '(__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p ((
"foo")) && __builtin_constant_p (("bar")) && (__s1_len = strlen (("foo")), __s2_
len = strlen (("bar")), (!((size_t)(const void *)((("foo")) + 1) - (size_t)(cons
t void *)(("foo")) == 1) || __s1_len >= 4) && (!((size_t)(const void *)((("bar")
) + 1) - (size_t)(const void *)(("bar")) == 1) || __s2_len >= 4)) ? __builtin_st
rcmp (("foo"), ("bar")) : (__builtin_constant_p (("foo")) && ((size_t)(const voi
d *)((("foo")) + 1) - (size_t)(const void *)(("foo")) == 1) && (__s1_len = strle
n (("foo")), __s1_len < 4) ? (__builtin_constant_p (("bar")) && ((size_t)(const
void *)((("bar")) + 1) - (size_t)(const void *)(("bar")) == 1) ? __builtin_strcm
p (("foo"), ("bar")) : (__extension__ ({ const unsigned char *__s2 = (const unsi
gned char *) (const char *) (("bar")); int __result = (((const unsigned char *)
(const char *) (("foo")))[0] - __s2[0]); if (__s1_len > 0 && __result == 0) { __
result = (((const unsigned char *) (const char *) (("foo")))[1] - __s2[1]); if (
__s1_len > 1 && __result == 0) { __result = (((const unsigned char *) (const cha
r *) (("foo")))[2] - __s2[2]); if (__s1_len > 2 && __result == 0) __result = (((
const unsigned char *) (const char *) (("foo")))[3] - __s2[3]); } } __result; })
)) : (__builtin_constant_p (("bar")) && ((size_t)(const void *)((("bar")) + 1) -
(size_t)(const void *)(("bar")) == 1) && (__s2_len = strlen (("bar")), __s2_len
< 4) ? (__builtin_constant_p (("foo")) && ((size_t)(const void *)((("foo")) + 1
) - (size_t)(const void *)(("foo")) == 1) ? __builtin_strcmp (("foo"), ("bar"))
: (- (__extension__ ({ const unsigned char *__s2 = (const unsigned char *) (cons
t char *) (("foo")); int __result = (((const unsigned char *) (const char *) (("
bar")))[0] - __s2[0]); if (__s2_len > 0 && __result == 0) { __result = (((const
unsigned char *) (const char *) (("bar")))[1] - __s2[1]); if (__s2_len > 1 && __
result == 0) { __result = (((const unsigned char *) (const char *) (("bar")))[2]
- __s2[2]); if (__s2_len > 2 && __result == 0)
2015-09-14 15:53:36 +02:00
|
|
|
#define assert_log(expr, message) ((_likely_(expr)) \
|
|
|
|
? (true) \
|
|
|
|
: (log_assert_failed_return(message, __FILE__, __LINE__, __PRETTY_FUNCTION__), false))
|
2015-06-17 01:15:09 +02:00
|
|
|
|
2013-12-10 18:01:10 +01:00
|
|
|
#define assert_return(expr, r) \
|
|
|
|
do { \
|
basic: nicer assert messages
Make sure the assert expression is not macro-expanded before
stringification. This makes several assertion failure messages more
readable.
As an example:
assert(streq("foo", "bar"));
I'd rather see this:
Assertion 'streq("foo", "bar")' failed at foo.c:5, function main(). Aborting.
...than this, though awesome, incomprehensible truncated mess:
Assertion '(__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p ((
"foo")) && __builtin_constant_p (("bar")) && (__s1_len = strlen (("foo")), __s2_
len = strlen (("bar")), (!((size_t)(const void *)((("foo")) + 1) - (size_t)(cons
t void *)(("foo")) == 1) || __s1_len >= 4) && (!((size_t)(const void *)((("bar")
) + 1) - (size_t)(const void *)(("bar")) == 1) || __s2_len >= 4)) ? __builtin_st
rcmp (("foo"), ("bar")) : (__builtin_constant_p (("foo")) && ((size_t)(const voi
d *)((("foo")) + 1) - (size_t)(const void *)(("foo")) == 1) && (__s1_len = strle
n (("foo")), __s1_len < 4) ? (__builtin_constant_p (("bar")) && ((size_t)(const
void *)((("bar")) + 1) - (size_t)(const void *)(("bar")) == 1) ? __builtin_strcm
p (("foo"), ("bar")) : (__extension__ ({ const unsigned char *__s2 = (const unsi
gned char *) (const char *) (("bar")); int __result = (((const unsigned char *)
(const char *) (("foo")))[0] - __s2[0]); if (__s1_len > 0 && __result == 0) { __
result = (((const unsigned char *) (const char *) (("foo")))[1] - __s2[1]); if (
__s1_len > 1 && __result == 0) { __result = (((const unsigned char *) (const cha
r *) (("foo")))[2] - __s2[2]); if (__s1_len > 2 && __result == 0) __result = (((
const unsigned char *) (const char *) (("foo")))[3] - __s2[3]); } } __result; })
)) : (__builtin_constant_p (("bar")) && ((size_t)(const void *)((("bar")) + 1) -
(size_t)(const void *)(("bar")) == 1) && (__s2_len = strlen (("bar")), __s2_len
< 4) ? (__builtin_constant_p (("foo")) && ((size_t)(const void *)((("foo")) + 1
) - (size_t)(const void *)(("foo")) == 1) ? __builtin_strcmp (("foo"), ("bar"))
: (- (__extension__ ({ const unsigned char *__s2 = (const unsigned char *) (cons
t char *) (("foo")); int __result = (((const unsigned char *) (const char *) (("
bar")))[0] - __s2[0]); if (__s2_len > 0 && __result == 0) { __result = (((const
unsigned char *) (const char *) (("bar")))[1] - __s2[1]); if (__s2_len > 1 && __
result == 0) { __result = (((const unsigned char *) (const char *) (("bar")))[2]
- __s2[2]); if (__s2_len > 2 && __result == 0)
2015-09-14 15:53:36 +02:00
|
|
|
if (!assert_log(expr, #expr)) \
|
2013-12-10 18:01:10 +01:00
|
|
|
return (r); \
|
2013-10-11 00:45:47 +02:00
|
|
|
} while (false)
|
|
|
|
|
2015-04-10 20:39:43 +02:00
|
|
|
#define assert_return_errno(expr, r, err) \
|
|
|
|
do { \
|
basic: nicer assert messages
Make sure the assert expression is not macro-expanded before
stringification. This makes several assertion failure messages more
readable.
As an example:
assert(streq("foo", "bar"));
I'd rather see this:
Assertion 'streq("foo", "bar")' failed at foo.c:5, function main(). Aborting.
...than this, though awesome, incomprehensible truncated mess:
Assertion '(__extension__ ({ size_t __s1_len, __s2_len; (__builtin_constant_p ((
"foo")) && __builtin_constant_p (("bar")) && (__s1_len = strlen (("foo")), __s2_
len = strlen (("bar")), (!((size_t)(const void *)((("foo")) + 1) - (size_t)(cons
t void *)(("foo")) == 1) || __s1_len >= 4) && (!((size_t)(const void *)((("bar")
) + 1) - (size_t)(const void *)(("bar")) == 1) || __s2_len >= 4)) ? __builtin_st
rcmp (("foo"), ("bar")) : (__builtin_constant_p (("foo")) && ((size_t)(const voi
d *)((("foo")) + 1) - (size_t)(const void *)(("foo")) == 1) && (__s1_len = strle
n (("foo")), __s1_len < 4) ? (__builtin_constant_p (("bar")) && ((size_t)(const
void *)((("bar")) + 1) - (size_t)(const void *)(("bar")) == 1) ? __builtin_strcm
p (("foo"), ("bar")) : (__extension__ ({ const unsigned char *__s2 = (const unsi
gned char *) (const char *) (("bar")); int __result = (((const unsigned char *)
(const char *) (("foo")))[0] - __s2[0]); if (__s1_len > 0 && __result == 0) { __
result = (((const unsigned char *) (const char *) (("foo")))[1] - __s2[1]); if (
__s1_len > 1 && __result == 0) { __result = (((const unsigned char *) (const cha
r *) (("foo")))[2] - __s2[2]); if (__s1_len > 2 && __result == 0) __result = (((
const unsigned char *) (const char *) (("foo")))[3] - __s2[3]); } } __result; })
)) : (__builtin_constant_p (("bar")) && ((size_t)(const void *)((("bar")) + 1) -
(size_t)(const void *)(("bar")) == 1) && (__s2_len = strlen (("bar")), __s2_len
< 4) ? (__builtin_constant_p (("foo")) && ((size_t)(const void *)((("foo")) + 1
) - (size_t)(const void *)(("foo")) == 1) ? __builtin_strcmp (("foo"), ("bar"))
: (- (__extension__ ({ const unsigned char *__s2 = (const unsigned char *) (cons
t char *) (("foo")); int __result = (((const unsigned char *) (const char *) (("
bar")))[0] - __s2[0]); if (__s2_len > 0 && __result == 0) { __result = (((const
unsigned char *) (const char *) (("bar")))[1] - __s2[1]); if (__s2_len > 1 && __
result == 0) { __result = (((const unsigned char *) (const char *) (("bar")))[2]
- __s2[2]); if (__s2_len > 2 && __result == 0)
2015-09-14 15:53:36 +02:00
|
|
|
if (!assert_log(expr, #expr)) { \
|
2015-04-10 20:39:43 +02:00
|
|
|
errno = err; \
|
|
|
|
return (r); \
|
|
|
|
} \
|
|
|
|
} while (false)
|
|
|
|
|
2013-05-14 16:13:52 +02:00
|
|
|
#define PTR_TO_INT(p) ((int) ((intptr_t) (p)))
|
|
|
|
#define INT_TO_PTR(u) ((void *) ((intptr_t) (u)))
|
2009-11-18 00:42:52 +01:00
|
|
|
#define PTR_TO_UINT(p) ((unsigned int) ((uintptr_t) (p)))
|
2013-05-14 16:13:52 +02:00
|
|
|
#define UINT_TO_PTR(u) ((void *) ((uintptr_t) (u)))
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2013-05-14 16:13:52 +02:00
|
|
|
#define PTR_TO_LONG(p) ((long) ((intptr_t) (p)))
|
|
|
|
#define LONG_TO_PTR(u) ((void *) ((intptr_t) (u)))
|
2010-07-11 00:50:49 +02:00
|
|
|
#define PTR_TO_ULONG(p) ((unsigned long) ((uintptr_t) (p)))
|
2013-05-14 16:13:52 +02:00
|
|
|
#define ULONG_TO_PTR(u) ((void *) ((uintptr_t) (u)))
|
2010-07-11 00:50:49 +02:00
|
|
|
|
2013-05-14 16:13:52 +02:00
|
|
|
#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)))
|
2009-11-18 00:42:52 +01:00
|
|
|
|
2013-05-14 16:13:52 +02:00
|
|
|
#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)))
|
2010-07-11 00:50:49 +02:00
|
|
|
|
2014-07-16 00:26:02 +02:00
|
|
|
#define PTR_TO_SIZE(p) ((size_t) ((uintptr_t) (p)))
|
|
|
|
#define SIZE_TO_PTR(u) ((void *) ((uintptr_t) (u)))
|
|
|
|
|
2013-03-19 20:00:55 +01:00
|
|
|
#define CHAR_TO_STR(x) ((char[2]) { x, 0 })
|
|
|
|
|
2010-01-26 04:18:44 +01:00
|
|
|
#define char_array_0(x) x[sizeof(x)-1] = 0;
|
|
|
|
|
2013-04-02 17:33:19 +02:00
|
|
|
/* Returns the number of chars needed to format variables of the
|
|
|
|
* specified type as a decimal string. Adds in extra space for a
|
2015-02-02 21:28:19 +01:00
|
|
|
* negative '-' prefix (hence works correctly on signed
|
|
|
|
* types). Includes space for the trailing NUL. */
|
2013-04-02 17:33:19 +02:00
|
|
|
#define DECIMAL_STR_MAX(type) \
|
2013-11-25 15:26:30 +01:00
|
|
|
(2+(sizeof(type) <= 1 ? 3 : \
|
2013-04-02 17:33:19 +02:00
|
|
|
sizeof(type) <= 2 ? 5 : \
|
|
|
|
sizeof(type) <= 4 ? 10 : \
|
|
|
|
sizeof(type) <= 8 ? 20 : sizeof(int[-2*(sizeof(type) > 8)])))
|
|
|
|
|
2015-10-27 01:03:38 +01:00
|
|
|
#define DECIMAL_STR_WIDTH(x) \
|
|
|
|
({ \
|
|
|
|
typeof(x) _x_ = (x); \
|
|
|
|
unsigned ans = 1; \
|
|
|
|
while (_x_ /= 10) \
|
|
|
|
ans++; \
|
|
|
|
ans; \
|
|
|
|
})
|
|
|
|
|
2013-05-17 04:25:56 +02:00
|
|
|
#define SET_FLAG(v, flag, b) \
|
|
|
|
(v) = (b) ? ((v) | (flag)) : ((v) & ~(flag))
|
|
|
|
|
2016-01-10 18:11:22 +01:00
|
|
|
#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 */ \
|
|
|
|
static _unused_ char _static_assert__macros_need_to_be_extended[20 - sizeof((int[]){__VA_ARGS__})/sizeof(int)]; \
|
|
|
|
switch(x) { \
|
|
|
|
FOR_EACH_MAKE_CASE(__VA_ARGS__) \
|
|
|
|
_found = true; \
|
|
|
|
break; \
|
|
|
|
default: \
|
|
|
|
break; \
|
|
|
|
} \
|
|
|
|
_found; \
|
2013-12-02 23:08:25 +01:00
|
|
|
})
|
|
|
|
|
2016-02-22 20:39:45 +01:00
|
|
|
#define SWAP_TWO(x, y) do { \
|
|
|
|
typeof(x) _t = (x); \
|
|
|
|
(x) = (y); \
|
|
|
|
(y) = (_t); \
|
|
|
|
} while (false)
|
|
|
|
|
2013-12-16 17:53:53 +01:00
|
|
|
/* Define C11 thread_local attribute even on older gcc compiler
|
|
|
|
* version */
|
2013-12-16 01:24:14 +01:00
|
|
|
#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
|
2013-12-02 23:08:25 +01:00
|
|
|
|
2015-01-18 05:20:00 +01:00
|
|
|
#define DEFINE_TRIVIAL_CLEANUP_FUNC(type, func) \
|
|
|
|
static inline void func##p(type *p) { \
|
|
|
|
if (*p) \
|
|
|
|
func(*p); \
|
2018-03-06 09:34:03 +01:00
|
|
|
}
|
2015-01-18 05:20:00 +01:00
|
|
|
|
2010-04-13 03:59:39 +02:00
|
|
|
#include "log.h"
|