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
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
|
/****************************************************************
*
* ======== lily-test ========
*
* a midsize C unit testing library
* copyright (c) 2022 kate swanson (sanine)
*
* This is anti-capitalist software, released for free use by individuals and
* organizations that do not operate by capitalist principles.
*
* Permission is hereby granted, free of charge, to any person or
* organization (the "User") obtaining a copy of this software and associated
* documentation files (the "Software"), to use, copy, modify, merge,
* distribute, and/or sell copies of the Software, subject to the following
* conditions:
*
* 1. The above copyright notice and this permission notice shall be included
* in all copies or modified versions of the Software.
*
* 2. The User is one of the following:
* a. An individual person, laboring for themselves
* b. A non-profit organization
* c. An educational institution
* d. An organization that seeks shared profit for all of its members, and
* allows non-members to set the cost of their labor
*
* 3. If the User is an organization with owners, then all owners are workers
* and all workers are owners with equal equity and/or equal vote.
*
* 4. If the User is an organization, then the User is not law enforcement or
* military, or working for or under either.
*
* THE SOFTWARE IS PROVIDED "AS IS", WITHOUT EXPRESS OR IMPLIED WARRANTY OF
* ANY KIND, INCLUDING BUT NOT LIMITED TO THE WARRANTIES OF MERCHANTABILITY,
* FITNESS FOR A PARTICULAR PURPOSE AND NONINFRINGEMENT. IN NO EVENT SHALL THE
* AUTHORS 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.
*
* https://anticapitalist.software/
* https://sanine.net
*
****************************************************************/
#ifndef LILY_TEST_H
#define LILY_TEST_H
#define LILY_VERSION_MAJOR 2
#define LILY_VERSION_MINOR 0
#define LILY_VERSION_PATCH 0
#include <stdbool.h>
#include <stddef.h>
#include <stdint.h>
#include <setjmp.h>
#include <stdio.h>
#include <stdarg.h>
#include <stdlib.h>
#include <math.h>
#define STR_IMP(x) #x
#define STR(x) STR_IMP(x)
/* define SOURCE_PATH_SIZE to strip away the
leading parts of the full compilation path */
#ifndef SOURCE_PATH_SIZE
#define LILY_LOCATION (__FILE__ ":" STR(__LINE__))
#else
#define LILY_LOCATION ((__FILE__ ":" STR(__LINE__)) + SOURCE_PATH_SIZE)
#endif
/* self-location macro */
#ifndef LILY_TEST_H_LOCATION
#define LILY_TEST_H_LOCATION "lily-test.h"
#endif
/* counter macros */
#define LILY_HEX_(x) 0x##x
#define LILY_HEX(x) LILY_HEX_(x)
#define LILY_COUNTER_POS_0 0
#define LILY_COUNTER_POS_1 0
#define LILY_COUNTER_POS_2 0
#define LILY_COUNTER__(a, b, c) 0x##a##b##c
#define LILY_COUNTER_(a, b, c) LILY_COUNTER__(a, b, c)
#define LILY_COUNTER LILY_COUNTER_(LILY_COUNTER_POS_2, LILY_COUNTER_POS_1, LILY_COUNTER_POS_0)
/* automatic registration macros */
typedef struct lily_ll_node_t {
struct lily_ll_node_t *next;
void (*f)();
} lily_ll_node_t;
#define LILY_FILE_BEGIN(unique_id) \
static lily_ll_node_t lily_ll_last = { NULL, NULL }; \
static void file_runner(); \
void (*unique_id)() = file_runner;
#define LILY_LIST_HEAD lily_ll_last
#define LILY_LIST_NEXT lily_ll_last
#define LILY_PUSH_TEST() LILY_TEST_H_LOCATION
#define LILY_REGISTER_TESTS() LILY_TEST_H_LOCATION
#define LILY_CAT_(x, y) x##y
#define LILY_CAT(x, y) LILY_CAT_(x, y)
#define LILY_ANON(x) LILY_CAT(x, LILY_COUNTER)
#define LILY_ANON_WRAP LILY_ANON(LILY_WRAP_)
#define LILY_ANON_FUNC LILY_ANON(LILY_FUNCTION_)
#define LILY_ANON_NODE LILY_ANON(LILY_NODE_)
#define LILY_ANON_DESC LILY_ANON(LILY_DESCRIPTION_)
#define LILY_TEST_(wrap, f, desc_str, description) \
static void f(); \
static void wrap() \
{ \
lily_g.test_name = description; \
f(); \
} \
static void f()
#define LILY_TEST(description) LILY_TEST_(LILY_ANON_WRAP, LILY_ANON_FUNC, LILY_ANON_DESC, description)
/* assertions */
typedef struct lily_test_msg_t {
struct lily_test_msg_t *next;
char *msg;
const char *location;
} lily_test_msg_t;
void lily_msg_destroy(lily_test_msg_t *m);
void lily_info(const char *location, const char *fmt, ...);
#define LILY_INFO_(location, ...) \
lily_info(location, __VA_ARGS__)
#define LILY_INFO(...) LILY_INFO_(LILY_LOCATION, __VA_ARGS__)
#define INFO(...) LILY_INFO(__VA_ARGS__)
void lily_check(int x, const char *location, const char *fmt, ...);
#define LILY_CHECK_(str, x, location) \
lily_check(x, location, "CHECK failed: %s", str)
#define LILY_CHECK(x) LILY_CHECK_(STR(x), x, LILY_LOCATION)
#define CHECK(x) LILY_CHECK(x)
#define LILY_CHECK_CMP_(x, y, xstr, ystr, cmp, cmpstr, fmt) \
lily_check(x cmp y, LILY_LOCATION, \
"CHECK failed: %s " cmpstr " %s\n %s = " fmt "\n %s = " fmt,\
xstr, ystr, xstr, x, ystr, y)
#define LILY_CHECK_CMP(x, cmp, y, fmt) LILY_CHECK_CMP_(x, y, #x, #y, cmp, #cmp, fmt)
/* check comparision assertions */
#define CHECK_EQ(x, y, fmt) LILY_CHECK_CMP(x, ==, y, fmt)
#define CHECK_NEQ(x, y, fmt) LILY_CHECK_CMP(x, !=, y, fmt)
#define CHECK_LT(x, y, fmt) LILY_CHECK_CMP(x, <, y, fmt)
#define CHECK_LE(x, y, fmt) LILY_CHECK_CMP(x, <=, y, fmt)
#define CHECK_GT(x, y, fmt) LILY_CHECK_CMP(x, >, y, fmt)
#define CHECK_GE(x, y, fmt) LILY_CHECK_CMP(x, >=, y, fmt)
#define LILY_CHECK_EQF(x, y, xstr, ystr, fmt) \
lily_check(fabs(x-y) < lily_g.epsilon, LILY_LOCATION, \
"CHECK failed: %s == %s\n %s = " fmt "\n %s = " fmt "\n epsilon: %f", \
xstr, ystr, xstr, x, ystr, y, lily_g.epsilon)
#define CHECK_EQF(x, y, fmt) LILY_CHECK_EQF(x, y, #x, #y, fmt)
#define LILY_CHECK_EQS(x, y, xstr, ystr) \
lily_check(strcmp(x, y) == 0, LILY_LOCATION, \
"CHECK failed: %s == %s\n %s = \"%s\"\n %s = \"%s\"", \
xstr, ystr, xstr, x, ystr, y)
#define CHECK_EQS(x, y) LILY_CHECK_EQS(x, y, #x, #y)
void lily_require(int x, const char *location, const char *fmt, ...);
#define LILY_REQUIRE_(str, x, location) \
lily_require(x, location, "REQUIRE failed: %s", str)
#define LILY_REQUIRE(x) LILY_REQUIRE_(STR(x), x, LILY_LOCATION)
#define REQUIRE(x) LILY_REQUIRE(x)
#define LILY_REQUIRE_CMP_(x, y, xstr, ystr, cmp, cmpstr, fmt) \
lily_require(x cmp y, LILY_LOCATION, \
"REQUIRE failed: %s " cmpstr " %s\n %s = " fmt "\n %s = " fmt,\
xstr, ystr, xstr, x, ystr, y)
#define LILY_REQUIRE_CMP(x, cmp, y, fmt) LILY_REQUIRE_CMP_(x, y, #x, #y, cmp, #cmp, fmt)
/* require comparison assertions */
#define REQUIRE_EQ(x, y, fmt) LILY_REQUIRE_CMP(x, ==, y, fmt)
#define REQUIRE_NEQ(x, y, fmt) LILY_REQUIRE_CMP(x, !=, y, fmt)
#define REQUIRE_LT(x, y, fmt) LILY_REQUIRE_CMP(x, <, y, fmt)
#define REQUIRE_LE(x, y, fmt) LILY_REQUIRE_CMP(x, <=, y, fmt)
#define REQUIRE_GT(x, y, fmt) LILY_REQUIRE_CMP(x, >, y, fmt)
#define REQUIRE_GE(x, y, fmt) LILY_REQUIRE_CMP(x, >=, y, fmt)
void lily_begin();
void lily_finish();
void lily_run_test(void (*test)());
void lily_set_epsilon(double epsilon);
struct lily_global_t {
int failed;
jmp_buf env;
const char *test_name;
lily_test_msg_t HEAD;
lily_test_msg_t *TAIL;
int n_assertions;
int n_assertions_failed;
int n_tests;
int n_tests_failed;
double epsilon;
} extern lily_g;
#ifdef LILY_IMPLEMENTATION
struct lily_global_t lily_g;
lily_test_msg_t *lily_msg_create(const char *location, const char *fmt, va_list args)
{
lily_test_msg_t *m = malloc(sizeof(lily_test_msg_t));
if (m == NULL) {
return NULL;
}
m->next = NULL;
m->location = location;
va_list args_len;
va_copy(args_len, args);
size_t len = vsnprintf(NULL, 0, fmt, args_len) + 1;
va_end(args_len);
m->msg = malloc(len * sizeof(char));
if (m->msg == NULL) {
free(m);
return NULL;
}
vsnprintf(m->msg, len, fmt, args);
return m;
}
void lily_msg_destroy(lily_test_msg_t *m)
{
if (m == NULL) {
/* ignore */
return;
}
if (m->next != NULL) {
// destroy the whole chain
lily_msg_destroy(m->next);
}
free(m->msg);
free(m);
}
void lily_run_test(void (*test)())
{
lily_g.n_tests += 1;
lily_g.HEAD.next = NULL;
lily_g.TAIL = &(lily_g.HEAD);
lily_g.failed = 0;
int jumped = setjmp(lily_g.env);
if (!jumped) {
test();
}
if (lily_g.failed) {
lily_g.n_tests_failed += 1;
printf("================================================================================\n");
printf("test \"%s\" failed!\n", lily_g.test_name);
lily_test_msg_t *n = lily_g.HEAD.next;
while(n != NULL) {
printf(" %s\n [%s]\n", n->msg, n->location);
n = n->next;
}
lily_msg_destroy(lily_g.HEAD.next);
}
}
void lily_info(const char *location, const char *fmt, ...)
{
va_list args;
va_start(args, fmt);
lily_test_msg_t *m = lily_msg_create(location, fmt, args);
va_end(args);
lily_g.TAIL->next = m;
lily_g.TAIL = m;
}
void lily_check(int x, const char *location, const char *fmt, ...)
{
lily_g.n_assertions += 1;
if (!x) {
// assertion failed
lily_g.n_assertions_failed += 1;
va_list args;
va_start(args, fmt);
lily_test_msg_t *m = lily_msg_create(location, fmt, args);
va_end(args);
lily_g.TAIL->next = m;
lily_g.TAIL = m;
lily_g.failed = 1;
}
}
void lily_require(int x, const char *location, const char *fmt, ...)
{
lily_g.n_assertions += 1;
if (!x) {
// assertion failed
lily_g.n_assertions_failed += 1;
va_list args;
va_start(args, fmt);
lily_test_msg_t *m = lily_msg_create(location, fmt, args);
va_end(args);
lily_g.TAIL->next = m;
lily_g.TAIL = m;
lily_g.failed = 1;
/* longjump out of test */
longjmp(lily_g.env, 1);
}
}
void lily_begin()
{
printf("================================================================================\n");
printf("lily-test version %d.%d.%d\n", LILY_VERSION_MAJOR, LILY_VERSION_MINOR, LILY_VERSION_PATCH);
}
void lily_finish()
{
printf("================================================================================\n");
printf("ran %d tests (%d failed)\n",
lily_g.n_tests, lily_g.n_tests_failed);
printf("checked %d asserts (%d failed)\n",
lily_g.n_assertions, lily_g.n_assertions_failed);
}
void lily_set_epsilon(double epsilon)
{
lily_g.epsilon = epsilon;
}
#endif
/* ifdef LILY_TEST_H */
#else
/* counter incrementing */
/* this counter can count up to 4096, but it should be pretty trivial to extend it more or less arbitrarily far */
/* to increment the counter, just #define LILY_COUNTER_INCREMENT and then include this file again */
#ifdef LILY_COUNTER_INCREMENT
#undef LILY_COUNTER_INCREMENT
/* ones position */
# if LILY_HEX(LILY_COUNTER_POS_0) == 0
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 1
# elif LILY_HEX(LILY_COUNTER_POS_0) == 1
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 2
# elif LILY_HEX(LILY_COUNTER_POS_0) == 2
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 3
# elif LILY_HEX(LILY_COUNTER_POS_0) == 3
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 4
# elif LILY_HEX(LILY_COUNTER_POS_0) == 4
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 5
# elif LILY_HEX(LILY_COUNTER_POS_0) == 5
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 6
# elif LILY_HEX(LILY_COUNTER_POS_0) == 6
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 7
# elif LILY_HEX(LILY_COUNTER_POS_0) == 7
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 8
# elif LILY_HEX(LILY_COUNTER_POS_0) == 8
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 9
# elif LILY_HEX(LILY_COUNTER_POS_0) == 9
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 a
# elif LILY_HEX(LILY_COUNTER_POS_0) == 10
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 b
# elif LILY_HEX(LILY_COUNTER_POS_0) == 11
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 c
# elif LILY_HEX(LILY_COUNTER_POS_0) == 12
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 d
# elif LILY_HEX(LILY_COUNTER_POS_0) == 13
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 e
# elif LILY_HEX(LILY_COUNTER_POS_0) == 14
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 f
# elif LILY_HEX(LILY_COUNTER_POS_0) == 15
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 0
/* sixteens position */
# if LILY_HEX(LILY_COUNTER_POS_1) == 0
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 1
# elif LILY_HEX(LILY_COUNTER_POS_1) == 1
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 2
# elif LILY_HEX(LILY_COUNTER_POS_1) == 2
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 3
# elif LILY_HEX(LILY_COUNTER_POS_1) == 3
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 4
# elif LILY_HEX(LILY_COUNTER_POS_1) == 4
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 5
# elif LILY_HEX(LILY_COUNTER_POS_1) == 5
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 6
# elif LILY_HEX(LILY_COUNTER_POS_1) == 6
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 7
# elif LILY_HEX(LILY_COUNTER_POS_1) == 7
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 8
# elif LILY_HEX(LILY_COUNTER_POS_1) == 8
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 9
# elif LILY_HEX(LILY_COUNTER_POS_1) == 9
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 a
# elif LILY_HEX(LILY_COUNTER_POS_1) == 10
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 b
# elif LILY_HEX(LILY_COUNTER_POS_1) == 11
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 c
# elif LILY_HEX(LILY_COUNTER_POS_1) == 12
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 d
# elif LILY_HEX(LILY_COUNTER_POS_1) == 13
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 e
# elif LILY_HEX(LILY_COUNTER_POS_1) == 14
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 f
# elif LILY_HEX(LILY_COUNTER_POS_1) == 15
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 0
/* 256s position */
# if LILY_HEX(LILY_COUNTER_POS_2) == 0
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 1
# elif LILY_HEX(LILY_COUNTER_POS_2) == 1
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 2
# elif LILY_HEX(LILY_COUNTER_POS_2) == 2
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 3
# elif LILY_HEX(LILY_COUNTER_POS_2) == 3
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 4
# elif LILY_HEX(LILY_COUNTER_POS_2) == 4
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 5
# elif LILY_HEX(LILY_COUNTER_POS_2) == 5
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 6
# elif LILY_HEX(LILY_COUNTER_POS_2) == 6
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 7
# elif LILY_HEX(LILY_COUNTER_POS_2) == 7
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 8
# elif LILY_HEX(LILY_COUNTER_POS_2) == 8
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 9
# elif LILY_HEX(LILY_COUNTER_POS_2) == 9
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 a
# elif LILY_HEX(LILY_COUNTER_POS_2) == 10
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 b
# elif LILY_HEX(LILY_COUNTER_POS_2) == 11
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 c
# elif LILY_HEX(LILY_COUNTER_POS_2) == 12
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 d
# elif LILY_HEX(LILY_COUNTER_POS_2) == 13
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 e
# elif LILY_HEX(LILY_COUNTER_POS_2) == 14
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 f
# elif LILY_HEX(LILY_COUNTER_POS_2) == 15
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 0
# endif
# endif
# endif
#elif defined(LILY_COUNTER_DECREMENT)
#undef LILY_COUNTER_DECREMENT
/* ones position */
# if LILY_HEX(LILY_COUNTER_POS_0) == 15
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 e
# elif LILY_HEX(LILY_COUNTER_POS_0) == 14
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 d
# elif LILY_HEX(LILY_COUNTER_POS_0) == 13
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 c
# elif LILY_HEX(LILY_COUNTER_POS_0) == 12
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 b
# elif LILY_HEX(LILY_COUNTER_POS_0) == 11
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 a
# elif LILY_HEX(LILY_COUNTER_POS_0) == 10
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 9
# elif LILY_HEX(LILY_COUNTER_POS_0) == 9
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 8
# elif LILY_HEX(LILY_COUNTER_POS_0) == 8
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 7
# elif LILY_HEX(LILY_COUNTER_POS_0) == 7
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 6
# elif LILY_HEX(LILY_COUNTER_POS_0) == 6
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 5
# elif LILY_HEX(LILY_COUNTER_POS_0) == 5
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 4
# elif LILY_HEX(LILY_COUNTER_POS_0) == 4
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 3
# elif LILY_HEX(LILY_COUNTER_POS_0) == 3
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 2
# elif LILY_HEX(LILY_COUNTER_POS_0) == 2
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 1
# elif LILY_HEX(LILY_COUNTER_POS_0) == 1
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 0
# elif LILY_HEX(LILY_COUNTER_POS_0) == 0
# undef LILY_COUNTER_POS_0
# define LILY_COUNTER_POS_0 f
/* sixteens position */
# if LILY_HEX(LILY_COUNTER_POS_1) == 15
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 e
# elif LILY_HEX(LILY_COUNTER_POS_1) == 14
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 d
# elif LILY_HEX(LILY_COUNTER_POS_1) == 13
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 c
# elif LILY_HEX(LILY_COUNTER_POS_1) == 12
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 b
# elif LILY_HEX(LILY_COUNTER_POS_1) == 11
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 a
# elif LILY_HEX(LILY_COUNTER_POS_1) == 10
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 9
# elif LILY_HEX(LILY_COUNTER_POS_1) == 9
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 8
# elif LILY_HEX(LILY_COUNTER_POS_1) == 8
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 7
# elif LILY_HEX(LILY_COUNTER_POS_1) == 7
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 6
# elif LILY_HEX(LILY_COUNTER_POS_1) == 6
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 5
# elif LILY_HEX(LILY_COUNTER_POS_1) == 5
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 4
# elif LILY_HEX(LILY_COUNTER_POS_1) == 4
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 3
# elif LILY_HEX(LILY_COUNTER_POS_1) == 3
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 2
# elif LILY_HEX(LILY_COUNTER_POS_1) == 2
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 1
# elif LILY_HEX(LILY_COUNTER_POS_1) == 1
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 0
# elif LILY_HEX(LILY_COUNTER_POS_1) == 0
# undef LILY_COUNTER_POS_1
# define LILY_COUNTER_POS_1 f
/* 256s position */
# if LILY_HEX(LILY_COUNTER_POS_2) == 15
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 e
# elif LILY_HEX(LILY_COUNTER_POS_2) == 14
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 d
# elif LILY_HEX(LILY_COUNTER_POS_2) == 13
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 c
# elif LILY_HEX(LILY_COUNTER_POS_2) == 12
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 b
# elif LILY_HEX(LILY_COUNTER_POS_2) == 11
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 a
# elif LILY_HEX(LILY_COUNTER_POS_2) == 10
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 9
# elif LILY_HEX(LILY_COUNTER_POS_2) == 9
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 8
# elif LILY_HEX(LILY_COUNTER_POS_2) == 8
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 7
# elif LILY_HEX(LILY_COUNTER_POS_2) == 7
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 6
# elif LILY_HEX(LILY_COUNTER_POS_2) == 6
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 5
# elif LILY_HEX(LILY_COUNTER_POS_2) == 5
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 4
# elif LILY_HEX(LILY_COUNTER_POS_2) == 4
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 3
# elif LILY_HEX(LILY_COUNTER_POS_2) == 3
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 2
# elif LILY_HEX(LILY_COUNTER_POS_2) == 2
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 1
# elif LILY_HEX(LILY_COUNTER_POS_2) == 1
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 0
# elif LILY_HEX(LILY_COUNTER_POS_2) == 0
# undef LILY_COUNTER_POS_2
# define LILY_COUNTER_POS_2 f
# endif
# endif
# endif
#elif defined(LILY_FILE_END)
/* ending a file */
/* LILY_LIST_HEAD is one too high, so we decrement */
#define LILY_COUNTER_DECREMENT
#include LILY_TEST_H_LOCATION
void file_runner()
{
lily_ll_node_t *n = &LILY_LIST_HEAD;
while (n->next != NULL) {
lily_run_test(n->f);
n = n->next;
}
}
#else
/* register new test */
static lily_ll_node_t LILY_ANON_NODE = {
#define LILY_COUNTER_DECREMENT
#include LILY_TEST_H_LOCATION
&LILY_LIST_HEAD,
#define LILY_COUNTER_INCREMENT
#include LILY_TEST_H_LOCATION
LILY_ANON_WRAP,
};
#undef LILY_LIST_HEAD
#define LILY_LIST_HEAD LILY_ANON_NODE
#define LILY_COUNTER_INCREMENT
#include LILY_TEST_H_LOCATION
#endif
#endif
|
