xref: /llvm-project/compiler-rt/lib/fuzzer/FuzzerMerge.cpp (revision 3ac31d445313f491e1349b4914c36c57c56671b0)
1 //===- 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 
23 namespace fuzzer {
24 
25 bool Merger::Parse(const std::string &Str, bool ParseCoverage) {
26   std::istringstream SS(Str);
27   return Parse(SS, ParseCoverage);
28 }
29 
30 void 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
49 bool 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;
77   Vector<uint32_t> TmpFeatures;
78   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 
116 size_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.
125 size_t Merger::Merge(const Set<uint32_t> &InitialFeatures,
126                      Vector<std::string> *NewFiles) {
127   NewFiles->clear();
128   assert(NumFilesInFirstCorpus <= Files.size());
129   Set<uint32_t> AllFeatures(InitialFeatures);
130 
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;
141     Vector<uint32_t> Tmp;
142     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 
171 void 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 
181 Set<uint32_t> Merger::AllFeatures() const {
182   Set<uint32_t> S;
183   for (auto &File : Files)
184     S.insert(File.Features.begin(), File.Features.end());
185   return S;
186 }
187 
188 Set<uint32_t> Merger::ParseSummary(std::istream &IS) {
189   std::string Line, Tmp;
190   Set<uint32_t> Res;
191   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.
208 void 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);
224   Set<size_t> AllFeatures;
225   for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) {
226     auto U = FileToVector(M.Files[i].Name);
227     if (U.size() > MaxInputLen) {
228       U.resize(MaxInputLen);
229       U.shrink_to_fit();
230     }
231     std::ostringstream StartedLine;
232     // Write the pre-run marker.
233     OF << "STARTED " << std::dec << i << " " << U.size() << "\n";
234     OF.flush();  // Flush is important since ExecuteCommand may crash.
235     // Run.
236     TPC.ResetMaps();
237     ExecuteCallback(U.data(), U.size());
238     // Collect coverage. We are iterating over the files in this order:
239     // * First, files in the initial corpus ordered by size, smallest first.
240     // * Then, all other files, smallest first.
241     // So it makes no sense to record all features for all files, instead we
242     // only record features that were not seen before.
243     Set<size_t> UniqFeatures;
244     TPC.CollectFeatures([&](size_t Feature) {
245       if (AllFeatures.insert(Feature).second)
246         UniqFeatures.insert(Feature);
247     });
248     // Show stats.
249     if (!(TotalNumberOfRuns & (TotalNumberOfRuns - 1)))
250       PrintStats("pulse ");
251     // Write the post-run marker and the coverage.
252     OF << "DONE " << i;
253     for (size_t F : UniqFeatures)
254       OF << " " << std::hex << F;
255     OF << "\n";
256   }
257 }
258 
259 static void WriteNewControlFile(const std::string &CFPath,
260                                 const Vector<SizedFile> &AllFiles,
261                                 size_t NumFilesInFirstCorpus) {
262   RemoveFile(CFPath);
263   std::ofstream ControlFile(CFPath);
264   ControlFile << AllFiles.size() << "\n";
265   ControlFile << NumFilesInFirstCorpus << "\n";
266   for (auto &SF: AllFiles)
267     ControlFile << SF.File << "\n";
268   if (!ControlFile) {
269     Printf("MERGE-OUTER: failed to write to the control file: %s\n",
270            CFPath.c_str());
271     exit(1);
272   }
273 }
274 
275 // Outer process. Does not call the target code and thus sohuld not fail.
276 void Fuzzer::CrashResistantMerge(const Vector<std::string> &Args,
277                                  const Vector<std::string> &Corpora,
278                                  const char *CoverageSummaryInputPathOrNull,
279                                  const char *CoverageSummaryOutputPathOrNull,
280                                  const char *MergeControlFilePathOrNull) {
281   if (Corpora.size() <= 1) {
282     Printf("Merge requires two or more corpus dirs\n");
283     return;
284   }
285   auto CFPath =
286       MergeControlFilePathOrNull
287           ? MergeControlFilePathOrNull
288           : DirPlusFile(TmpDir(),
289                         "libFuzzerTemp." + std::to_string(GetPid()) + ".txt");
290 
291   size_t NumAttempts = 0;
292   if (MergeControlFilePathOrNull && FileSize(MergeControlFilePathOrNull)) {
293     Printf("MERGE-OUTER: non-empty control file provided: '%s'\n",
294            MergeControlFilePathOrNull);
295     Merger M;
296     std::ifstream IF(MergeControlFilePathOrNull);
297     if (M.Parse(IF, /*ParseCoverage=*/false)) {
298       Printf("MERGE-OUTER: control file ok, %zd files total,"
299              " first not processed file %zd\n",
300              M.Files.size(), M.FirstNotProcessedFile);
301       if (!M.LastFailure.empty())
302         Printf("MERGE-OUTER: '%s' will be skipped as unlucky "
303                "(merge has stumbled on it the last time)\n",
304                M.LastFailure.c_str());
305       if (M.FirstNotProcessedFile >= M.Files.size()) {
306         Printf("MERGE-OUTER: nothing to do, merge has been completed before\n");
307         exit(0);
308       }
309 
310       NumAttempts = M.Files.size() - M.FirstNotProcessedFile;
311     } else {
312       Printf("MERGE-OUTER: bad control file, will overwrite it\n");
313     }
314   }
315 
316   if (!NumAttempts) {
317     // The supplied control file is empty or bad, create a fresh one.
318     Vector<SizedFile> AllFiles;
319     GetSizedFilesFromDir(Corpora[0], &AllFiles);
320     size_t NumFilesInFirstCorpus = AllFiles.size();
321     std::sort(AllFiles.begin(), AllFiles.end());
322     for (size_t i = 1; i < Corpora.size(); i++)
323       GetSizedFilesFromDir(Corpora[i], &AllFiles);
324     std::sort(AllFiles.begin() + NumFilesInFirstCorpus, AllFiles.end());
325     Printf("MERGE-OUTER: %zd files, %zd in the initial corpus\n",
326            AllFiles.size(), NumFilesInFirstCorpus);
327     WriteNewControlFile(CFPath, AllFiles, NumFilesInFirstCorpus);
328     NumAttempts = AllFiles.size();
329   }
330 
331   // Execute the inner process until it passes.
332   // Every inner process should execute at least one input.
333   auto BaseCmd = SplitBefore("-ignore_remaining_args=1",
334                              CloneArgsWithoutX(Args, "merge"));
335   bool Success = false;
336   for (size_t Attempt = 1; Attempt <= NumAttempts; Attempt++) {
337     Printf("MERGE-OUTER: attempt %zd\n", Attempt);
338     auto ExitCode =
339         ExecuteCommand(BaseCmd.first + " -merge_control_file=" + CFPath +
340                        " -merge_inner=1 " + BaseCmd.second);
341     if (!ExitCode) {
342       Printf("MERGE-OUTER: succesfull in %zd attempt(s)\n", Attempt);
343       Success = true;
344       break;
345     }
346   }
347   if (!Success) {
348     Printf("MERGE-OUTER: zero succesfull attempts, exiting\n");
349     exit(1);
350   }
351   // Read the control file and do the merge.
352   Merger M;
353   std::ifstream IF(CFPath);
354   IF.seekg(0, IF.end);
355   Printf("MERGE-OUTER: the control file has %zd bytes\n", (size_t)IF.tellg());
356   IF.seekg(0, IF.beg);
357   M.ParseOrExit(IF, true);
358   IF.close();
359   Printf("MERGE-OUTER: consumed %zdMb (%zdMb rss) to parse the control file\n",
360          M.ApproximateMemoryConsumption() >> 20, GetPeakRSSMb());
361   if (CoverageSummaryOutputPathOrNull) {
362     Printf("MERGE-OUTER: writing coverage summary for %zd files to %s\n",
363            M.Files.size(), CoverageSummaryOutputPathOrNull);
364     std::ofstream SummaryOut(CoverageSummaryOutputPathOrNull);
365     M.PrintSummary(SummaryOut);
366   }
367   Vector<std::string> NewFiles;
368   Set<uint32_t> InitialFeatures;
369   if (CoverageSummaryInputPathOrNull) {
370     std::ifstream SummaryIn(CoverageSummaryInputPathOrNull);
371     InitialFeatures = M.ParseSummary(SummaryIn);
372     Printf("MERGE-OUTER: coverage summary loaded from %s, %zd features found\n",
373            CoverageSummaryInputPathOrNull, InitialFeatures.size());
374   }
375   size_t NumNewFeatures = M.Merge(InitialFeatures, &NewFiles);
376   Printf("MERGE-OUTER: %zd new files with %zd new features added\n",
377          NewFiles.size(), NumNewFeatures);
378   for (auto &F: NewFiles)
379     WriteToOutputCorpus(FileToVector(F));
380   // We are done, delete the control file if it was a temporary one.
381   if (!MergeControlFilePathOrNull)
382     RemoveFile(CFPath);
383 }
384 
385 } // namespace fuzzer
386