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
|
#include <stdio.h>
#include <stdlib.h>
#define N_FIELDS 7
#define N_FUNCS 128
#define FUNCSPACING 10
#define N_STRUCTS 300 /* 1280 */
// FIXME: Need final overrider logic for 3 or more if we turn on virtual base
// class dups
#define N_BASES 30 /* 30 */
const char *simple_types[] = { "bool", "char", "short", "int", "float",
"double", "long double", "wchar_t", "void *",
"char *"
};
void gl(const char *c) {
printf("%s\n", c);
}
void g(const char *c) {
printf("%s", c);
}
void g(int i) {
printf("%d", i);
}
int vfn = 0;
char base_present[N_STRUCTS][N_STRUCTS];
bool is_ambiguous(int s, int base) {
for (int i = 0; i < N_STRUCTS; ++i) {
if ((base_present[base][i] & base_present[s][i])
// FIXME: todo this, we need final overrider additions
/*== 1 */)
return true;
}
return false;
}
void add_bases(int s, int base) {
for (int i = 0; i < N_STRUCTS; ++i)
base_present[s][i] |= base_present[base][i];
}
void gs(int s) {
bool polymorphic = false;
static int bases[N_BASES];
int i_bases = random() % (N_BASES*2);
if (i_bases >= N_BASES)
// PARAM: 1/2 of all clases should have no bases
i_bases = 0;
int n_bases = 0;
bool first_base = true;
// PARAM: 3/4 of all should be class, the rest are structs
if (random() % 4 == 0)
g("struct s");
else
g("class s");
g(s);
int old_base = -1;
if (s == 0)
i_bases = 0;
while (i_bases) {
--i_bases;
int base = random() % s;
if (!base_present[s][base]) {
if (is_ambiguous(s, base))
continue;
if (first_base) {
first_base = false;
g(": ");
} else
g(", ");
int base_type = 1;
if (random()%8 == 0) {
// PARAM: 1/8th the bases are virtual
g("virtual ");
polymorphic = true;
base_type = 3;
}
switch (random()%8) {
case 0:
case 1:
case 2:
case 3:
break;
case 4:
case 5:
g("public "); break;
case 6:
g("private "); break;
case 7:
g("protected "); break;
}
g("s");
add_bases(s, base);
bases[n_bases] = base;
base_present[s][base] = base_type;
++n_bases;
g(base);
old_base = base;
}
}
gl(" {");
/* Fields */
int n_fields = random() % (N_FIELDS*4);
// PARAM: 3/4 of all structs should have no members
if (n_fields >= N_FIELDS)
n_fields = 0;
for (int i = 0; i < n_fields; ++i) {
int t = random() % (sizeof(simple_types) / sizeof(simple_types[0]));
g(" "); g(simple_types[t]); g(" field"); g(i); gl(";");
}
/* Virtual functions */
static int funcs[N_FUNCS];
int n_funcs = random() % N_FUNCS;
int old_func = -1;
for (int i = 0; i < n_funcs; ++i) {
int fn = old_func + random() % FUNCSPACING + 1;
funcs[i] = fn;
g(" virtual void fun"); g(fn); g("(char *t) { mix((char *)this - t); mix("); g(++vfn); gl("); }");
old_func = fn;
}
gl("public:");
gl(" void calc(char *t) {");
// mix in the type number
g(" mix("); g(s); gl(");");
// mix in the size
g(" mix(sizeof (s"); g(s); gl("));");
// mix in the this offset
gl(" mix((char *)this - t);");
if (n_funcs)
polymorphic = true;
if (polymorphic) {
// mix in offset to the complete object under construction
gl(" mix(t - (char *)dynamic_cast<void*>(this));");
}
/* check base layout and overrides */
for (int i = 0; i < n_bases; ++i) {
g(" calc_s"); g(bases[i]); gl("(t);");
}
if (polymorphic) {
/* check dynamic_cast to each direct base */
for (int i = 0; i < n_bases; ++i) {
g(" if ((char *)dynamic_cast<s"); g(bases[i]); gl("*>(this))");
g(" mix(t - (char *)dynamic_cast<s"); g(bases[i]); gl("*>(this));");
gl(" else mix(666);");
}
}
/* check field layout */
for (int i = 0; i < n_fields; ++i) {
g(" mix((char *)&field"); g(i); gl(" - (char *)this);");
}
if (n_fields == 0)
gl(" mix(42);");
/* check functions */
for (int i = 0; i < n_funcs; ++i) {
g(" fun"); g(funcs[i]); gl("(t);");
}
if (n_funcs == 0)
gl(" mix(13);");
gl(" }");
// default ctor
g(" s"); g(s); g("() ");
first_base = true;
for (int i = 0; i < n_bases; ++i) {
if (first_base) {
g(": ");
first_base = false;
} else
g(", ");
g("s"); g(bases[i]); g("((char *)this)");
}
gl(" { calc((char *)this); }");
g(" ~s"); g(s); gl("() { calc((char *)this); }");
// ctor with this to the complete object
g(" s"); g(s); gl("(char *t) { calc(t); }");
g(" void calc_s"); g(s); gl("(char *t) { calc(t); }");
g("} a"); g(s); gl(";");
}
main(int argc, char **argv) {
unsigned seed = 0;
char state[16];
if (argc > 1)
seed = atol(argv[1]);
initstate(seed, state, sizeof(state));
gl("extern \"C\" int printf(const char *...);");
gl("");
gl("long long sum;");
gl("void mix(long long i) {");
// If this ever becomes too slow, we can remove this after we improve the
// mixing function
gl(" printf(\"%llx\\n\", i);");
gl(" sum += ((sum ^ i) << 3) + (sum<<1) - i;");
gl("}");
gl("");
// PARAM: Randomly size testcases or large testcases?
int n_structs = /* random() % */ N_STRUCTS;
for (int i = 0; i < n_structs; ++i)
gs(i);
gl("int main() {");
gl(" printf(\"%llx\\n\", sum);");
gl("}");
return 0;
}
|
