forked from HackerFoo/poprc
-
-
Notifications
You must be signed in to change notification settings - Fork 0
/
macros.h
413 lines (349 loc) · 18.4 KB
/
macros.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
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
/* Copyright 2012-2018 Dustin DeWeese
This file is part of PoprC.
PoprC 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 3 of the License, or
(at your option) any later version.
PoprC 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 PoprC. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef __MACROS__
#define __MACROS__
#if __STDC_VERSION__ >= 201112L
#define GET_CELL(_c) \
_Generic(*(_c), \
cell_t: (_c), \
tcell_t: (&(_c)->c))
#else
// old definition, can cause ubsan type errors
#define GET_CELL(_c) ((cell_t *)&(_c)->c)
#endif
// chunky list iterators
#define FORLIST_3(x, l, r) for(list_iterator_t __it = list_begin(l); (x = list_next(&__it, (r))) ; )
#define FORLIST_2(x, l) FORLIST_3(x, l, false)
#define FORLIST(...) DISPATCH(FORLIST, ##__VA_ARGS__)
#define WHILELIST_3(x, it, r) while((x = list_next(&it, (r))))
#define WHILELIST_2(x, it) WHILELIST_3(x, it, false)
#define WHILELIST(...) DISPATCH(WHILELIST, ##__VA_ARGS__)
#define TRAVERSE_alt_args_ptrs(c) \
for(cell_t **p = &(c)->alt, \
**_n = is_value(c) ? (c)->value.ptr : closure_next_user_arg(c), \
**_e = is_user_func(c) ? &(c)->expr.arg[closure_in(c)] : NULL, \
**_end = is_value(c) ? (is_list(c) ? &(c)->value.ptr[list_size(c)] : _n) : &(c)->expr.arg[closure_args(c)]; \
p < _end; \
_n != _e ? _n : _n , p = _n )
#define TRAVERSE_alt_ptrs_args(c) TRAVERSE_alt_args_ptrs(c)
#define TRAVERSE_args_alt_ptrs(c) TRAVERSE_alt_args_ptrs(c)
#define TRAVERSE_args_ptrs_alt(c) TRAVERSE_alt_args_ptrs(c)
#define TRAVERSE_ptrs_alt_args(c) TRAVERSE_alt_args_ptrs(c)
#define TRAVERSE_ptrs_args_alt(c) TRAVERSE_alt_args_ptrs(c)
#define TRAVERSE_alt_in_ptrs(c) \
for(cell_t **p = &(c)->alt, \
**_n = is_value(c) ? (c)->value.ptr : closure_next_arg(c), \
**_end = is_value(c) ? (is_list(c) ? &(c)->value.ptr[list_size(c)] : _n) : &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p = _n )
#define TRAVERSE_alt_ptrs_in(c) TRAVERSE_alt_in_ptrs(c)
#define TRAVERSE_in_alt_ptrs(c) TRAVERSE_alt_in_ptrs(c)
#define TRAVERSE_in_ptrs_alt(c) TRAVERSE_alt_in_ptrs(c)
#define TRAVERSE_ptrs_alt_in(c) TRAVERSE_alt_in_ptrs(c)
#define TRAVERSE_ptrs_in_alt(c) TRAVERSE_alt_in_ptrs(c)
#define TRAVERSE_const_alt_in_ptrs(c) \
for(cell_t *const *p = &(c)->alt, \
*const *_n = is_value(c) ? (c)->value.ptr : closure_next_arg_const(c), \
*const *_end = is_value(c) ? (is_list(c) ? &(c)->value.ptr[list_size(c)] : _n) : &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p = _n )
#define TRAVERSE_const_alt_ptrs_in(c) TRAVERSE_const_alt_in_ptrs(c)
#define TRAVERSE_const_in_alt_ptrs(c) TRAVERSE_const_alt_in_ptrs(c)
#define TRAVERSE_const_in_ptrs_alt(c) TRAVERSE_const_alt_in_ptrs(c)
#define TRAVERSE_const_ptrs_alt_in(c) TRAVERSE_const_alt_in_ptrs(c)
#define TRAVERSE_const_ptrs_in_alt(c) TRAVERSE_const_alt_in_ptrs(c)
#define TRAVERSE_alt_in(c) \
for(cell_t **p = &(c)->alt, \
**_n = closure_next_arg(c), \
**_end = is_value(c) ? _n : &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p = _n )
#define TRAVERSE_in_alt(c) TRAVERSE_alt_in(c)
#define TRAVERSE_const_alt_in(c) \
for(cell_t *const *p = &(c)->alt, \
*const *_n = closure_next_arg_const(c), \
*const *_end = is_value(c) ? _n : &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p = _n )
#define TRAVERSE_const_in_alt(c) TRAVERSE_const_alt_in(c)
#define TRAVERSE_alt_ptrs(c) \
for(cell_t **p = &(c)->alt, \
**_n = (c)->value.ptr, \
**_end = is_list(c) ? &(c)->value.ptr[list_size(c)] : _n; \
p < _end; \
p = _n )
#define TRAVERSE_ptrs_alt(c) TRAVERSE_alt_ptrs(c)
#define TRAVERSE_args_ptrs(c) \
for(cell_t **p = is_value(c) ? (c)->value.ptr : closure_next_user_arg(c), \
**_e = is_user_func(c) ? &(c)->expr.arg[closure_in(c)] : NULL, \
**_end = is_value(c) ? (is_list(c) ? &(c)->value.ptr[list_size(c)] : p) : &(c)->expr.arg[closure_args(c)]; \
p < _end; \
p != _e ? p : p )
#define TRAVERSE_ptrs_args(c) TRAVERSE_args_ptrs(c)
#define TRAVERSE_in_ptrs(c) \
for(cell_t **p = is_value(c) ? (c)->value.ptr : closure_next_arg(c), \
**_end = is_value(c) ? (is_list(c) ? &(c)->value.ptr[list_size(c)] : p) : &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p )
#define TRAVERSE_ptrs_in(c) TRAVERSE_in_ptrs(c)
#define TRAVERSE_const_in_ptrs(c) \
for(cell_t *const *p = is_value(c) ? (c)->value.ptr : closure_next_arg_const(c), \
*const *_end = is_value(c) ? (is_list(c) ? &(c)->value.ptr[list_size(c)] : p) : &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p )
#define TRAVERSE_const_ptrs_in(c) TRAVERSE_const_in_ptrs(c)
#define TRAVERSE_args(c) \
if(!is_value(c)) \
for(cell_t **p = closure_next_user_arg(c), \
**_e = is_user_func(c) ? &(c)->expr.arg[closure_in(c)] : NULL, \
**_end = &(c)->expr.arg[closure_args(c)]; \
p < _end; \
p != _e ? p : p )
#define TRAVERSE_const_args(c) \
if(!is_value(c)) \
for(cell_t *const *p = closure_next_user_arg_const(c), \
*const *_e = is_user_func(c) ? &(c)->expr.arg[closure_in(c)] : NULL, \
*const *_end = &(c)->expr.arg[closure_args(c)]; \
p < _end; \
p != _e ? p : p )
#define TRAVERSE_in(c) \
if(!is_value(c)) \
for(cell_t **p = closure_next_arg(c), \
**_end = &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p )
#define TRAVERSE_const_in(c) \
if(!is_value(c)) \
for(cell_t *const *p = closure_next_arg_const(c), \
*const *_end = &(c)->expr.arg[closure_in(c)]; \
p < _end; \
p )
#define TRAVERSE_out(c) \
if(!is_value(c)) \
for(cell_t **p = &(c)->expr.arg[closure_args(c) - closure_out(c)], \
**_end = &(c)->expr.arg[closure_args(c)]; \
p < _end; \
p )
#define TRAVERSE_const_out(c) \
if(!is_value(c)) \
for(cell_t *const *p = &(c)->expr.arg[closure_args(c) - closure_out(c)], \
*const *_end = &(c)->expr.arg[closure_args(c)]; \
p < _end; \
p )
#define TRAVERSE_ptrs(c) \
if(is_list(c)) \
for(cell_t **p = (c)->value.ptr, \
**_end = &(c)->value.ptr[list_size(c)]; \
p < _end; \
p )
#define TRAVERSE_const_ptrs(c) \
if(is_list(c)) \
for(cell_t *const *p = (c)->value.ptr, \
**_end = &(c)->value.ptr[list_size(c)]; \
p < _end; \
p )
#define CONCAT_ARGS_1(a) a
#define CONCAT_ARGS_2(a, b) CONCAT_ARGS_1(CONCAT_UNDERSCORE(a, b))
#define CONCAT_ARGS_3(a, b, c) CONCAT_ARGS_2(CONCAT_UNDERSCORE(a, b), c)
#define CONCAT_ARGS_4(a, b, c, d) CONCAT_ARGS_3(CONCAT_UNDERSCORE(a, b), c, d)
#define CONCAT_ARGS_5(a, b, c, d, e) CONCAT_ARGS_4(CONCAT_UNDERSCORE(a, b), c, d, e)
#define CONCAT_ARGS(...) DISPATCH(CONCAT_ARGS, ##__VA_ARGS__)
#define TRAVERSE(c, ...) CONCAT_ARGS(TRAVERSE, __VA_ARGS__)(GET_CELL(c))
#define TRAVERSE_REF(c, ...) \
TRAVERSE(c, __VA_ARGS__) { \
if(is_closure(*p)) *p = ref(*p); \
}
#define COPY_REF(c, ...) \
({ \
cell_t *nc = copy(c); \
TRAVERSE_REF(nc, __VA_ARGS__); \
nc; \
})
// embedded linked list
#define FOLLOW_3(p, l, next) \
for(__typeof__(l) p = (l), *_prev = &(l); \
p != NULL; \
_prev = (__typeof__(l) *) &p->next, p = p->next)
// embedded zig-zag (alternating) linked list
#define FOLLOW_4(p, q, l, next) \
for(__typeof__(l) \
p = (l), \
q = p ? p->next : NULL, \
*_prev = &(l); \
q != NULL; \
_prev = &q->next, p = q->next, q = p ? p->next : NULL)
#define FOLLOW(...) DISPATCH(FOLLOW, ##__VA_ARGS__)
// unions of alt_sets
#define AS_UNION_2(c, x) \
(c->expr.arg[x]->value.alt_set)
#define AS_UNION_3(c, x, y) \
(c->expr.arg[x]->value.alt_set | \
c->expr.arg[y]->value.alt_set)
#define AS_UNION_4(c, x, y, z) \
(c->expr.arg[x]->value.alt_set | \
c->expr.arg[y]->value.alt_set | \
c->expr.arg[z]->value.alt_set)
#define AS_UNION(c, ...) DISPATCH(AS_UNION, c, ##__VA_ARGS__)
#define CELL_INDEX(x) (int)((x) - cells)
#define TRACE_INDEX(x) (int)((x) - trace_cells)
#define TRACE_VAR_INDEX(x) (int)((x) - trace_cur)
#define PRE_NO_CONTEXT(func) \
UNUSED response rsp = SUCCESS; \
cell_t *c = *(ctx->src = cp); \
ctx->alt_set = 0; \
WATCH(c, #func)
#define PRE_1(func) \
CONTEXT(#func ": %C", *cp); \
PRE_NO_CONTEXT(func)
#define PRE_2(func, fmt) \
CONTEXT(#func ": %C " fmt, *cp); \
PRE_NO_CONTEXT(func)
#define PRE_3(func, fmt, x) \
CONTEXT(#func ": %C " fmt, *cp, x); \
PRE_NO_CONTEXT(func)
#define PRE_4(func, fmt, x, y) \
CONTEXT(#func ": %C " fmt, *cp, x, y); \
PRE_NO_CONTEXT(func)
#define PRE_5(func, fmt, x, y, z) \
CONTEXT(#func ": %C " fmt, *cp, x, y, z); \
PRE_NO_CONTEXT(func)
#define PRE(...) DISPATCH2(PRE, ##__VA_ARGS__)
#define WATCH_2(c, msg) \
do { \
int i = get_watch(c); \
if unlikely(i) { \
if(i == -1) { \
LOG_NOBREAK(NOTE("WATCH OP") " %O " msg " %C", (c)->op, c); \
} else { \
LOG_NOBREAK(NOTE("WATCH") " %d " msg " %C", i, c); \
} \
breakpoint(); \
} \
} while(0)
#define WATCH_4(c, msg, fmt, x) \
do { \
int i = get_watch(c); \
if unlikely(i) { \
if(i == -1) { \
LOG_NOBREAK(NOTE("WATCH OP") " %O " msg " %C " fmt, \
(c)->op, c, (x)); \
} else { \
LOG_NOBREAK(NOTE("WATCH") " %d " msg " %C " fmt, i, c, (x)); \
} \
breakpoint(); \
} \
} while(0)
#define WATCH(...) DISPATCH3(WATCH, ##__VA_ARGS__)
#define CUT(c, field) \
({ \
cell_t *tmp = ref((c)->field); \
drop(c); \
tmp; \
})
// define away WORD annotations
#define WORD(...)
#define WORD_ALIAS(...)
#define OP(name) response func_##name(cell_t **cp, UNUSED context_t *ctx)
#define LOCATION() (location_t) { .file = CONCAT(FILE_ID_, FILEBASE), .line = __LINE__ }
#define STORE_LOCATION() (ctx->loc = LOCATION())
#define CHECK(x) \
do { \
response __rsp = (x); \
if(__rsp > rsp) rsp = __rsp; \
if(__rsp > DELAY) { \
STORE_LOCATION(); \
goto abort; \
} \
} while(0)
#define CHECK_IF(x, v) \
do { \
if(x) { \
rsp = (v); \
STORE_LOCATION(); \
goto abort; \
} \
} while(0)
#define CHECK_DELAY() \
do { \
if(rsp) { \
STORE_LOCATION(); \
goto abort; \
} \
} while(0)
#define ABORT(x) \
do { \
rsp = (x); \
STORE_LOCATION(); \
goto abort; \
} while(0)
#define NOT_NULL(x) \
({ \
__typeof(x) __ptr = (x); \
assert_error(__ptr != NULL, "null pointer"); \
__ptr; \
})
#define strfield(s, f) maybe_get(s, f, "null")
#define WITH(name, x, ...) \
({ \
LET(name, (x)); \
__VA_ARGS__; \
})
#define CHECK_PRIORITY(p) \
do { \
if(should_delay(ctx, p)) { \
rsp = DELAY; \
STORE_LOCATION(); \
goto abort; \
} \
} while(0)
#define RULE(name) \
do { \
if(rule_##name(ctx)) return RETRY; \
} while(0)
#ifdef EMSCRIPTEN
#define CONSTANT
#else
#ifdef __APPLE__
#define CONSTANT __attribute__((section("__TEXT,__text")))
#else
#define CONSTANT __attribute__((section(".text")))
#endif
#endif
#define DO_PRAGMA(x) _Pragma (#x)
#define PRAGMA_MESSAGE(x) DO_PRAGMA(message (x))
// Override a condition with a warning
#define DEBUG_TRUE ({PRAGMA_MESSAGE("DEBUG_TRUE"); 1;}) ||
#define DEBUG_FALSE ({PRAGMA_MESSAGE("DEBUG_FALSE"); 0;}) &&
#define __ARGS(p, n) *p = c->expr.arg[n]
#define ARGS_1(p) cell_t __ARGS(p, 0)
#define ARGS_2(p, q) ARGS_1(p), __ARGS(q, 1)
#define ARGS_3(p, q, r) ARGS_2(p, q), __ARGS(r, 2)
#define ARGS_4(p, q, r, s) ARGS_3(p, q, r), __ARGS(s, 3)
#define ARGS_5(p, q, r, s, t) ARGS_4(p, q, r, s), __ARGS(t, 4)
#define ARGS(...) DISPATCH(ARGS, __VA_ARGS__)
#define ALLOC(_args, ...) \
({ \
cell_t *_self = closure_alloc(_args); \
*_self = (cell_t) { \
.size = _self->size, \
##__VA_ARGS__ \
}; \
_self; \
})
#define calc_size(t, f, n) \
((offsetof(t, f[n]) \
(sizeof(t) - 1)) \
/ sizeof(t))
#define PARAMETER(name, type, default, desc) void set_parameter_##name(UNUSED type *ptr, type arg)
#endif