xaizek / vifm (License: GPLv2+) (since 2018-12-07)
Vifm is a file manager with curses interface, which provides Vi[m]-like environment for managing objects within file systems, extended with some useful ideas from mutt.
<root> / src / utils / macros.h (44025b6b9e6089952dca602cd61aad141e1494e0) (7,357B) (mode 100644) [raw]
/* vifm
 * Copyright (C) 2011 xaizek.
 *
 * This program is free software; you can redistribute it and/or modify
 * it under the terms of the GNU General Public License as published by
 * the Free Software Foundation; either version 2 of the License, or
 * (at your option) any later version.
 *
 * This program 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 General Public License for more details.
 *
 * You should have received a copy of the GNU General Public License
 * along with this program; if not, write to the Free Software
 * Foundation, Inc., 51 Franklin Street, Fifth Floor, Boston, MA 02110-1301, USA
 */

#ifndef VIFM__UTILS__MACROS_H__
#define VIFM__UTILS__MACROS_H__

#include <stddef.h> /* size_t */

/* some useful macros */

/* for portable use of GNUC extensions (see Robert Love's book about system
 * programming in Linux) */
#if __GNUC__ > 3
#undef inline
#define inline inline      __attribute__ ((always_inline))
#define _gnuc_noinline     __attribute__ ((noinline))
#define _gnuc_pure         __attribute__ ((pure))
#define _gnuc_const        __attribute__ ((const))
#define _gnuc_noreturn     __attribute__ ((noreturn))
#define _gnuc_malloc       __attribute__ ((malloc))
#define _gnuc_must_check   __attribute__ ((must_check))
#define _gnuc_deprecated   __attribute__ ((deprecated))
#define _gnuc_used         __attribute__ ((used))
#define _gnuc_unused       __attribute__ ((unused))
#define _gnuc_packed       __attribute__ ((packed))
#define _gnuc_align(x)     __attribute__ ((aligned(x)))
#define _gnuc_align_max    __attribute__ ((aligned))
#if defined(BROKEN_SWPRINTF) || defined(__clang__)
#define _gnuc_printf(m, n) __attribute__ ((format(printf, (m), (n))));
#else
#define _gnuc_printf(m, n) __attribute__ ((format(gnu_printf, (m), (n))));
#endif
#define _gnuc_likely(x)    __builtin_expect (!!(x), 1)
#define _gnuc_unlikely(x)  __builtin_expect (!!(x), 0)
#else
#define _gnuc_noinline
#define _gnuc_pure
#define _gnuc_const
#define _gnuc_noreturn
#define _gnuc_malloc
#define _gnuc_must_check
#define _gnuc_deprecated
#define _gnuc_used
#define _gnuc_unused
#define _gnuc_packed
#define _gnuc_align(x)
#define _gnuc_align_max
#define _gnuc_printf(m, n)
#define _gnuc_likely(x)   (x)
#define _gnuc_unlikely(x) (x)
#endif

#define ARRAY_LEN(x) (sizeof(x)/sizeof((x)[0]))
#define ARRAY_GUARD(x, len) \
    typedef int x##_array_guard[(ARRAY_LEN(x) == (len)) ? 1 : -1]; \
    /* Fake use to suppress "Unused local variable" warning. */ \
    enum { x##_array_guard_fake_use = (size_t)(x##_array_guard*)0 }

/* Make sure nobody else defined MIN/MAX macros. */
#ifdef MIN
#undef MIN
#endif
#ifdef MAX
#undef MAX
#endif

#define MIN(a,b) ({ \
										typeof(a) _a = (a); \
										typeof(b) _b = (b); \
										(_a < _b) ? _a : _b; \
									})

#define MAX(a,b) ({ \
										typeof(a) _a = (a); \
										typeof(b) _b = (b); \
										(_a > _b) ? _a : _b; \
									})

#define DIV_ROUND_UP(a,b)  ({ \
															typeof(a) _a = (a); \
															typeof(b) _b = (b); \
															(_a + (_b - 1))/_b; \
														})

#define ROUND_DOWN(a,b)  ({ \
														typeof(a) _a = (a); \
														typeof(b) _b = (b); \
														_a - _a%_b; \
													})

/* Compares parameters to produce result that's less than, equal or greater than
 * zero that reflects the same relation between the parameters while avoiding
 * overflows.  Returns a signed int. */
#define SORT_CMP(a,b)  ({ \
													const typeof(a) _a = (a); \
													const typeof(b) _b = (b); \
													(_a < _b) ? -1 : (_a > _b); \
												})

/* Maps single-bit mask onto bit number, e.g. BIT(8) == 3. */
#define BIT(x) ((x) == 1U << 0  ? 0  : (x) == 1U << 1  ? 1  : \
                (x) == 1U << 2  ? 2  : (x) == 1U << 3  ? 3  : \
                (x) == 1U << 4  ? 4  : (x) == 1U << 5  ? 5  : \
                (x) == 1U << 6  ? 6  : (x) == 1U << 7  ? 7  : \
                (x) == 1U << 8  ? 8  : (x) == 1U << 9  ? 9  : \
                (x) == 1U << 10 ? 10 : (x) == 1U << 11 ? 11 : \
                (x) == 1U << 12 ? 12 : (x) == 1U << 13 ? 13 : \
                (x) == 1U << 14 ? 14 : (x) == 1U << 15 ? 15 : \
                (x) == 1U << 16 ? 16 : (x) == 1U << 17 ? 17 : \
                (x) == 1U << 18 ? 18 : (x) == 1U << 19 ? 19 : \
                (x) == 1U << 20 ? 20 : (x) == 1U << 21 ? 21 : \
                (x) == 1U << 22 ? 22 : (x) == 1U << 23 ? 23 : \
                (x) == 1U << 24 ? 24 : (x) == 1U << 25 ? 25 : \
                (x) == 1U << 26 ? 26 : (x) == 1U << 27 ? 27 : \
                (x) == 1U << 28 ? 28 : (x) == 1U << 29 ? 29 : \
                (x) == 1U << 30 ? 30 : (x) == 1U << 31 ? 31 : \
                -1)

/* Evaluates to "true" if all expressions are true.  Examples:
 * ALL(isdigit, '1', '9') == 1
 * ALL(isdigit, 'z', '9') == 0 */
#define ALL(f, ...) ALL_(f, COUNT(__VA_ARGS__), __VA_ARGS__)
#define ALL_(f, n, ...) ALL__(f, n, __VA_ARGS__)
#define ALL__(f, n, ...) comb##n((f), !!, &&, __VA_ARGS__)

/* Evaluates to "true" if any of expressions is true.  Examples:
 * ANY(isdigit, 'z', '9') == 1
 * ANY(isdigit, 'z', 'a') == 0 */
#define ANY(f, ...) ({ ANY_(f, COUNT(__VA_ARGS__), __VA_ARGS__); })
#define ANY_(f, n, ...) ANY__(f, n, __VA_ARGS__)
#define ANY__(f, n, ...) comb##n((f), !!, ||, __VA_ARGS__)

/* Evaluates to "true" if none of expressions is true.  Examples:
 * NONE(isdigit, 'z', 'a') == 1
 * NONE(isdigit, '1', '9') == 0 */
#define NONE(f, ...) ({ NONE_(f, COUNT(__VA_ARGS__), __VA_ARGS__); })
#define NONE_(f, n, ...) NONE__(f, n, __VA_ARGS__)
#define NONE__(f, n, ...) comb##n((f), !, &&, __VA_ARGS__)

/* Checks whether v equals to any of the rest of arguments.  Examples:
 * ONE_OF(1, 1, 2) == 1
 * ONE_OF(1, 0, 2) == 0 */
#define ONE_OF(v, ...) ({ ONE_OF_(v, COUNT(__VA_ARGS__), __VA_ARGS__); })
#define ONE_OF_(v, n, ...) ONE_OF__(v, n, __VA_ARGS__)
#define ONE_OF__(v, n, ...) comb##n((v) == , , ||, __VA_ARGS__)

/* Makes bit mask from a list of bits. */
#define MASK(...) MASK_(COUNT(__VA_ARGS__), __VA_ARGS__)
#define MASK_(n, ...) MASK__(n, __VA_ARGS__)
#define MASK__(n, ...) comb##n(<<, 1, |, __VA_ARGS__)

/* Neat trick to obtain number number of variadic arguments. */
#define COUNT(...) COUNT_(__VA_ARGS__, 9, 8, 7, 6, 5, 4, 3, 2, 1, 0)
#define COUNT_(_1, _2, _3, _4, _5, _6, _7, _8, _9, n, ...) n

/* Helper macros to process variable arguments of macros. */
#define comb9(f, n, op, val, ...) (n f(val) op comb8(f, n, op, __VA_ARGS__))
#define comb8(f, n, op, val, ...) (n f(val) op comb7(f, n, op, __VA_ARGS__))
#define comb7(f, n, op, val, ...) (n f(val) op comb6(f, n, op, __VA_ARGS__))
#define comb6(f, n, op, val, ...) (n f(val) op comb5(f, n, op, __VA_ARGS__))
#define comb5(f, n, op, val, ...) (n f(val) op comb4(f, n, op, __VA_ARGS__))
#define comb4(f, n, op, val, ...) (n f(val) op comb3(f, n, op, __VA_ARGS__))
#define comb3(f, n, op, val, ...) (n f(val) op comb2(f, n, op, __VA_ARGS__))
#define comb2(f, n, op, val, ...) (n f(val) op comb1(f, n, op, __VA_ARGS__))
#define comb1(f, n, op, val)      (n f(val))

#endif /* VIFM__UTILS__MACROS_H__ */

/* vim: set tabstop=2 softtabstop=2 shiftwidth=2 noexpandtab cinoptions-=(0 : */
/* vim: set cinoptions+=t0 filetype=c : */
Hints

Before first commit, do not forget to setup your git environment:
git config --global user.name "your_name_here"
git config --global user.email "your@email_here"

Clone this repository using HTTP(S):
git clone https://code.reversed.top/user/xaizek/vifm

Clone this repository using ssh (do not forget to upload a key first):
git clone ssh://rocketgit@code.reversed.top/user/xaizek/vifm

You are allowed to anonymously push to this repository.
This means that your pushed commits will automatically be transformed into a pull request:
... clone the repository ...
... make some changes and some commits ...
git push origin master