blob: 59e34cfa002441a77dbab73875bbf74c19fb3f25 [file] [log] [blame]
george.karpenkov29efa6d2017-08-21 23:25:50 +00001//===- FuzzerMerge.cpp - merging corpora ----------------------------------===//
2//
3// The LLVM Compiler Infrastructure
4//
5// This file is distributed under the University of Illinois Open Source
6// License. See LICENSE.TXT for details.
7//
8//===----------------------------------------------------------------------===//
9// Merging corpora.
10//===----------------------------------------------------------------------===//
11
12#include "FuzzerMerge.h"
13#include "FuzzerIO.h"
14#include "FuzzerInternal.h"
15#include "FuzzerTracePC.h"
16#include "FuzzerUtil.h"
17
18#include <fstream>
19#include <iterator>
20#include <set>
21#include <sstream>
22
23namespace fuzzer {
24
25bool Merger::Parse(const std::string &Str, bool ParseCoverage) {
26 std::istringstream SS(Str);
27 return Parse(SS, ParseCoverage);
28}
29
30void Merger::ParseOrExit(std::istream &IS, bool ParseCoverage) {
31 if (!Parse(IS, ParseCoverage)) {
32 Printf("MERGE: failed to parse the control file (unexpected error)\n");
33 exit(1);
34 }
35}
36
37// The control file example:
38//
39// 3 # The number of inputs
40// 1 # The number of inputs in the first corpus, <= the previous number
41// file0
42// file1
43// file2 # One file name per line.
44// STARTED 0 123 # FileID, file size
45// DONE 0 1 4 6 8 # FileID COV1 COV2 ...
46// STARTED 1 456 # If DONE is missing, the input crashed while processing.
47// STARTED 2 567
48// DONE 2 8 9
49bool Merger::Parse(std::istream &IS, bool ParseCoverage) {
50 LastFailure.clear();
51 std::string Line;
52
53 // Parse NumFiles.
54 if (!std::getline(IS, Line, '\n')) return false;
55 std::istringstream L1(Line);
56 size_t NumFiles = 0;
57 L1 >> NumFiles;
58 if (NumFiles == 0 || NumFiles > 10000000) return false;
59
60 // Parse NumFilesInFirstCorpus.
61 if (!std::getline(IS, Line, '\n')) return false;
62 std::istringstream L2(Line);
63 NumFilesInFirstCorpus = NumFiles + 1;
64 L2 >> NumFilesInFirstCorpus;
65 if (NumFilesInFirstCorpus > NumFiles) return false;
66
67 // Parse file names.
68 Files.resize(NumFiles);
69 for (size_t i = 0; i < NumFiles; i++)
70 if (!std::getline(IS, Files[i].Name, '\n'))
71 return false;
72
73 // Parse STARTED and DONE lines.
74 size_t ExpectedStartMarker = 0;
75 const size_t kInvalidStartMarker = -1;
76 size_t LastSeenStartMarker = kInvalidStartMarker;
george.karpenkovfbfa45c2017-08-27 23:20:09 +000077 Vector<uint32_t> TmpFeatures;
george.karpenkov29efa6d2017-08-21 23:25:50 +000078 while (std::getline(IS, Line, '\n')) {
79 std::istringstream ISS1(Line);
80 std::string Marker;
81 size_t N;
82 ISS1 >> Marker;
83 ISS1 >> N;
84 if (Marker == "STARTED") {
85 // STARTED FILE_ID FILE_SIZE
86 if (ExpectedStartMarker != N)
87 return false;
88 ISS1 >> Files[ExpectedStartMarker].Size;
89 LastSeenStartMarker = ExpectedStartMarker;
90 assert(ExpectedStartMarker < Files.size());
91 ExpectedStartMarker++;
92 } else if (Marker == "DONE") {
93 // DONE FILE_ID COV1 COV2 COV3 ...
94 size_t CurrentFileIdx = N;
95 if (CurrentFileIdx != LastSeenStartMarker)
96 return false;
97 LastSeenStartMarker = kInvalidStartMarker;
98 if (ParseCoverage) {
99 TmpFeatures.clear(); // use a vector from outer scope to avoid resizes.
100 while (ISS1 >> std::hex >> N)
101 TmpFeatures.push_back(N);
102 std::sort(TmpFeatures.begin(), TmpFeatures.end());
103 Files[CurrentFileIdx].Features = TmpFeatures;
104 }
105 } else {
106 return false;
107 }
108 }
109 if (LastSeenStartMarker != kInvalidStartMarker)
110 LastFailure = Files[LastSeenStartMarker].Name;
111
112 FirstNotProcessedFile = ExpectedStartMarker;
113 return true;
114}
115
116size_t Merger::ApproximateMemoryConsumption() const {
117 size_t Res = 0;
118 for (const auto &F: Files)
119 Res += sizeof(F) + F.Features.size() * sizeof(F.Features[0]);
120 return Res;
121}
122
123// Decides which files need to be merged (add thost to NewFiles).
124// Returns the number of new features added.
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000125size_t Merger::Merge(const Set<uint32_t> &InitialFeatures,
126 Vector<std::string> *NewFiles) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000127 NewFiles->clear();
128 assert(NumFilesInFirstCorpus <= Files.size());
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000129 Set<uint32_t> AllFeatures(InitialFeatures);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000130
131 // What features are in the initial corpus?
132 for (size_t i = 0; i < NumFilesInFirstCorpus; i++) {
133 auto &Cur = Files[i].Features;
134 AllFeatures.insert(Cur.begin(), Cur.end());
135 }
136 size_t InitialNumFeatures = AllFeatures.size();
137
138 // Remove all features that we already know from all other inputs.
139 for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {
140 auto &Cur = Files[i].Features;
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000141 Vector<uint32_t> Tmp;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000142 std::set_difference(Cur.begin(), Cur.end(), AllFeatures.begin(),
143 AllFeatures.end(), std::inserter(Tmp, Tmp.begin()));
144 Cur.swap(Tmp);
145 }
146
147 // Sort. Give preference to
148 // * smaller files
149 // * files with more features.
150 std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(),
151 [&](const MergeFileInfo &a, const MergeFileInfo &b) -> bool {
152 if (a.Size != b.Size)
153 return a.Size < b.Size;
154 return a.Features.size() > b.Features.size();
155 });
156
157 // One greedy pass: add the file's features to AllFeatures.
158 // If new features were added, add this file to NewFiles.
159 for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {
160 auto &Cur = Files[i].Features;
161 // Printf("%s -> sz %zd ft %zd\n", Files[i].Name.c_str(),
162 // Files[i].Size, Cur.size());
163 size_t OldSize = AllFeatures.size();
164 AllFeatures.insert(Cur.begin(), Cur.end());
165 if (AllFeatures.size() > OldSize)
166 NewFiles->push_back(Files[i].Name);
167 }
168 return AllFeatures.size() - InitialNumFeatures;
169}
170
171void Merger::PrintSummary(std::ostream &OS) {
172 for (auto &File : Files) {
173 OS << std::hex;
174 OS << File.Name << " size: " << File.Size << " features: ";
175 for (auto Feature : File.Features)
176 OS << " " << Feature;
177 OS << "\n";
178 }
179}
180
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000181Set<uint32_t> Merger::AllFeatures() const {
182 Set<uint32_t> S;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000183 for (auto &File : Files)
184 S.insert(File.Features.begin(), File.Features.end());
185 return S;
186}
187
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000188Set<uint32_t> Merger::ParseSummary(std::istream &IS) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000189 std::string Line, Tmp;
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000190 Set<uint32_t> Res;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000191 while (std::getline(IS, Line, '\n')) {
192 size_t N;
193 std::istringstream ISS1(Line);
194 ISS1 >> Tmp; // Name
195 ISS1 >> Tmp; // size:
196 assert(Tmp == "size:" && "Corrupt summary file");
197 ISS1 >> std::hex;
198 ISS1 >> N; // File Size
199 ISS1 >> Tmp; // features:
200 assert(Tmp == "features:" && "Corrupt summary file");
201 while (ISS1 >> std::hex >> N)
202 Res.insert(N);
203 }
204 return Res;
205}
206
207// Inner process. May crash if the target crashes.
208void Fuzzer::CrashResistantMergeInternalStep(const std::string &CFPath) {
209 Printf("MERGE-INNER: using the control file '%s'\n", CFPath.c_str());
210 Merger M;
211 std::ifstream IF(CFPath);
212 M.ParseOrExit(IF, false);
213 IF.close();
214 if (!M.LastFailure.empty())
215 Printf("MERGE-INNER: '%s' caused a failure at the previous merge step\n",
216 M.LastFailure.c_str());
217
218 Printf("MERGE-INNER: %zd total files;"
219 " %zd processed earlier; will process %zd files now\n",
220 M.Files.size(), M.FirstNotProcessedFile,
221 M.Files.size() - M.FirstNotProcessedFile);
222
223 std::ofstream OF(CFPath, std::ofstream::out | std::ofstream::app);
kccb966c9e2017-09-15 22:02:26 +0000224 Set<size_t> AllFeatures;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000225 for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) {
kcc1239a992017-11-09 20:30:19 +0000226 MaybeExitGracefully();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000227 auto U = FileToVector(M.Files[i].Name);
228 if (U.size() > MaxInputLen) {
229 U.resize(MaxInputLen);
230 U.shrink_to_fit();
231 }
232 std::ostringstream StartedLine;
233 // Write the pre-run marker.
234 OF << "STARTED " << std::dec << i << " " << U.size() << "\n";
235 OF.flush(); // Flush is important since ExecuteCommand may crash.
236 // Run.
237 TPC.ResetMaps();
238 ExecuteCallback(U.data(), U.size());
kccb966c9e2017-09-15 22:02:26 +0000239 // Collect coverage. We are iterating over the files in this order:
240 // * First, files in the initial corpus ordered by size, smallest first.
241 // * Then, all other files, smallest first.
242 // So it makes no sense to record all features for all files, instead we
243 // only record features that were not seen before.
244 Set<size_t> UniqFeatures;
kccc924e382017-09-15 22:10:36 +0000245 TPC.CollectFeatures([&](size_t Feature) {
kccb966c9e2017-09-15 22:02:26 +0000246 if (AllFeatures.insert(Feature).second)
247 UniqFeatures.insert(Feature);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000248 });
249 // Show stats.
250 if (!(TotalNumberOfRuns & (TotalNumberOfRuns - 1)))
251 PrintStats("pulse ");
252 // Write the post-run marker and the coverage.
253 OF << "DONE " << i;
kccb966c9e2017-09-15 22:02:26 +0000254 for (size_t F : UniqFeatures)
george.karpenkov29efa6d2017-08-21 23:25:50 +0000255 OF << " " << std::hex << F;
256 OF << "\n";
257 }
258}
259
kcc99a71a12017-11-09 05:49:28 +0000260static void WriteNewControlFile(const std::string &CFPath,
261 const Vector<SizedFile> &AllFiles,
262 size_t NumFilesInFirstCorpus) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000263 RemoveFile(CFPath);
264 std::ofstream ControlFile(CFPath);
265 ControlFile << AllFiles.size() << "\n";
266 ControlFile << NumFilesInFirstCorpus << "\n";
kccb966c9e2017-09-15 22:02:26 +0000267 for (auto &SF: AllFiles)
268 ControlFile << SF.File << "\n";
george.karpenkov29efa6d2017-08-21 23:25:50 +0000269 if (!ControlFile) {
270 Printf("MERGE-OUTER: failed to write to the control file: %s\n",
271 CFPath.c_str());
272 exit(1);
273 }
kcc99a71a12017-11-09 05:49:28 +0000274}
george.karpenkov29efa6d2017-08-21 23:25:50 +0000275
kcc99a71a12017-11-09 05:49:28 +0000276// Outer process. Does not call the target code and thus sohuld not fail.
277void Fuzzer::CrashResistantMerge(const Vector<std::string> &Args,
278 const Vector<std::string> &Corpora,
279 const char *CoverageSummaryInputPathOrNull,
280 const char *CoverageSummaryOutputPathOrNull,
281 const char *MergeControlFilePathOrNull) {
282 if (Corpora.size() <= 1) {
283 Printf("Merge requires two or more corpus dirs\n");
284 return;
285 }
286 auto CFPath =
287 MergeControlFilePathOrNull
288 ? MergeControlFilePathOrNull
289 : DirPlusFile(TmpDir(),
290 "libFuzzerTemp." + std::to_string(GetPid()) + ".txt");
291
292 size_t NumAttempts = 0;
293 if (MergeControlFilePathOrNull && FileSize(MergeControlFilePathOrNull)) {
294 Printf("MERGE-OUTER: non-empty control file provided: '%s'\n",
295 MergeControlFilePathOrNull);
296 Merger M;
297 std::ifstream IF(MergeControlFilePathOrNull);
298 if (M.Parse(IF, /*ParseCoverage=*/false)) {
299 Printf("MERGE-OUTER: control file ok, %zd files total,"
300 " first not processed file %zd\n",
301 M.Files.size(), M.FirstNotProcessedFile);
302 if (!M.LastFailure.empty())
303 Printf("MERGE-OUTER: '%s' will be skipped as unlucky "
304 "(merge has stumbled on it the last time)\n",
305 M.LastFailure.c_str());
306 if (M.FirstNotProcessedFile >= M.Files.size()) {
307 Printf("MERGE-OUTER: nothing to do, merge has been completed before\n");
308 exit(0);
309 }
310
311 NumAttempts = M.Files.size() - M.FirstNotProcessedFile;
312 } else {
313 Printf("MERGE-OUTER: bad control file, will overwrite it\n");
314 }
315 }
316
317 if (!NumAttempts) {
318 // The supplied control file is empty or bad, create a fresh one.
319 Vector<SizedFile> AllFiles;
320 GetSizedFilesFromDir(Corpora[0], &AllFiles);
321 size_t NumFilesInFirstCorpus = AllFiles.size();
322 std::sort(AllFiles.begin(), AllFiles.end());
323 for (size_t i = 1; i < Corpora.size(); i++)
324 GetSizedFilesFromDir(Corpora[i], &AllFiles);
325 std::sort(AllFiles.begin() + NumFilesInFirstCorpus, AllFiles.end());
326 Printf("MERGE-OUTER: %zd files, %zd in the initial corpus\n",
327 AllFiles.size(), NumFilesInFirstCorpus);
328 WriteNewControlFile(CFPath, AllFiles, NumFilesInFirstCorpus);
329 NumAttempts = AllFiles.size();
330 }
331
332 // Execute the inner process until it passes.
george.karpenkov29efa6d2017-08-21 23:25:50 +0000333 // Every inner process should execute at least one input.
334 auto BaseCmd = SplitBefore("-ignore_remaining_args=1",
kccc51afd72017-11-09 01:05:29 +0000335 CloneArgsWithoutX(Args, "merge"));
george.karpenkov29efa6d2017-08-21 23:25:50 +0000336 bool Success = false;
kcc99a71a12017-11-09 05:49:28 +0000337 for (size_t Attempt = 1; Attempt <= NumAttempts; Attempt++) {
kcc1239a992017-11-09 20:30:19 +0000338 MaybeExitGracefully();
kcc99a71a12017-11-09 05:49:28 +0000339 Printf("MERGE-OUTER: attempt %zd\n", Attempt);
kccc51afd72017-11-09 01:05:29 +0000340 auto ExitCode =
341 ExecuteCommand(BaseCmd.first + " -merge_control_file=" + CFPath +
342 " -merge_inner=1 " + BaseCmd.second);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000343 if (!ExitCode) {
kcc99a71a12017-11-09 05:49:28 +0000344 Printf("MERGE-OUTER: succesfull in %zd attempt(s)\n", Attempt);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000345 Success = true;
346 break;
347 }
348 }
349 if (!Success) {
350 Printf("MERGE-OUTER: zero succesfull attempts, exiting\n");
351 exit(1);
352 }
353 // Read the control file and do the merge.
354 Merger M;
355 std::ifstream IF(CFPath);
356 IF.seekg(0, IF.end);
357 Printf("MERGE-OUTER: the control file has %zd bytes\n", (size_t)IF.tellg());
358 IF.seekg(0, IF.beg);
359 M.ParseOrExit(IF, true);
360 IF.close();
361 Printf("MERGE-OUTER: consumed %zdMb (%zdMb rss) to parse the control file\n",
362 M.ApproximateMemoryConsumption() >> 20, GetPeakRSSMb());
363 if (CoverageSummaryOutputPathOrNull) {
364 Printf("MERGE-OUTER: writing coverage summary for %zd files to %s\n",
365 M.Files.size(), CoverageSummaryOutputPathOrNull);
366 std::ofstream SummaryOut(CoverageSummaryOutputPathOrNull);
367 M.PrintSummary(SummaryOut);
368 }
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000369 Vector<std::string> NewFiles;
370 Set<uint32_t> InitialFeatures;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000371 if (CoverageSummaryInputPathOrNull) {
372 std::ifstream SummaryIn(CoverageSummaryInputPathOrNull);
373 InitialFeatures = M.ParseSummary(SummaryIn);
374 Printf("MERGE-OUTER: coverage summary loaded from %s, %zd features found\n",
375 CoverageSummaryInputPathOrNull, InitialFeatures.size());
376 }
377 size_t NumNewFeatures = M.Merge(InitialFeatures, &NewFiles);
378 Printf("MERGE-OUTER: %zd new files with %zd new features added\n",
379 NewFiles.size(), NumNewFeatures);
380 for (auto &F: NewFiles)
381 WriteToOutputCorpus(FileToVector(F));
kccc51afd72017-11-09 01:05:29 +0000382 // We are done, delete the control file if it was a temporary one.
383 if (!MergeControlFilePathOrNull)
384 RemoveFile(CFPath);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000385}
386
387} // namespace fuzzer