-
Notifications
You must be signed in to change notification settings - Fork 0
/
util.h
309 lines (273 loc) · 17.1 KB
/
util.h
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
/* See LICENSE file for copyright and license details. */
#ifndef UTIL_H_
#define UTIL_H_
#include "uthash.h"
#include <stdlib.h>
#include <stdint.h>
#include <stdio.h>
typedef uint8_t u8;
typedef uint16_t u16;
typedef uint32_t u32;
typedef uint64_t u64;
typedef int8_t i8;
typedef int16_t i16;
typedef int32_t i32;
typedef int64_t i64;
typedef union Generic Generic;
typedef union ARGB ARGB;
union Generic
{
void *datav;
void **datavl;
int8_t data8[64];
int16_t data16[32];
int32_t data32[16];
int64_t data64[8];
float dataf[16];
double datad[8];
long double datadd[4]; /* compiler specified but should be at most 128 bits */
};
/* ORDER.
* BLUE + (GREEN << 8) + (RED << 16) + (ALPHA << 24)
*/
union ARGB
{
#if __BYTE_ORDER == __ORDER_LITTLE_ENDIAN__
uint8_t a; /* Alpha value */
uint8_t r; /* Red Value */
uint8_t g; /* Green Value */
uint8_t b; /* Blue Value */
#elif __BYTE_ORDER__ == __ORDER_BIG_ENDIAN__
uint8_t b; /* Blue Value */
uint8_t g; /* Green Value */
uint8_t r; /* Red Value */
uint8_t a; /* Alpha value */
#else
/*
* NO SUPPORTED ENDIAN TYPE.
* If you are using PDP_ENDIAN you might have to manually shift the values yourself.
*/
#error "No supported endian type. If you are using PDP_ENDIAN you might have to manually shift the values yourself."
#endif
uint32_t argb; /* ARGB 32bit value */
};
#define MAX(A, B) ((A) > (B) ? (A) : (B))
#define MIN(A, B) ((A) < (B) ? (A) : (B))
#define BETWEEN(X, A, B) ((A) <= (X) && (X) <= (B))
#define MOD(N,M) ((N)%(M) < 0 ? (N)%(M) + (M) : (N)%(M))
#define TRUNC(X,A,B) (MAX((A), MIN((X), (B))))
#define FREE(F) do \
{ \
free(F); \
F = NULL; \
} while(0)
#define CLEARFLAG(FLAGS, FLAG) (((FLAGS) &= (~FLAG)))
#define SETFLAG(FLAGS, FLAG, STATE) do \
{ \
((FLAGS) &= (~FLAG)); \
((FLAGS) |= ((FLAG * !!(STATE)))); \
} while(0)
#define FLAGSET(FLAGS, FLAG) (((FLAGS & FLAG)))
#define DIE(fmt, ...) do { fprintf(stderr, "[%s:%d] by %s(): " fmt "\n", __FILE__,__LINE__,__func__,__VA_ARGS__); exit(EXIT_FAILURE); } while (0)
#define DIECAT(fmt, ...) do { fprintf(stderr, "[%s:%d] by %s()\n" \
"________________________________\n" \
"| /) |\n" \
"| /\\___/\\ (( |\n" \
"| \\`@_@'/ )) " " " fmt "\n" \
"| {_:Y:.}_// |\n" \
"|-----------{_}^-'{_}----------|\n" \
"\n", __FILE__,__LINE__,__func__,__VA_ARGS__); exit(EXIT_FAILURE); } while (0)
#ifdef ENABLE_DEBUG
#define DEBUG(fmt, ...) (fprintf(stderr, "[%s:%d] by %s(): " fmt "\n", __FILE__,__LINE__,__func__,__VA_ARGS__))
#define DEBUG0(X) (fprintf(stderr, "[%s:%d] by %s(): " X "\n", __FILE__, __LINE__, __func__))
#else
#define DEBUG(fmt, ...) ((void)0)
#define DEBUG0(X) ((void)0)
#endif
/* gcc */
#ifdef __GNUC__
#define ASM(X) (__asm__(X))
#define NOINLINE __attribute__ ((noinline))
#elif __clang__
#define ASM(X) (__asm__(X))
#define NOINLINE __attribute__ ((noinline))
#else
#define ASM(X) ((void)X)
#define NOINLINE
#endif
void *ecalloc(size_t nmemb, size_t size);
char *smprintf(char *fmt, ...);
void debug(char *fmt, ...);
double functime(void (*_timefunction)(void));
#ifndef False
#define False 0
#endif
#ifndef True
#define True 1
#endif
#ifndef None
#define None 0
#endif
#ifndef Nill
#define Nill ((void *)0)
#endif
#define ASSUME(cond) do { if (!(cond)) __builtin_unreachable(); } while (0)
/* Original implementation: Simon Tatham
* https://www.chiark.greenend.org.uk/~sgtatham/algorithms/listsort.html
*/
/*
* Copyright (c) 2001 Simon Tatham.
*
* Permission is hereby granted, free of charge, to any person
* obtaining a copy of this software and associated documentation
* files (the "Software"), to deal in the Software without
* restriction, including without limitation the rights to use,
* copy, modify, merge, publish, distribute, sublicense, and/or
* sell copies of the Software, and to permit persons to whom the
* Software is furnished to do so, subject to the following
* conditions:
*
* The above copyright notice and this permission notice shall be
* included in all copies or substantial portions of the Software.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT WARRANTY OF ANY KIND,
* EXPRESS OR IMPLIED, INCLUDING BUT NOT LIMITED TO THE WARRANTIES
* OF MERCHANTABILITY, FITNESS FOR A PARTICULAR PURPOSE AND
* NONINFRINGEMENT. IN NO EVENT SHALL SIMON TATHAM BE LIABLE FOR
* ANY CLAIM, DAMAGES OR OTHER LIABILITY, WHETHER IN AN ACTION OF
* CONTRACT, TORT OR OTHERWISE, ARISING FROM, OUT OF OR IN
* CONNECTION WITH THE SOFTWARE OR THE USE OR OTHER DEALINGS IN THE
* SOFTWARE.
*/
#define MERGE_SORT_LINKED_LIST(TYPE, CMP_FUNC, HEAD, TAIL, NEXT, PREV, IS_DOUBLE, IS_CIRCULAR)\
do \
{ \
TYPE *__p, *__q, *__e, *__tail, *__oldhead; \
TYPE *__list; \
uint32_t __insize, __nmerges, __psize, __qsize, __i; \
__insize = 1; \
__list = HEAD; \
while(1) \
{ \
__p = __list; \
if(IS_CIRCULAR) \
{ __oldhead = __list; \
} \
__list = NULL; \
__tail = NULL; \
/* count number of merges we do in this pass */ \
__nmerges = 0; \
while(__p) \
{ /* there exists a merge to be done */ \
++__nmerges; \
/* step `insize' places along from p */ \
__q = __p; \
__psize = 0; \
for(__i = 0; __i < __insize; ++__i) \
{ \
++__psize; \
if(IS_CIRCULAR) \
{ __q = (__q->NEXT == __oldhead ? NULL : __q->NEXT); \
} \
else \
{ __q = __q->NEXT; \
} \
if(!__q) \
{ break; \
} \
} \
/* if q hasn't fallen off end, \
* we have two lists to merge \
*/ \
__qsize = __insize; \
\
/* now we have two lists; merge them */ \
while(__psize > 0 || (__qsize > 0 && __q)) \
{ \
/* decide where the next element \
* of merge comes from p or q \
*/ \
if(__psize == 0) \
{ \
/* p is empty; e must come from q. */ \
__e = __q; __q = __q->NEXT; --__qsize; \
if(IS_CIRCULAR && __q == __oldhead) \
{ __q = NULL; \
} \
} \
else if(__qsize == 0 || !__q) \
{ \
/* q is empty; e must come from p. */ \
__e = __p; __p = __p->NEXT; --__psize; \
if(IS_CIRCULAR && __p == __oldhead) \
{ __p = NULL; \
} \
} \
else if(CMP_FUNC(__p, __q) <= 0) \
{ \
/* First element of p is lower (or same); \
* e must come from p. \
*/ \
__e = __p; __p = __p->NEXT; --__psize; \
if(IS_CIRCULAR && __p == __oldhead) \
{ __p = NULL; \
} \
} \
else \
{ \
/* First element of q is lower; \
* e must come from q. \
*/ \
__e = __q; __q = __q->NEXT; --__qsize; \
if(IS_CIRCULAR && __q == __oldhead) \
{ __q = NULL; \
} \
} \
/* add the next element to the merged list */ \
if(__tail) \
{ __tail->NEXT = __e; \
} \
else \
{ __list = __e; \
} \
if(IS_DOUBLE) \
{ \
/* Maintain reverse pointers \
* in a doubly linked list. \
*/ \
__e->PREV = __tail; \
} \
__tail = __e; \
} \
/* now p has stepped `insize' places along, \
* and q has too \
*/ \
__p = __q; \
} \
if(IS_CIRCULAR) \
{ \
if(__tail) \
{ __tail->NEXT = __list; \
} \
if(IS_DOUBLE) \
{ __list->PREV = __tail; \
} \
} \
else \
{ \
if(__tail) \
{ __tail->NEXT = NULL; \
} \
} \
/* If we have done only one merge, we're finished.*/ \
if(__nmerges <= 1) \
{ \
HEAD = __list; \
TAIL = __tail; \
break; \
} \
/* Otherwise repeat, merging lists twice the size */ \
__insize *= 2; \
} \
} while(0)
#endif