-
Notifications
You must be signed in to change notification settings - Fork 73
/
Copy pathgenerator.c
280 lines (228 loc) · 7.15 KB
/
generator.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
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
/*
* File: generator.c
* Author: DoI
*/
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <errno.h>
#include <sys/wait.h>
#include <unistd.h>
#include <linux/limits.h>
#include <sys/types.h>
#include <dirent.h>
#include <sys/types.h>
#include <sys/stat.h>
#include <sys/syscall.h>
#include <fcntl.h>
#include "generator.h"
#include "util.h"
// Executes radamsa and returns a linked list of test cases
// this is pretty inefficient, and running a radamsa server and reading from the socket
// would likely be a far, far smarter idea.
testcase_t * generator_radamsa(char * count, char * testcase_dir, char * path, char * prefix){
pid_t pid;
int s;
char output[PATH_MAX];
testcase_t * testcase;
snprintf(output, PATH_MAX, "%s/%s-%%n", path, prefix);
char * argv[] = { "radamsa", "-n", count, "-r", "-o", output, testcase_dir, 0 };
if((pid = fork()) == 0){
execvp(argv[0], argv);
exit(0);
}
else if(pid < 0){
fatal("[!] generator_radamsa fork() failed: %s", strerror(errno));
}
else
waitpid(pid, &s, 0x00);
testcase = load_testcases(path, prefix);
return testcase;
}
// Executes blab and returns a linked list of test cases
testcase_t * generator_blab(char * count, char * grammar, char * path, char * prefix){
pid_t pid;
int s;
char output[PATH_MAX];
testcase_t * testcase;
snprintf(output, PATH_MAX, "%s/%s-%%n", path, prefix);
char * argv[] = { "blab", grammar, "-n", count , "-o", output, 0 };
if((pid = fork()) == 0){
execvp(argv[0], argv);
exit(0);
}
else if(pid < 0){
printf("[!] generator_blab fork() failed: %s", strerror(errno));
return 0;
}
else
waitpid(pid, &s, 0x00);
testcase = load_testcases(path, prefix);
return testcase;
}
// single walking bit, returns a linked struct of testcases
testcase_t * generate_swbitflip(char * data, unsigned long in_len, unsigned long offset, unsigned long count){
unsigned long i = 0;
char * output, * input;
testcase_t * testcase, * entry;
ft_malloc(sizeof(testcase_t),testcase);
entry = testcase;
ft_malloc(in_len, input);
memset(input, 0x00, in_len);
memcpy(input, data, in_len);
// If starting from a non-zero offset, retroactively apply the flips
// that should have already happened.
if(offset > 0){
for(i = 0; i < offset; i++)
FLIP_BIT(input, i);
}
for(i = 0; i < count; i++){
ft_malloc(in_len, output);
memset(output, 0x00, in_len);
memcpy(output, input, in_len);
if(i > 0){
ft_malloc(sizeof(testcase_t),entry->next);
entry = entry->next;
}
FLIP_BIT(output, i+offset);
entry->len = in_len;
entry->data = output;
}
entry->next = 0;
free(input);
return testcase;
}
// load all testcases from dir into a linked list
testcase_t * load_testcases(char * path, char * prefix){
int i = 0;
testcase_t * testcase, * entry;
ft_malloc(sizeof(testcase_t), testcase);
entry = testcase;
DIR * dir;
struct dirent *ents;
if((dir = opendir(path)) == NULL){
fatal("[!] Error: Could not open directory: %s\n", strerror(errno));
}
while ((ents = readdir(dir)) != NULL){
struct stat s;
if(strncmp(ents->d_name, prefix, strlen(prefix)) != 0)
continue;
FILE * fp;
char file_path[PATH_MAX];
snprintf(file_path, PATH_MAX, "%s/%s", path, ents->d_name);
if((fp = fopen(file_path, "r"))== NULL){
fatal("[!] Error: Could not open file %s: %s\n", file_path, strerror(errno));
}
if(fstat(fileno(fp), &s) == -1){
fatal("[!] Error: fstat: %s\n", strerror(errno));
}
if(! S_ISREG(s.st_mode)) {
// not a regular file, skip!
fclose(fp);
continue;
}
if (fseek(fp, 0L, SEEK_END) == 0) {
long bufsize = ftell(fp);
if (bufsize == -1){
fatal("[!] Error with ftell: %s", strerror(errno));
}
else if(bufsize == 0){ // handle empty file
fclose(fp);
continue;
}
if(i>0){
// not the first entry
ft_malloc(sizeof(testcase_t), entry->next);
entry = entry->next;
}
entry->len = bufsize;
// Go back to the start of the file.
if (fseek(fp, 0L, SEEK_SET) != 0){
fatal("[!] Error: could not fseek: %s\n", strerror(errno));
}
// Read the entire file into memory.
ft_malloc(entry->len, entry->data);
if(fread(entry->data, sizeof(char), entry->len, fp) != entry->len){
fatal("[!] Error: fread");
}
if ( ferror( fp ) != 0 ){
fatal("[!] Error: fread: %s\n", strerror(errno));
}
}
fclose(fp);
i++;
}
entry->next = 0; // end of the list
closedir(dir);
if(i == 0){ // no cases found
memset(testcase, 0x00, sizeof(testcase_t));
fatal("no testcases loaded");
}
return testcase; // place holder
}
// save testcase struct to disk. Returns the number of items saved or <0 on error
int save_testcases(testcase_t * cases, char * path){
testcase_t * entry;
entry = cases;
int i = 1;
char filename[PATH_MAX];
// Use the PID as the prefix for generation
char prefix[25];
sprintf(prefix,"%d",(int)syscall(SYS_gettid));
while(entry){
snprintf(filename, PATH_MAX, "%s-%d", prefix, i);
save_case_p(entry->data, entry->len, filename, path);
entry = entry->next;
i++;
}
return i;
}
void save_case(char * data, unsigned long len, uint32_t hash, char * directory){
int fd;
ssize_t w;
char path[PATH_MAX];
snprintf(path, PATH_MAX, "%s/%u", directory, hash);
fd = open(path, O_WRONLY | O_CREAT | O_EXCL, 0644);
if(fd < 0){
if(errno == EEXIST){
// the filename is a hash of the execution hash, so if it exists we already have it!
printf("[!] File %s already exists, ignoring\n", path);
close(fd);
return;
}
else{
fatal("[!] Could not open file %s: %s", path, strerror(errno));
}
}
w = write(fd, data, len);
if(w < 0){
fatal("[!] write failed: %s", strerror(errno));
}
close(fd);
}
int save_case_p(char * data, unsigned long len, char * prefix, char * directory){
int fd;
ssize_t w;
char path[PATH_MAX];
snprintf(path, PATH_MAX, "%s/%s", directory, prefix);
fd = open(path, O_WRONLY | O_CREAT, 0644);
if(fd < 0){
fatal("[!] Could not open file %s: %s", path, strerror(errno));
}
w = write(fd, data, len);
if(w < 0){
fatal("[!] write failed: %s", strerror(errno));
}
close(fd);
return 0;
}
void free_testcases(testcase_t * cases){
testcase_t * entry;
entry = cases;
while(entry){
cases = entry->next;
free(entry->data);
free(entry);
entry = cases;
}
}