blob: c05c49225ea3b6c4d9f3609fc29663f367181c4f [file] [log] [blame]
george.karpenkov29efa6d2017-08-21 23:25:50 +00001//===- FuzzerMerge.cpp - merging corpora ----------------------------------===//
2//
chandlerc40284492019-01-19 08:50:56 +00003// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4// See https://llvm.org/LICENSE.txt for license information.
5// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
george.karpenkov29efa6d2017-08-21 23:25:50 +00006//
7//===----------------------------------------------------------------------===//
8// Merging corpora.
9//===----------------------------------------------------------------------===//
10
morehousea80f6452017-12-04 19:25:59 +000011#include "FuzzerCommand.h"
george.karpenkov29efa6d2017-08-21 23:25:50 +000012#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
kcc001e5f72019-02-14 23:12:33 +000045// FT 0 1 4 6 8 # FileID COV1 COV2 ...
46// COV 0 7 8 9 # FileID COV1 COV1
47// STARTED 1 456 # If FT is missing, the input crashed while processing.
george.karpenkov29efa6d2017-08-21 23:25:50 +000048// STARTED 2 567
kcc001e5f72019-02-14 23:12:33 +000049// FT 2 8 9
50// COV 2 11 12
george.karpenkov29efa6d2017-08-21 23:25:50 +000051bool Merger::Parse(std::istream &IS, bool ParseCoverage) {
52 LastFailure.clear();
53 std::string Line;
54
55 // Parse NumFiles.
56 if (!std::getline(IS, Line, '\n')) return false;
57 std::istringstream L1(Line);
58 size_t NumFiles = 0;
59 L1 >> NumFiles;
60 if (NumFiles == 0 || NumFiles > 10000000) return false;
61
62 // Parse NumFilesInFirstCorpus.
63 if (!std::getline(IS, Line, '\n')) return false;
64 std::istringstream L2(Line);
65 NumFilesInFirstCorpus = NumFiles + 1;
66 L2 >> NumFilesInFirstCorpus;
67 if (NumFilesInFirstCorpus > NumFiles) return false;
68
69 // Parse file names.
70 Files.resize(NumFiles);
71 for (size_t i = 0; i < NumFiles; i++)
72 if (!std::getline(IS, Files[i].Name, '\n'))
73 return false;
74
kcc001e5f72019-02-14 23:12:33 +000075 // Parse STARTED, FT, and COV lines.
george.karpenkov29efa6d2017-08-21 23:25:50 +000076 size_t ExpectedStartMarker = 0;
77 const size_t kInvalidStartMarker = -1;
78 size_t LastSeenStartMarker = kInvalidStartMarker;
george.karpenkovfbfa45c2017-08-27 23:20:09 +000079 Vector<uint32_t> TmpFeatures;
kcc98a86242019-02-15 00:08:16 +000080 Set<uint32_t> PCs;
george.karpenkov29efa6d2017-08-21 23:25:50 +000081 while (std::getline(IS, Line, '\n')) {
82 std::istringstream ISS1(Line);
83 std::string Marker;
84 size_t N;
85 ISS1 >> Marker;
86 ISS1 >> N;
87 if (Marker == "STARTED") {
88 // STARTED FILE_ID FILE_SIZE
89 if (ExpectedStartMarker != N)
90 return false;
91 ISS1 >> Files[ExpectedStartMarker].Size;
92 LastSeenStartMarker = ExpectedStartMarker;
93 assert(ExpectedStartMarker < Files.size());
94 ExpectedStartMarker++;
kcc001e5f72019-02-14 23:12:33 +000095 } else if (Marker == "FT") {
96 // FT FILE_ID COV1 COV2 COV3 ...
george.karpenkov29efa6d2017-08-21 23:25:50 +000097 size_t CurrentFileIdx = N;
98 if (CurrentFileIdx != LastSeenStartMarker)
99 return false;
100 LastSeenStartMarker = kInvalidStartMarker;
101 if (ParseCoverage) {
102 TmpFeatures.clear(); // use a vector from outer scope to avoid resizes.
kcc9c0ed932019-02-15 01:22:00 +0000103 while (ISS1 >> N)
george.karpenkov29efa6d2017-08-21 23:25:50 +0000104 TmpFeatures.push_back(N);
mgrang2c1f00d2018-03-20 01:17:18 +0000105 std::sort(TmpFeatures.begin(), TmpFeatures.end());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000106 Files[CurrentFileIdx].Features = TmpFeatures;
107 }
kcc001e5f72019-02-14 23:12:33 +0000108 } else if (Marker == "COV") {
kcc98a86242019-02-15 00:08:16 +0000109 size_t CurrentFileIdx = N;
kcc001e5f72019-02-14 23:12:33 +0000110 if (ParseCoverage)
kcc9c0ed932019-02-15 01:22:00 +0000111 while (ISS1 >> N)
kcc001e5f72019-02-14 23:12:33 +0000112 if (PCs.insert(N).second)
kcc98a86242019-02-15 00:08:16 +0000113 Files[CurrentFileIdx].Cov.push_back(N);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000114 } else {
115 return false;
116 }
117 }
118 if (LastSeenStartMarker != kInvalidStartMarker)
119 LastFailure = Files[LastSeenStartMarker].Name;
120
121 FirstNotProcessedFile = ExpectedStartMarker;
122 return true;
123}
124
125size_t Merger::ApproximateMemoryConsumption() const {
126 size_t Res = 0;
127 for (const auto &F: Files)
128 Res += sizeof(F) + F.Features.size() * sizeof(F.Features[0]);
129 return Res;
130}
131
kcc243006d2019-02-12 00:12:33 +0000132// Decides which files need to be merged (add those to NewFiles).
george.karpenkov29efa6d2017-08-21 23:25:50 +0000133// Returns the number of new features added.
kcc95a78ad2019-02-15 00:15:13 +0000134size_t Merger::Merge(const Set<uint32_t> &InitialFeatures,
135 Set<uint32_t> *NewFeatures,
136 const Set<uint32_t> &InitialCov, Set<uint32_t> *NewCov,
137 Vector<std::string> *NewFiles) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000138 NewFiles->clear();
139 assert(NumFilesInFirstCorpus <= Files.size());
kcc243006d2019-02-12 00:12:33 +0000140 Set<uint32_t> AllFeatures = InitialFeatures;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000141
142 // What features are in the initial corpus?
143 for (size_t i = 0; i < NumFilesInFirstCorpus; i++) {
144 auto &Cur = Files[i].Features;
kcc243006d2019-02-12 00:12:33 +0000145 AllFeatures.insert(Cur.begin(), Cur.end());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000146 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000147 // Remove all features that we already know from all other inputs.
148 for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {
149 auto &Cur = Files[i].Features;
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000150 Vector<uint32_t> Tmp;
kcc243006d2019-02-12 00:12:33 +0000151 std::set_difference(Cur.begin(), Cur.end(), AllFeatures.begin(),
152 AllFeatures.end(), std::inserter(Tmp, Tmp.begin()));
george.karpenkov29efa6d2017-08-21 23:25:50 +0000153 Cur.swap(Tmp);
154 }
155
156 // Sort. Give preference to
157 // * smaller files
158 // * files with more features.
mgrang2c1f00d2018-03-20 01:17:18 +0000159 std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(),
160 [&](const MergeFileInfo &a, const MergeFileInfo &b) -> bool {
161 if (a.Size != b.Size)
162 return a.Size < b.Size;
163 return a.Features.size() > b.Features.size();
164 });
george.karpenkov29efa6d2017-08-21 23:25:50 +0000165
166 // One greedy pass: add the file's features to AllFeatures.
167 // If new features were added, add this file to NewFiles.
168 for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {
169 auto &Cur = Files[i].Features;
170 // Printf("%s -> sz %zd ft %zd\n", Files[i].Name.c_str(),
171 // Files[i].Size, Cur.size());
kcc243006d2019-02-12 00:12:33 +0000172 bool FoundNewFeatures = false;
173 for (auto Fe: Cur) {
174 if (AllFeatures.insert(Fe).second) {
175 FoundNewFeatures = true;
176 NewFeatures->insert(Fe);
177 }
178 }
179 if (FoundNewFeatures)
george.karpenkov29efa6d2017-08-21 23:25:50 +0000180 NewFiles->push_back(Files[i].Name);
kcc98a86242019-02-15 00:08:16 +0000181 for (auto Cov : Files[i].Cov)
182 if (InitialCov.find(Cov) == InitialCov.end())
183 NewCov->insert(Cov);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000184 }
kcc95a78ad2019-02-15 00:15:13 +0000185 return NewFeatures->size();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000186}
187
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000188Set<uint32_t> Merger::AllFeatures() const {
189 Set<uint32_t> S;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000190 for (auto &File : Files)
191 S.insert(File.Features.begin(), File.Features.end());
192 return S;
193}
194
george.karpenkov29efa6d2017-08-21 23:25:50 +0000195// Inner process. May crash if the target crashes.
196void Fuzzer::CrashResistantMergeInternalStep(const std::string &CFPath) {
197 Printf("MERGE-INNER: using the control file '%s'\n", CFPath.c_str());
198 Merger M;
199 std::ifstream IF(CFPath);
200 M.ParseOrExit(IF, false);
201 IF.close();
202 if (!M.LastFailure.empty())
203 Printf("MERGE-INNER: '%s' caused a failure at the previous merge step\n",
204 M.LastFailure.c_str());
205
206 Printf("MERGE-INNER: %zd total files;"
207 " %zd processed earlier; will process %zd files now\n",
208 M.Files.size(), M.FirstNotProcessedFile,
209 M.Files.size() - M.FirstNotProcessedFile);
210
211 std::ofstream OF(CFPath, std::ofstream::out | std::ofstream::app);
kccb966c9e2017-09-15 22:02:26 +0000212 Set<size_t> AllFeatures;
dor1s94315732019-08-12 20:21:27 +0000213 auto PrintStatsWrapper = [this, &AllFeatures](const char* Where) {
214 this->PrintStats(Where, "\n", 0, AllFeatures.size());
215 };
kcc001e5f72019-02-14 23:12:33 +0000216 Set<const TracePC::PCTableEntry *> AllPCs;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000217 for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) {
kcca3815862019-02-08 21:27:23 +0000218 Fuzzer::MaybeExitGracefully();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000219 auto U = FileToVector(M.Files[i].Name);
220 if (U.size() > MaxInputLen) {
221 U.resize(MaxInputLen);
222 U.shrink_to_fit();
223 }
224 std::ostringstream StartedLine;
225 // Write the pre-run marker.
kcc9c0ed932019-02-15 01:22:00 +0000226 OF << "STARTED " << i << " " << U.size() << "\n";
morehousea80f6452017-12-04 19:25:59 +0000227 OF.flush(); // Flush is important since Command::Execute may crash.
george.karpenkov29efa6d2017-08-21 23:25:50 +0000228 // Run.
229 TPC.ResetMaps();
230 ExecuteCallback(U.data(), U.size());
kccb966c9e2017-09-15 22:02:26 +0000231 // Collect coverage. We are iterating over the files in this order:
232 // * First, files in the initial corpus ordered by size, smallest first.
233 // * Then, all other files, smallest first.
234 // So it makes no sense to record all features for all files, instead we
235 // only record features that were not seen before.
236 Set<size_t> UniqFeatures;
kccc924e382017-09-15 22:10:36 +0000237 TPC.CollectFeatures([&](size_t Feature) {
kccb966c9e2017-09-15 22:02:26 +0000238 if (AllFeatures.insert(Feature).second)
239 UniqFeatures.insert(Feature);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000240 });
kcc001e5f72019-02-14 23:12:33 +0000241 TPC.UpdateObservedPCs();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000242 // Show stats.
243 if (!(TotalNumberOfRuns & (TotalNumberOfRuns - 1)))
dor1s94315732019-08-12 20:21:27 +0000244 PrintStatsWrapper("pulse ");
dor1s544be6a2019-08-09 18:20:53 +0000245 if (TotalNumberOfRuns == M.NumFilesInFirstCorpus)
dor1s94315732019-08-12 20:21:27 +0000246 PrintStatsWrapper("LOADED");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000247 // Write the post-run marker and the coverage.
kcc001e5f72019-02-14 23:12:33 +0000248 OF << "FT " << i;
kccb966c9e2017-09-15 22:02:26 +0000249 for (size_t F : UniqFeatures)
kcc9c0ed932019-02-15 01:22:00 +0000250 OF << " " << F;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000251 OF << "\n";
kcc9c0ed932019-02-15 01:22:00 +0000252 OF << "COV " << i;
kcc001e5f72019-02-14 23:12:33 +0000253 TPC.ForEachObservedPC([&](const TracePC::PCTableEntry *TE) {
254 if (AllPCs.insert(TE).second)
255 OF << " " << TPC.PCTableEntryIdx(TE);
256 });
257 OF << "\n";
kcca00e8072017-11-09 21:30:33 +0000258 OF.flush();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000259 }
dor1s94315732019-08-12 20:21:27 +0000260 PrintStatsWrapper("DONE ");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000261}
262
kcc99a71a12017-11-09 05:49:28 +0000263static void WriteNewControlFile(const std::string &CFPath,
kccd1449be2019-02-08 22:59:03 +0000264 const Vector<SizedFile> &OldCorpus,
265 const Vector<SizedFile> &NewCorpus) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000266 RemoveFile(CFPath);
267 std::ofstream ControlFile(CFPath);
kccd1449be2019-02-08 22:59:03 +0000268 ControlFile << (OldCorpus.size() + NewCorpus.size()) << "\n";
269 ControlFile << OldCorpus.size() << "\n";
270 for (auto &SF: OldCorpus)
271 ControlFile << SF.File << "\n";
272 for (auto &SF: NewCorpus)
kccb966c9e2017-09-15 22:02:26 +0000273 ControlFile << SF.File << "\n";
george.karpenkov29efa6d2017-08-21 23:25:50 +0000274 if (!ControlFile) {
275 Printf("MERGE-OUTER: failed to write to the control file: %s\n",
276 CFPath.c_str());
277 exit(1);
278 }
kcc99a71a12017-11-09 05:49:28 +0000279}
george.karpenkov29efa6d2017-08-21 23:25:50 +0000280
kccd1449be2019-02-08 22:59:03 +0000281// Outer process. Does not call the target code and thus should not fail.
kcc4b5aa122019-02-09 00:16:21 +0000282void CrashResistantMerge(const Vector<std::string> &Args,
kccbfb59752019-02-12 03:12:40 +0000283 const Vector<SizedFile> &OldCorpus,
284 const Vector<SizedFile> &NewCorpus,
285 Vector<std::string> *NewFiles,
286 const Set<uint32_t> &InitialFeatures,
kcc98a86242019-02-15 00:08:16 +0000287 Set<uint32_t> *NewFeatures,
288 const Set<uint32_t> &InitialCov,
289 Set<uint32_t> *NewCov,
290 const std::string &CFPath,
kccbfb59752019-02-12 03:12:40 +0000291 bool V /*Verbose*/) {
kcc64bcb922019-02-13 04:04:45 +0000292 if (NewCorpus.empty() && OldCorpus.empty()) return; // Nothing to merge.
kcc99a71a12017-11-09 05:49:28 +0000293 size_t NumAttempts = 0;
kcca3815862019-02-08 21:27:23 +0000294 if (FileSize(CFPath)) {
kccbfb59752019-02-12 03:12:40 +0000295 VPrintf(V, "MERGE-OUTER: non-empty control file provided: '%s'\n",
kcca3815862019-02-08 21:27:23 +0000296 CFPath.c_str());
kcc99a71a12017-11-09 05:49:28 +0000297 Merger M;
kcca3815862019-02-08 21:27:23 +0000298 std::ifstream IF(CFPath);
kcc99a71a12017-11-09 05:49:28 +0000299 if (M.Parse(IF, /*ParseCoverage=*/false)) {
kccbfb59752019-02-12 03:12:40 +0000300 VPrintf(V, "MERGE-OUTER: control file ok, %zd files total,"
kcc99a71a12017-11-09 05:49:28 +0000301 " first not processed file %zd\n",
302 M.Files.size(), M.FirstNotProcessedFile);
303 if (!M.LastFailure.empty())
kccbfb59752019-02-12 03:12:40 +0000304 VPrintf(V, "MERGE-OUTER: '%s' will be skipped as unlucky "
kcc99a71a12017-11-09 05:49:28 +0000305 "(merge has stumbled on it the last time)\n",
306 M.LastFailure.c_str());
307 if (M.FirstNotProcessedFile >= M.Files.size()) {
kccbfb59752019-02-12 03:12:40 +0000308 VPrintf(
309 V, "MERGE-OUTER: nothing to do, merge has been completed before\n");
kcc99a71a12017-11-09 05:49:28 +0000310 exit(0);
311 }
312
313 NumAttempts = M.Files.size() - M.FirstNotProcessedFile;
314 } else {
kccbfb59752019-02-12 03:12:40 +0000315 VPrintf(V, "MERGE-OUTER: bad control file, will overwrite it\n");
kcc99a71a12017-11-09 05:49:28 +0000316 }
317 }
318
319 if (!NumAttempts) {
320 // The supplied control file is empty or bad, create a fresh one.
kccd1449be2019-02-08 22:59:03 +0000321 NumAttempts = OldCorpus.size() + NewCorpus.size();
kccbfb59752019-02-12 03:12:40 +0000322 VPrintf(V, "MERGE-OUTER: %zd files, %zd in the initial corpus\n",
323 NumAttempts, OldCorpus.size());
kccd1449be2019-02-08 22:59:03 +0000324 WriteNewControlFile(CFPath, OldCorpus, NewCorpus);
kcc99a71a12017-11-09 05:49:28 +0000325 }
326
327 // Execute the inner process until it passes.
george.karpenkov29efa6d2017-08-21 23:25:50 +0000328 // Every inner process should execute at least one input.
morehousea80f6452017-12-04 19:25:59 +0000329 Command BaseCmd(Args);
330 BaseCmd.removeFlag("merge");
kcca3815862019-02-08 21:27:23 +0000331 BaseCmd.removeFlag("fork");
kccd701d9e2019-05-23 00:22:46 +0000332 BaseCmd.removeFlag("collect_data_flow");
kcc99a71a12017-11-09 05:49:28 +0000333 for (size_t Attempt = 1; Attempt <= NumAttempts; Attempt++) {
kcca3815862019-02-08 21:27:23 +0000334 Fuzzer::MaybeExitGracefully();
kccbfb59752019-02-12 03:12:40 +0000335 VPrintf(V, "MERGE-OUTER: attempt %zd\n", Attempt);
morehousea80f6452017-12-04 19:25:59 +0000336 Command Cmd(BaseCmd);
337 Cmd.addFlag("merge_control_file", CFPath);
338 Cmd.addFlag("merge_inner", "1");
kccbfb59752019-02-12 03:12:40 +0000339 if (!V) {
metzmane847d8a2019-02-27 19:27:16 +0000340 Cmd.setOutputFile(getDevNull());
kccbfb59752019-02-12 03:12:40 +0000341 Cmd.combineOutAndErr();
342 }
morehousea80f6452017-12-04 19:25:59 +0000343 auto ExitCode = ExecuteCommand(Cmd);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000344 if (!ExitCode) {
kccbfb59752019-02-12 03:12:40 +0000345 VPrintf(V, "MERGE-OUTER: succesfull in %zd attempt(s)\n", Attempt);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000346 break;
347 }
348 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000349 // Read the control file and do the merge.
350 Merger M;
351 std::ifstream IF(CFPath);
352 IF.seekg(0, IF.end);
kccbfb59752019-02-12 03:12:40 +0000353 VPrintf(V, "MERGE-OUTER: the control file has %zd bytes\n",
354 (size_t)IF.tellg());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000355 IF.seekg(0, IF.beg);
356 M.ParseOrExit(IF, true);
357 IF.close();
kccbfb59752019-02-12 03:12:40 +0000358 VPrintf(V,
359 "MERGE-OUTER: consumed %zdMb (%zdMb rss) to parse the control file\n",
360 M.ApproximateMemoryConsumption() >> 20, GetPeakRSSMb());
kcc98a86242019-02-15 00:08:16 +0000361 M.Merge(InitialFeatures, NewFeatures, InitialCov, NewCov, NewFiles);
362 VPrintf(V, "MERGE-OUTER: %zd new files with %zd new features added; "
363 "%zd new coverage edges\n",
364 NewFiles->size(), NewFeatures->size(), NewCov->size());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000365}
366
367} // namespace fuzzer