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
|
#include <stdlib.h>
#include <string.h>
#include "Rts.h"
void assertStringsEqual(char *s1, char *s2);
void shouldFindNothingInAnEmptyIPEMap(Capability *cap);
HaskellObj shouldFindOneIfItHasBeenRegistered(Capability *cap);
void shouldFindTwoIfTwoHaveBeenRegistered(Capability *cap, HaskellObj fortyTwo);
void shouldFindTwoFromTheSameList(Capability *cap);
void shouldFindTheLastEntryOfManyLists(Capability *cap);
void shouldDealWithAnEmptyList(Capability *cap, HaskellObj);
// This is a unit test for IPE.c, the IPE map.
// Due to the nature of IPE having static state, the test cases are not
// independent of each other!
int main(int argc, char *argv[]) {
hs_init(&argc, &argv);
Capability *cap = rts_lock();
shouldFindNothingInAnEmptyIPEMap(cap);
HaskellObj fortyTwo = shouldFindOneIfItHasBeenRegistered(cap);
shouldFindTwoIfTwoHaveBeenRegistered(cap, fortyTwo);
shouldFindTwoFromTheSameList(cap);
shouldFindTheLastEntryOfManyLists(cap);
shouldDealWithAnEmptyList(cap, fortyTwo);
rts_unlock(cap);
hs_exit();
}
void shouldFindNothingInAnEmptyIPEMap(Capability *cap) {
HaskellObj fortyTwo = rts_mkInt(cap, 42);
InfoProvEnt *result = lookupIPE((StgInfoTable *)fortyTwo->header.info);
if (result != NULL) {
errorBelch("Found entry in an empty IPE map!");
exit(1);
}
}
HaskellObj shouldFindOneIfItHasBeenRegistered(Capability *cap) {
HaskellObj fortyTwo = rts_mkInt(cap, 42);
InfoProvEnt *provEnt = malloc(sizeof(InfoProvEnt));
provEnt->info = (StgInfoTable *)fortyTwo->header.info;
provEnt->prov.table_name = "table_name_42";
provEnt->prov.closure_desc = "closure_desc_42";
provEnt->prov.ty_desc = "ty_desc_42";
provEnt->prov.label = "label_42";
provEnt->prov.module = "module_42";
provEnt->prov.srcloc = "srcloc_42";
InfoProvEnt *ipeList[] = {provEnt, NULL};
registerInfoProvList(ipeList);
InfoProvEnt *result = lookupIPE((StgInfoTable *)fortyTwo->header.info);
if (result == NULL) {
errorBelch("Found no entry in IPE map!");
exit(1);
}
assertStringsEqual(result->prov.table_name, "table_name_42");
assertStringsEqual(result->prov.closure_desc, "closure_desc_42");
assertStringsEqual(result->prov.ty_desc, "ty_desc_42");
assertStringsEqual(result->prov.label, "label_42");
assertStringsEqual(result->prov.module, "module_42");
assertStringsEqual(result->prov.srcloc, "srcloc_42");
return fortyTwo;
}
void shouldFindTwoIfTwoHaveBeenRegistered(Capability *cap,
HaskellObj fortyTwo) {
HaskellObj twentyThree = rts_mkInt(cap, 23);
InfoProvEnt *provEnt = malloc(sizeof(InfoProvEnt));
provEnt->info = (StgInfoTable *)twentyThree->header.info;
provEnt->prov.table_name = "table_name_23";
provEnt->prov.closure_desc = "closure_desc_23";
provEnt->prov.ty_desc = "ty_desc_23";
provEnt->prov.label = "label_23";
provEnt->prov.module = "module_23";
provEnt->prov.srcloc = "srcloc_23";
InfoProvEnt *ipeList[] = {provEnt, NULL};
registerInfoProvList(ipeList);
InfoProvEnt *resultFortyTwo =
lookupIPE((StgInfoTable *)fortyTwo->header.info);
InfoProvEnt *resultTwentyThree =
lookupIPE((StgInfoTable *)twentyThree->header.info);
if (resultFortyTwo == NULL || resultTwentyThree == NULL) {
errorBelch("Found no entry in IPE map!");
exit(1);
}
assertStringsEqual(resultFortyTwo->prov.table_name, "table_name_42");
assertStringsEqual(resultTwentyThree->prov.table_name, "table_name_23");
}
void shouldFindTwoFromTheSameList(Capability *cap) {
HaskellObj one = rts_mkInt(cap, 1);
InfoProvEnt *provEntOne = malloc(sizeof(InfoProvEnt));
provEntOne->info = (StgInfoTable *)one->header.info;
provEntOne->prov.table_name = "table_name_1";
provEntOne->prov.closure_desc = "closure_desc_1";
provEntOne->prov.ty_desc = "ty_desc_1";
provEntOne->prov.label = "label_1";
provEntOne->prov.module = "module_1";
provEntOne->prov.srcloc = "srcloc_1";
HaskellObj two = rts_mkInt(cap, 2);
InfoProvEnt *provEntTwo = malloc(sizeof(InfoProvEnt));
provEntTwo->info = (StgInfoTable *)two->header.info;
provEntTwo->prov.table_name = "table_name_2";
provEntTwo->prov.closure_desc = "closure_desc_2";
provEntTwo->prov.ty_desc = "ty_desc_2";
provEntTwo->prov.label = "label_2";
provEntTwo->prov.module = "module_2";
provEntTwo->prov.srcloc = "srcloc_2";
InfoProvEnt *ipeList[] = {provEntOne, provEntTwo, NULL};
registerInfoProvList(ipeList);
InfoProvEnt *resultOne = lookupIPE((StgInfoTable *)one->header.info);
InfoProvEnt *resultTwo = lookupIPE((StgInfoTable *)two->header.info);
if (resultOne == NULL || resultOne == NULL) {
errorBelch("Found no entry in IPE map!");
exit(1);
}
assertStringsEqual(resultOne->prov.table_name, "table_name_1");
assertStringsEqual(resultTwo->prov.table_name, "table_name_2");
}
void shouldFindTheLastEntryOfManyLists(Capability *cap) {
HaskellObj three = rts_mkInt(cap, 3);
InfoProvEnt *provEntThree = malloc(sizeof(InfoProvEnt));
provEntThree->info = (StgInfoTable *)three->header.info;
provEntThree->prov.table_name = "table_name_3";
provEntThree->prov.closure_desc = "closure_desc_3";
provEntThree->prov.ty_desc = "ty_desc_3";
provEntThree->prov.label = "label_3";
provEntThree->prov.module = "module_3";
provEntThree->prov.srcloc = "srcloc_3";
HaskellObj four = rts_mkInt(cap, 4);
InfoProvEnt *provEntFour = malloc(sizeof(InfoProvEnt));
provEntFour->info = (StgInfoTable *)four->header.info;
provEntFour->prov.table_name = "table_name_4";
provEntFour->prov.closure_desc = "closure_desc_4";
provEntFour->prov.ty_desc = "ty_desc_4";
provEntFour->prov.label = "label_4";
provEntFour->prov.module = "module_4";
provEntFour->prov.srcloc = "srcloc_4";
InfoProvEnt *ipeListThree[] = {provEntThree, NULL};
InfoProvEnt *ipeListFour[] = {provEntFour, NULL};
// Force the creation of 4 IpeBufferListNodes
for (int i = 0; i <= 126 * 3 + 1; i++) {
registerInfoProvList(ipeListThree);
}
registerInfoProvList(ipeListFour);
InfoProvEnt *resultFour = lookupIPE((StgInfoTable *)four->header.info);
if (resultFour == NULL) {
errorBelch("Found no entry in IPE map!");
exit(1);
}
assertStringsEqual(resultFour->prov.table_name, "table_name_4");
}
void shouldDealWithAnEmptyList(Capability *cap, HaskellObj fortyTwo) {
InfoProvEnt *emptyIpeList[] = {NULL};
registerInfoProvList(emptyIpeList);
InfoProvEnt *resultFortyTwo =
lookupIPE((StgInfoTable *)fortyTwo->header.info);
if (resultFortyTwo == NULL) {
errorBelch("Found no entry in IPE map!");
exit(1);
}
assertStringsEqual(resultFortyTwo->prov.table_name, "table_name_42");
}
void assertStringsEqual(char *s1, char *s2) {
if (strcmp(s1, s2) != 0) {
errorBelch("%s != %s", s1, s2);
exit(1);
}
}
|
