-
Notifications
You must be signed in to change notification settings - Fork 0
/
unittest.c
173 lines (138 loc) · 4.49 KB
/
unittest.c
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
/*Ken Sheedlo's brainfuck compiler
* Unit tester */
#include "unittest.h"
int32_t bfop_equal(const void *lhs, const void *rhs){
bfop_t *lop = (bfop_t *)lhs;
bfop_t *rop = (bfop_t *)rhs;
return (lop->opcode == rop->opcode) && (lop->arg == rop->arg);
}
int32_t list_equal(list_t *lhs, list_t *rhs, int32_t (*eq)(const void *, const void *)){
if(lhs->length != rhs->length){
return 0;
}
node_t *foo = lhs->head->next;
node_t *bar = rhs->head->next;
while(foo != lhs->head){
if(!eq(foo->data, bar->data)){
return 0;
}
foo = foo->next;
bar = bar->next;
}
return 1;
}
int32_t assert_bfop_lstcontents(list_t *lst, int32_t *ops, int32_t *args, int32_t len){
if(lst->length != len){
fprintf(stderr, "Wrong list length, expected %d, actual is %d\n",
len, (int32_t)lst->length);
list_print(stderr, lst, generic_bfop_print);
return 0;
}
node_t *node = lst->head->next;
for(int i = 0; i < len; i++){
bfop_t expected;
expected.opcode = ops[i];
expected.arg = args[i];
if(!bfop_equal(&expected, node->data)){
fprintf(stderr, "Error: lists not equal\n");
list_print(stderr, lst, generic_bfop_print);
fprintf(stderr, "Expected ith value (i=%d): ", i);
bfop_print(stderr, &expected);
fprintf(stderr, "\n");
return 0;
}
node = node->next;
}
return 1;
}
int32_t test_list_addfirst(){
list_t foo;
list_init(&foo);
list_addfirst(&foo, bfop_new(ADDV, 5));
list_addfirst(&foo, bfop_new(INC, 1));
list_addfirst(&foo, bfop_new(JNZ, 42));
int32_t op_expected[] = {JNZ, INC, ADDV};
int32_t arg_expected[] = {42, 1, 5};
int32_t ret = assert_bfop_lstcontents(&foo, op_expected, arg_expected, 3);
list_clear(&foo, 1);
return ret;
}
int32_t test_list_addlast(){
list_t list;
list_init(&list);
list_addlast(&list, bfop_new(LABEL, 0xF00));
list_addlast(&list, bfop_new(ZERO, 0));
list_addlast(&list, bfop_new(INCV, 42));
int32_t op_expected[] = {LABEL, ZERO, INCV};
int32_t arg_expected[] = {0xF00, 0, 42};
int32_t ret = assert_bfop_lstcontents(&list, op_expected, arg_expected, 3);
list_clear(&list, 1);
return ret;
}
int32_t test_list_remove(){
list_t list;
list_init(&list);
list_addlast(&list, bfop_new(SUB, 0));
list_addlast(&list, bfop_new(INCV, 42));
list_addlast(&list, bfop_new(JZ, 0x20));
list_addlast(&list, bfop_new(LABEL, 0xF00));
list_addlast(&list, bfop_new(ADDV, 2));
int32_t ox[] = {SUB, INCV, JZ, LABEL, ADDV};
int32_t ax[] = {0, 42, 0x20, 0xF00, 2};
int32_t st = assert_bfop_lstcontents(&list, ox, ax, 5);
if(!st){
list_clear(&list, 1);
return 0;
}
free(list_remove(list.head->next->next));
free(list_remove(list.head->prev));
int32_t ox2[] = {SUB, JZ, LABEL};
int32_t ax2[] = {0, 0x20, 0xF00};
st = assert_bfop_lstcontents(&list, ox2, ax2, 3);
list_clear(&list, 1);
return st;
}
int32_t test_list_match(){
/*Pass in a match and a non-match to make sure match works properly*/
list_t lst1, lst2;
list_init(&lst1);
list_init(&lst2);
list_addlast(&lst1, bfop_new(SUB, 0));
list_addlast(&lst1, bfop_new(INCV, 42));
list_addlast(&lst1, bfop_new(JZ, 0x20));
list_addlast(&lst1, bfop_new(LABEL, 0xF00));
list_addlast(&lst1, bfop_new(ADDV, 2));
list_addlast(&lst2, bfop_new(INCV, 42));
list_addlast(&lst2, bfop_new(JZ, 0x20));
list_addlast(&lst2, bfop_new(LABEL, 0xF00));
int32_t st = list_match(&lst1, lst1.head->next->next, &lst2, lst2.head->next,
bfop_equal, 3);
if(!st){
list_clear(&lst1, 1);
list_clear(&lst2, 1);
return 0;
}
st = list_match(&lst1, lst1.head->next, &lst2, lst2.head->next, bfop_equal, 3);
list_clear(&lst1, 1);
list_clear(&lst2, 1);
return !st;
}
int main(int argc, char **argv){
int32_t (*TESTS[])() = {
test_list_addfirst,
test_list_addlast,
test_list_remove,
test_list_match
};
const int32_t TEST_LENGTH = sizeof(TESTS) / sizeof(TESTS[0]);
for(int i = 0; i<TEST_LENGTH; i++){
int32_t (*test)() = TESTS[i];
if(!test()){
fprintf(stderr, "Test %d FAILED\n", i+1);
return 1;
}
fprintf(stderr, "Test %d PASSED\n", i+1);
}
fprintf(stderr, "All tests passed\n");
return 0;
}