1// MIT License
2
3// Copyright (c) 2017 Vadim Grigoruk @nesbox // grigoruk@gmail.com
4
5// Permission is hereby granted, free of charge, to any person obtaining a copy
6// of this software and associated documentation files (the "Software"), to deal
7// in the Software without restriction, including without limitation the rights
8// to use, copy, modify, merge, publish, distribute, sublicense, and/or sell
9// copies of the Software, and to permit persons to whom the Software is
10// furnished to do so, subject to the following conditions:
11
12// The above copyright notice and this permission notice shall be included in all
13// copies or substantial portions of the Software.
14
15// THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND, EXPRESS OR
16// IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
17// FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
18// AUTHORS OR COPYRIGHT HOLDERS BE LIABLE FOR ANY CLAIM, DAMAGES OR OTHER
19// LIABILITY, WHETHER IN AN ACTION OF CONTRACT, TORT OR OTHERWISE, ARISING FROM,
20// OUT OF OR IN CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
21// SOFTWARE.
22
23#pragma once
24
25#define COUNT_OF(x) ((sizeof(x)/sizeof(0[x])) / ((size_t)(!(sizeof(x) % sizeof(0[x])))))
26#define MIN(a,b) ((a) < (b) ? (a) : (b))
27#define MAX(a,b) ((a) > (b) ? (a) : (b))
28#define MIN3(a,b,c) MIN(MIN(a, b), c)
29#define MAX3(a,b,c) MAX(MAX(a, b), c)
30#define CLAMP(v,a,b) (MIN(MAX(v,a),b))
31#define SWAP(a, b, type) do { type temp = a; a = b; b = temp; } while (0)
32#define MEMCMP(a, b) (sizeof a == sizeof b && memcmp(&a, &b, sizeof a) == 0)
33#define ZEROMEM(p) memset(&p, 0, sizeof p)
34#define MOVE(...) memmove(malloc(sizeof __VA_ARGS__), &__VA_ARGS__, sizeof __VA_ARGS__)
35#define DEF2STR2(x) #x
36#define DEF2STR(x) DEF2STR2(x)
37#define STRLEN(str) (sizeof str - 1)
38#define CONCAT2(a, b) a ## b
39#define CONCAT(a, b) CONCAT2(a, b)
40#define MACROVAR(name) CONCAT(name, __LINE__)
41#define SCOPE(...) for(int MACROVAR(_i_) = 0; !MACROVAR(_i_); ++MACROVAR(_i_), __VA_ARGS__)
42#define FOR(type,it,list) for(type it = list, *MACROVAR(_end_) = it + COUNT_OF(list); it != MACROVAR(_end_); ++it)
43#define RFOR(type,it,list) for(type it = list + (COUNT_OF(list) - 1), *MACROVAR(_end_) = list; it >= MACROVAR(_end_); --it)
44#define NEW(o) (o*)malloc(sizeof(o))
45#define FREE(ptr) do { if(ptr) free(ptr); } while (0)
46
47#define BITSET(a,b) ((a) | (1ULL<<(b)))
48#define BITCLEAR(a,b) ((a) & ~(1ULL<<(b)))
49#define BITFLIP(a,b) ((a) ^ (1ULL<<(b)))
50#define BITCHECK(a,b) (!!((a) & (1ULL<<(b))))
51#define _BITSET(a,b) ((a) |= (1ULL<<(b)))
52#define _BITCLEAR(a,b) ((a) &= ~(1ULL<<(b)))
53#define _BITFLIP(a,b) ((a) ^= (1ULL<<(b)))
54
55#define REP0(...)
56#define REP1(...) __VA_ARGS__
57#define REP2(...) REP1(__VA_ARGS__) __VA_ARGS__
58#define REP3(...) REP2(__VA_ARGS__) __VA_ARGS__
59#define REP4(...) REP3(__VA_ARGS__) __VA_ARGS__
60#define REP5(...) REP4(__VA_ARGS__) __VA_ARGS__
61#define REP6(...) REP5(__VA_ARGS__) __VA_ARGS__
62#define REP7(...) REP6(__VA_ARGS__) __VA_ARGS__
63#define REP8(...) REP7(__VA_ARGS__) __VA_ARGS__
64#define REP9(...) REP8(__VA_ARGS__) __VA_ARGS__
65#define REP10(...) REP9(__VA_ARGS__) __VA_ARGS__
66
67#define REP(HUNDREDS,TENS,ONES,...) \
68 REP##HUNDREDS(REP10(REP10(__VA_ARGS__))) \
69 REP##TENS(REP10(__VA_ARGS__)) \
70 REP##ONES(__VA_ARGS__)
71