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
|
// Copyright 2017 syzkaller project authors. All rights reserved.
// Use of this source code is governed by Apache 2 LICENSE that can be found in the LICENSE file.
#if GOOS_linux && (GOARCH_amd64 | GOARCH_ppc64 | GOARCH_ppc64le)
#include "test_linux.h"
#endif
static int test_copyin()
{
static uint16 buf[3];
STORE_BY_BITMASK(uint16, htole16, &buf[1], 0x1234, 0, 16);
unsigned char x[sizeof(buf)];
memcpy(x, buf, sizeof(x));
if (x[0] != 0 || x[1] != 0 ||
x[2] != 0x34 || x[3] != 0x12 ||
x[4] != 0 || x[5] != 0) {
printf("bad result of STORE_BY_BITMASK(le16, 0x1234, 0, 16): %x %x %x %x %x %x\n",
x[0], x[1], x[2], x[3], x[4], x[5]);
return 1;
}
STORE_BY_BITMASK(uint16, htole16, &buf[1], 0x555a, 5, 4);
memcpy(x, buf, sizeof(x));
if (x[0] != 0 || x[1] != 0 ||
x[2] != 0x54 || x[3] != 0x13 ||
x[4] != 0 || x[5] != 0) {
printf("bad result of STORE_BY_BITMASK(le16, 0x555a, 5, 4): %x %x %x %x %x %x\n",
x[0], x[1], x[2], x[3], x[4], x[5]);
return 1;
}
STORE_BY_BITMASK(uint16, htobe16, &buf[1], 0x4567, 13, 3);
memcpy(x, buf, sizeof(x));
if (x[0] != 0 || x[1] != 0 ||
x[2] != 0xf4 || x[3] != 0x13 ||
x[4] != 0 || x[5] != 0) {
printf("bad result of STORE_BY_BITMASK(be16, 0x4567, 13, 3): %x %x %x %x %x %x\n",
x[0], x[1], x[2], x[3], x[4], x[5]);
return 1;
}
return 0;
}
static int test_csum_inet()
{
struct csum_inet_test {
const char* data;
size_t length;
uint16 csum;
};
struct csum_inet_test tests[] = {
{// 0
"",
0,
le16toh(0xffff)},
{
// 1
"\x00",
1,
le16toh(0xffff),
},
{
// 2
"\x00\x00",
2,
le16toh(0xffff),
},
{
// 3
"\x00\x00\xff\xff",
4,
le16toh(0x0000),
},
{
// 4
"\xfc",
1,
le16toh(0xff03),
},
{
// 5
"\xfc\x12",
2,
le16toh(0xed03),
},
{
// 6
"\xfc\x12\x3e",
3,
le16toh(0xecc5),
},
{
// 7
"\xfc\x12\x3e\x00\xc5\xec",
6,
le16toh(0x0000),
},
{
// 8
"\x42\x00\x00\x43\x44\x00\x00\x00\x45\x00\x00\x00\xba\xaa\xbb\xcc\xdd",
17,
le16toh(0x43e1),
},
{
// 9
"\x42\x00\x00\x43\x44\x00\x00\x00\x45\x00\x00\x00\xba\xaa\xbb\xcc\xdd\x00",
18,
le16toh(0x43e1),
},
{
// 10
"\x00\x00\x42\x00\x00\x43\x44\x00\x00\x00\x45\x00\x00\x00\xba\xaa\xbb\xcc\xdd",
19,
le16toh(0x43e1),
},
{
// 11
"\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x00\x04\x00\xab\xcd",
15,
le16toh(0x5032),
},
{
// 12
"\x00\x00\x12\x34\x56\x78",
6,
le16toh(0x5397),
},
{
// 13
"\x00\x00\x12\x34\x00\x00\x56\x78\x00\x06\x00\x04\xab\xcd",
14,
le16toh(0x7beb),
},
{
// 14
"\x00\x11\x22\x33\x44\x55\x66\x77\x88\x99\xaa\xbb\xcc\xdd\xee\xff\xff\xee\xdd\xcc\xbb\xaa\x99\x88\x77\x66\x55\x44\x33\x22\x11\x00\x00\x00\x00\x04\x00\x00\x00\x06\x00\x00\xab\xcd",
44,
le16toh(0x2854),
},
{
// 15
"\x00\x00\x12\x34\x00\x00\x56\x78\x00\x11\x00\x04\xab\xcd",
14,
le16toh(0x70eb),
},
{
// 16
"\x00\x11\x22\x33\x44\x55\x66\x77\x88\x99\xaa\xbb\xcc\xdd\xee\xff\xff\xee\xdd\xcc\xbb\xaa\x99\x88\x77\x66\x55\x44\x33\x22\x11\x00\x00\x00\x00\x04\x00\x00\x00\x11\x00\x00\xab\xcd",
44,
le16toh(0x1d54),
},
{
// 17
"\x00\x11\x22\x33\x44\x55\x66\x77\x88\x99\xaa\xbb\xcc\xdd\xee\xff\xff\xee\xdd\xcc\xbb\xaa\x99\x88\x77\x66\x55\x44\x33\x22\x11\x00\x00\x00\x00\x04\x00\x00\x00\x3a\x00\x00\xab\xcd",
44,
le16toh(0xf453),
}};
for (unsigned i = 0; i < ARRAY_SIZE(tests); i++) {
struct csum_inet csum;
csum_inet_init(&csum);
csum_inet_update(&csum, (const uint8*)tests[i].data, tests[i].length);
if (csum_inet_digest(&csum) != tests[i].csum) {
fprintf(stderr, "bad checksum in test #%u, want: %hx, got: %hx\n", i, tests[i].csum, csum_inet_digest(&csum));
return 1;
}
}
return 0;
}
static int rand_int_range(int start, int end)
{
return rand() % (end + 1 - start) + start;
}
static int test_csum_inet_acc()
{
uint8 buffer[128];
for (int test = 0; test < 256; test++) {
int size = rand_int_range(1, 128);
int step = rand_int_range(1, 8) * 2;
for (int i = 0; i < size; i++)
buffer[i] = rand_int_range(0, 255);
struct csum_inet csum_acc;
csum_inet_init(&csum_acc);
for (int i = 0; i < size / step; i++)
csum_inet_update(&csum_acc, &buffer[i * step], step);
if (size % step != 0)
csum_inet_update(&csum_acc, &buffer[size - size % step], size % step);
struct csum_inet csum;
csum_inet_init(&csum);
csum_inet_update(&csum, &buffer[0], size);
if (csum_inet_digest(&csum_acc) != csum_inet_digest(&csum))
return 1;
}
return 0;
}
static int test_cover_filter()
{
char* tmp = tempnam(nullptr, "syz-test-cover-filter");
CoverFilter filter(tmp);
CoverFilter child(filter.FD());
free(tmp);
std::vector<uint64> pcs = {
100,
111,
200,
(1 << 20) - 1,
1 << 20,
(1 << 30) - 1,
100ull << 30,
(100ull << 30) + 100,
200ull << 30,
(1ull << 62) + 100,
};
// These we don't insert, but they are also present due to truncation of low 3 bits.
std::vector<uint64> also_contain = {
96,
103,
104,
207,
(1 << 20) - 7,
(1 << 20) + 7,
(1ull << 62) + 96,
(1ull << 62) + 103,
};
std::vector<uint64> dont_contain = {
0,
1,
95,
112,
199,
208,
100 << 10,
(1 << 20) - 9,
(1 << 20) + 8,
(2ull << 30) - 1,
2ull << 30,
(2ull << 30) + 1,
(100ull << 30) + 108,
150ull << 30,
1ull << 40,
1ull << 63,
~0ull,
};
int ret = 0;
for (auto pc : pcs)
filter.Insert(pc);
pcs.insert(pcs.end(), also_contain.begin(), also_contain.end());
for (auto pc : pcs) {
if (!filter.Contains(pc) || !child.Contains(pc)) {
printf("filter doesn't contain %llu (0x%llx)\n", pc, pc);
ret = 1;
}
}
for (auto pc : dont_contain) {
if (filter.Contains(pc) || child.Contains(pc)) {
printf("filter contains %llu (0x%llx)\n", pc, pc);
ret = 1;
}
}
filter.Remove(105);
if (filter.Contains(104) || filter.Contains(105) || filter.Contains(111))
printf("filter contains 105 after removal\n");
if (!filter.Contains(103))
printf("filter doesn't contains 103 after 105 removal\n");
return ret;
}
static struct {
const char* name;
int (*f)();
} tests[] = {
{"test_copyin", test_copyin},
{"test_csum_inet", test_csum_inet},
{"test_csum_inet_acc", test_csum_inet_acc},
#if GOOS_linux && (GOARCH_amd64 || GOARCH_ppc64 || GOARCH_ppc64le)
{"test_kvm", test_kvm},
#endif
{"test_cover_filter", test_cover_filter},
};
static int run_tests(const char* test)
{
int ret = 0;
for (size_t i = 0; i < ARRAY_SIZE(tests); i++) {
const char* name = tests[i].name;
if (test && strcmp(test, name))
continue;
printf("=== RUN %s\n", name);
int res = tests[i].f();
ret |= res > 0;
const char* strres = res < 0 ? "SKIP" : (res > 0 ? "FAIL" : "OK");
printf("--- %-4s %s\n", strres, name);
}
return ret;
}
|
