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