blob: e3ad8b3851e79e4ab71f1f1a5ce062ffb3427422 [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>
dor1sd6908fb2019-09-11 14:11:08 +000022#include <unordered_set>
george.karpenkov29efa6d2017-08-21 23:25:50 +000023
24namespace fuzzer {
25
26bool Merger::Parse(const std::string &Str, bool ParseCoverage) {
27 std::istringstream SS(Str);
28 return Parse(SS, ParseCoverage);
29}
30
31void Merger::ParseOrExit(std::istream &IS, bool ParseCoverage) {
32 if (!Parse(IS, ParseCoverage)) {
33 Printf("MERGE: failed to parse the control file (unexpected error)\n");
34 exit(1);
35 }
36}
37
38// The control file example:
39//
40// 3 # The number of inputs
41// 1 # The number of inputs in the first corpus, <= the previous number
42// file0
43// file1
44// file2 # One file name per line.
45// STARTED 0 123 # FileID, file size
kcc001e5f72019-02-14 23:12:33 +000046// FT 0 1 4 6 8 # FileID COV1 COV2 ...
47// COV 0 7 8 9 # FileID COV1 COV1
48// STARTED 1 456 # If FT is missing, the input crashed while processing.
george.karpenkov29efa6d2017-08-21 23:25:50 +000049// STARTED 2 567
kcc001e5f72019-02-14 23:12:33 +000050// FT 2 8 9
51// COV 2 11 12
george.karpenkov29efa6d2017-08-21 23:25:50 +000052bool Merger::Parse(std::istream &IS, bool ParseCoverage) {
53 LastFailure.clear();
54 std::string Line;
55
56 // Parse NumFiles.
57 if (!std::getline(IS, Line, '\n')) return false;
58 std::istringstream L1(Line);
59 size_t NumFiles = 0;
60 L1 >> NumFiles;
61 if (NumFiles == 0 || NumFiles > 10000000) return false;
62
63 // Parse NumFilesInFirstCorpus.
64 if (!std::getline(IS, Line, '\n')) return false;
65 std::istringstream L2(Line);
66 NumFilesInFirstCorpus = NumFiles + 1;
67 L2 >> NumFilesInFirstCorpus;
68 if (NumFilesInFirstCorpus > NumFiles) return false;
69
70 // Parse file names.
71 Files.resize(NumFiles);
72 for (size_t i = 0; i < NumFiles; i++)
73 if (!std::getline(IS, Files[i].Name, '\n'))
74 return false;
75
kcc001e5f72019-02-14 23:12:33 +000076 // Parse STARTED, FT, and COV lines.
george.karpenkov29efa6d2017-08-21 23:25:50 +000077 size_t ExpectedStartMarker = 0;
78 const size_t kInvalidStartMarker = -1;
79 size_t LastSeenStartMarker = kInvalidStartMarker;
george.karpenkovfbfa45c2017-08-27 23:20:09 +000080 Vector<uint32_t> TmpFeatures;
kcc98a86242019-02-15 00:08:16 +000081 Set<uint32_t> PCs;
george.karpenkov29efa6d2017-08-21 23:25:50 +000082 while (std::getline(IS, Line, '\n')) {
83 std::istringstream ISS1(Line);
84 std::string Marker;
85 size_t N;
86 ISS1 >> Marker;
87 ISS1 >> N;
88 if (Marker == "STARTED") {
89 // STARTED FILE_ID FILE_SIZE
90 if (ExpectedStartMarker != N)
91 return false;
92 ISS1 >> Files[ExpectedStartMarker].Size;
93 LastSeenStartMarker = ExpectedStartMarker;
94 assert(ExpectedStartMarker < Files.size());
95 ExpectedStartMarker++;
kcc001e5f72019-02-14 23:12:33 +000096 } else if (Marker == "FT") {
97 // FT FILE_ID COV1 COV2 COV3 ...
george.karpenkov29efa6d2017-08-21 23:25:50 +000098 size_t CurrentFileIdx = N;
99 if (CurrentFileIdx != LastSeenStartMarker)
100 return false;
101 LastSeenStartMarker = kInvalidStartMarker;
102 if (ParseCoverage) {
103 TmpFeatures.clear(); // use a vector from outer scope to avoid resizes.
kcc9c0ed932019-02-15 01:22:00 +0000104 while (ISS1 >> N)
george.karpenkov29efa6d2017-08-21 23:25:50 +0000105 TmpFeatures.push_back(N);
mgrang2c1f00d2018-03-20 01:17:18 +0000106 std::sort(TmpFeatures.begin(), TmpFeatures.end());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000107 Files[CurrentFileIdx].Features = TmpFeatures;
108 }
kcc001e5f72019-02-14 23:12:33 +0000109 } else if (Marker == "COV") {
kcc98a86242019-02-15 00:08:16 +0000110 size_t CurrentFileIdx = N;
kcc001e5f72019-02-14 23:12:33 +0000111 if (ParseCoverage)
kcc9c0ed932019-02-15 01:22:00 +0000112 while (ISS1 >> N)
kcc001e5f72019-02-14 23:12:33 +0000113 if (PCs.insert(N).second)
kcc98a86242019-02-15 00:08:16 +0000114 Files[CurrentFileIdx].Cov.push_back(N);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000115 } else {
116 return false;
117 }
118 }
119 if (LastSeenStartMarker != kInvalidStartMarker)
120 LastFailure = Files[LastSeenStartMarker].Name;
121
122 FirstNotProcessedFile = ExpectedStartMarker;
123 return true;
124}
125
126size_t Merger::ApproximateMemoryConsumption() const {
127 size_t Res = 0;
128 for (const auto &F: Files)
129 Res += sizeof(F) + F.Features.size() * sizeof(F.Features[0]);
130 return Res;
131}
132
kcc243006d2019-02-12 00:12:33 +0000133// Decides which files need to be merged (add those to NewFiles).
george.karpenkov29efa6d2017-08-21 23:25:50 +0000134// Returns the number of new features added.
kcc95a78ad2019-02-15 00:15:13 +0000135size_t Merger::Merge(const Set<uint32_t> &InitialFeatures,
136 Set<uint32_t> *NewFeatures,
137 const Set<uint32_t> &InitialCov, Set<uint32_t> *NewCov,
138 Vector<std::string> *NewFiles) {
george.karpenkov29efa6d2017-08-21 23:25:50 +0000139 NewFiles->clear();
140 assert(NumFilesInFirstCorpus <= Files.size());
kcc243006d2019-02-12 00:12:33 +0000141 Set<uint32_t> AllFeatures = InitialFeatures;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000142
143 // What features are in the initial corpus?
144 for (size_t i = 0; i < NumFilesInFirstCorpus; i++) {
145 auto &Cur = Files[i].Features;
kcc243006d2019-02-12 00:12:33 +0000146 AllFeatures.insert(Cur.begin(), Cur.end());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000147 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000148 // Remove all features that we already know from all other inputs.
149 for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {
150 auto &Cur = Files[i].Features;
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000151 Vector<uint32_t> Tmp;
kcc243006d2019-02-12 00:12:33 +0000152 std::set_difference(Cur.begin(), Cur.end(), AllFeatures.begin(),
153 AllFeatures.end(), std::inserter(Tmp, Tmp.begin()));
george.karpenkov29efa6d2017-08-21 23:25:50 +0000154 Cur.swap(Tmp);
155 }
156
157 // Sort. Give preference to
158 // * smaller files
159 // * files with more features.
mgrang2c1f00d2018-03-20 01:17:18 +0000160 std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(),
161 [&](const MergeFileInfo &a, const MergeFileInfo &b) -> bool {
162 if (a.Size != b.Size)
163 return a.Size < b.Size;
164 return a.Features.size() > b.Features.size();
165 });
george.karpenkov29efa6d2017-08-21 23:25:50 +0000166
167 // One greedy pass: add the file's features to AllFeatures.
168 // If new features were added, add this file to NewFiles.
169 for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {
170 auto &Cur = Files[i].Features;
171 // Printf("%s -> sz %zd ft %zd\n", Files[i].Name.c_str(),
172 // Files[i].Size, Cur.size());
kcc243006d2019-02-12 00:12:33 +0000173 bool FoundNewFeatures = false;
174 for (auto Fe: Cur) {
175 if (AllFeatures.insert(Fe).second) {
176 FoundNewFeatures = true;
177 NewFeatures->insert(Fe);
178 }
179 }
180 if (FoundNewFeatures)
george.karpenkov29efa6d2017-08-21 23:25:50 +0000181 NewFiles->push_back(Files[i].Name);
kcc98a86242019-02-15 00:08:16 +0000182 for (auto Cov : Files[i].Cov)
183 if (InitialCov.find(Cov) == InitialCov.end())
184 NewCov->insert(Cov);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000185 }
kcc95a78ad2019-02-15 00:15:13 +0000186 return NewFeatures->size();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000187}
188
george.karpenkovfbfa45c2017-08-27 23:20:09 +0000189Set<uint32_t> Merger::AllFeatures() const {
190 Set<uint32_t> S;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000191 for (auto &File : Files)
192 S.insert(File.Features.begin(), File.Features.end());
193 return S;
194}
195
george.karpenkov29efa6d2017-08-21 23:25:50 +0000196// Inner process. May crash if the target crashes.
197void Fuzzer::CrashResistantMergeInternalStep(const std::string &CFPath) {
198 Printf("MERGE-INNER: using the control file '%s'\n", CFPath.c_str());
199 Merger M;
200 std::ifstream IF(CFPath);
201 M.ParseOrExit(IF, false);
202 IF.close();
203 if (!M.LastFailure.empty())
204 Printf("MERGE-INNER: '%s' caused a failure at the previous merge step\n",
205 M.LastFailure.c_str());
206
207 Printf("MERGE-INNER: %zd total files;"
208 " %zd processed earlier; will process %zd files now\n",
209 M.Files.size(), M.FirstNotProcessedFile,
210 M.Files.size() - M.FirstNotProcessedFile);
211
212 std::ofstream OF(CFPath, std::ofstream::out | std::ofstream::app);
kccb966c9e2017-09-15 22:02:26 +0000213 Set<size_t> AllFeatures;
dor1s94315732019-08-12 20:21:27 +0000214 auto PrintStatsWrapper = [this, &AllFeatures](const char* Where) {
215 this->PrintStats(Where, "\n", 0, AllFeatures.size());
216 };
kcc001e5f72019-02-14 23:12:33 +0000217 Set<const TracePC::PCTableEntry *> AllPCs;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000218 for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) {
kcca3815862019-02-08 21:27:23 +0000219 Fuzzer::MaybeExitGracefully();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000220 auto U = FileToVector(M.Files[i].Name);
221 if (U.size() > MaxInputLen) {
222 U.resize(MaxInputLen);
223 U.shrink_to_fit();
224 }
dor1sd6908fb2019-09-11 14:11:08 +0000225
george.karpenkov29efa6d2017-08-21 23:25:50 +0000226 // Write the pre-run marker.
kcc9c0ed932019-02-15 01:22:00 +0000227 OF << "STARTED " << i << " " << U.size() << "\n";
morehousea80f6452017-12-04 19:25:59 +0000228 OF.flush(); // Flush is important since Command::Execute may crash.
george.karpenkov29efa6d2017-08-21 23:25:50 +0000229 // Run.
230 TPC.ResetMaps();
231 ExecuteCallback(U.data(), U.size());
kccb966c9e2017-09-15 22:02:26 +0000232 // Collect coverage. We are iterating over the files in this order:
233 // * First, files in the initial corpus ordered by size, smallest first.
234 // * Then, all other files, smallest first.
235 // So it makes no sense to record all features for all files, instead we
236 // only record features that were not seen before.
237 Set<size_t> UniqFeatures;
kccc924e382017-09-15 22:10:36 +0000238 TPC.CollectFeatures([&](size_t Feature) {
kccb966c9e2017-09-15 22:02:26 +0000239 if (AllFeatures.insert(Feature).second)
240 UniqFeatures.insert(Feature);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000241 });
kcc001e5f72019-02-14 23:12:33 +0000242 TPC.UpdateObservedPCs();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000243 // Show stats.
244 if (!(TotalNumberOfRuns & (TotalNumberOfRuns - 1)))
dor1s94315732019-08-12 20:21:27 +0000245 PrintStatsWrapper("pulse ");
dor1s544be6a2019-08-09 18:20:53 +0000246 if (TotalNumberOfRuns == M.NumFilesInFirstCorpus)
dor1s94315732019-08-12 20:21:27 +0000247 PrintStatsWrapper("LOADED");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000248 // Write the post-run marker and the coverage.
kcc001e5f72019-02-14 23:12:33 +0000249 OF << "FT " << i;
kccb966c9e2017-09-15 22:02:26 +0000250 for (size_t F : UniqFeatures)
kcc9c0ed932019-02-15 01:22:00 +0000251 OF << " " << F;
george.karpenkov29efa6d2017-08-21 23:25:50 +0000252 OF << "\n";
kcc9c0ed932019-02-15 01:22:00 +0000253 OF << "COV " << i;
kcc001e5f72019-02-14 23:12:33 +0000254 TPC.ForEachObservedPC([&](const TracePC::PCTableEntry *TE) {
255 if (AllPCs.insert(TE).second)
256 OF << " " << TPC.PCTableEntryIdx(TE);
257 });
258 OF << "\n";
kcca00e8072017-11-09 21:30:33 +0000259 OF.flush();
george.karpenkov29efa6d2017-08-21 23:25:50 +0000260 }
dor1s94315732019-08-12 20:21:27 +0000261 PrintStatsWrapper("DONE ");
george.karpenkov29efa6d2017-08-21 23:25:50 +0000262}
263
dor1sd6908fb2019-09-11 14:11:08 +0000264static size_t WriteNewControlFile(const std::string &CFPath,
265 const Vector<SizedFile> &OldCorpus,
266 const Vector<SizedFile> &NewCorpus,
267 const Vector<MergeFileInfo> &KnownFiles) {
268 std::unordered_set<std::string> FilesToSkip;
269 for (auto &SF: KnownFiles)
270 FilesToSkip.insert(SF.Name);
271
272 Vector<std::string> FilesToUse;
273 auto MaybeUseFile = [=, &FilesToUse](std::string Name) {
274 if (FilesToSkip.find(Name) == FilesToSkip.end())
275 FilesToUse.push_back(Name);
276 };
277 for (auto &SF: OldCorpus)
278 MaybeUseFile(SF.File);
279 auto FilesToUseFromOldCorpus = FilesToUse.size();
280 for (auto &SF: NewCorpus)
281 MaybeUseFile(SF.File);
282
george.karpenkov29efa6d2017-08-21 23:25:50 +0000283 RemoveFile(CFPath);
284 std::ofstream ControlFile(CFPath);
dor1sd6908fb2019-09-11 14:11:08 +0000285 ControlFile << FilesToUse.size() << "\n";
286 ControlFile << FilesToUseFromOldCorpus << "\n";
287 for (auto &FN: FilesToUse)
288 ControlFile << FN << "\n";
289
george.karpenkov29efa6d2017-08-21 23:25:50 +0000290 if (!ControlFile) {
291 Printf("MERGE-OUTER: failed to write to the control file: %s\n",
292 CFPath.c_str());
293 exit(1);
294 }
dor1sd6908fb2019-09-11 14:11:08 +0000295
296 return FilesToUse.size();
kcc99a71a12017-11-09 05:49:28 +0000297}
george.karpenkov29efa6d2017-08-21 23:25:50 +0000298
kccd1449be2019-02-08 22:59:03 +0000299// Outer process. Does not call the target code and thus should not fail.
kcc4b5aa122019-02-09 00:16:21 +0000300void CrashResistantMerge(const Vector<std::string> &Args,
kccbfb59752019-02-12 03:12:40 +0000301 const Vector<SizedFile> &OldCorpus,
302 const Vector<SizedFile> &NewCorpus,
303 Vector<std::string> *NewFiles,
304 const Set<uint32_t> &InitialFeatures,
kcc98a86242019-02-15 00:08:16 +0000305 Set<uint32_t> *NewFeatures,
306 const Set<uint32_t> &InitialCov,
307 Set<uint32_t> *NewCov,
308 const std::string &CFPath,
kccbfb59752019-02-12 03:12:40 +0000309 bool V /*Verbose*/) {
kcc64bcb922019-02-13 04:04:45 +0000310 if (NewCorpus.empty() && OldCorpus.empty()) return; // Nothing to merge.
kcc99a71a12017-11-09 05:49:28 +0000311 size_t NumAttempts = 0;
dor1sd6908fb2019-09-11 14:11:08 +0000312 Vector<MergeFileInfo> KnownFiles;
kcca3815862019-02-08 21:27:23 +0000313 if (FileSize(CFPath)) {
kccbfb59752019-02-12 03:12:40 +0000314 VPrintf(V, "MERGE-OUTER: non-empty control file provided: '%s'\n",
kcca3815862019-02-08 21:27:23 +0000315 CFPath.c_str());
kcc99a71a12017-11-09 05:49:28 +0000316 Merger M;
kcca3815862019-02-08 21:27:23 +0000317 std::ifstream IF(CFPath);
dor1sd6908fb2019-09-11 14:11:08 +0000318 if (M.Parse(IF, /*ParseCoverage=*/true)) {
kccbfb59752019-02-12 03:12:40 +0000319 VPrintf(V, "MERGE-OUTER: control file ok, %zd files total,"
kcc99a71a12017-11-09 05:49:28 +0000320 " first not processed file %zd\n",
321 M.Files.size(), M.FirstNotProcessedFile);
322 if (!M.LastFailure.empty())
kccbfb59752019-02-12 03:12:40 +0000323 VPrintf(V, "MERGE-OUTER: '%s' will be skipped as unlucky "
kcc99a71a12017-11-09 05:49:28 +0000324 "(merge has stumbled on it the last time)\n",
325 M.LastFailure.c_str());
326 if (M.FirstNotProcessedFile >= M.Files.size()) {
dor1sd6908fb2019-09-11 14:11:08 +0000327 // Merge has already been completed with the given merge control file.
328 if (M.Files.size() == OldCorpus.size() + NewCorpus.size()) {
329 VPrintf(
330 V,
331 "MERGE-OUTER: nothing to do, merge has been completed before\n");
332 exit(0);
333 }
kcc99a71a12017-11-09 05:49:28 +0000334
dor1sd6908fb2019-09-11 14:11:08 +0000335 // Number of input files likely changed, start merge from scratch, but
336 // reuse coverage information from the given merge control file.
337 VPrintf(
338 V,
339 "MERGE-OUTER: starting merge from scratch, but reusing coverage "
340 "information from the given control file\n");
341 KnownFiles = M.Files;
342 } else {
343 // There is a merge in progress, continue.
344 NumAttempts = M.Files.size() - M.FirstNotProcessedFile;
345 }
kcc99a71a12017-11-09 05:49:28 +0000346 } else {
kccbfb59752019-02-12 03:12:40 +0000347 VPrintf(V, "MERGE-OUTER: bad control file, will overwrite it\n");
kcc99a71a12017-11-09 05:49:28 +0000348 }
349 }
350
351 if (!NumAttempts) {
352 // The supplied control file is empty or bad, create a fresh one.
dor1sd6908fb2019-09-11 14:11:08 +0000353 VPrintf(V, "MERGE-OUTER: "
354 "%zd files, %zd in the initial corpus, %zd processed earlier\n",
355 OldCorpus.size() + NewCorpus.size(), OldCorpus.size(),
356 KnownFiles.size());
357 NumAttempts = WriteNewControlFile(CFPath, OldCorpus, NewCorpus, KnownFiles);
kcc99a71a12017-11-09 05:49:28 +0000358 }
359
360 // Execute the inner process until it passes.
george.karpenkov29efa6d2017-08-21 23:25:50 +0000361 // Every inner process should execute at least one input.
morehousea80f6452017-12-04 19:25:59 +0000362 Command BaseCmd(Args);
363 BaseCmd.removeFlag("merge");
kcca3815862019-02-08 21:27:23 +0000364 BaseCmd.removeFlag("fork");
kccd701d9e2019-05-23 00:22:46 +0000365 BaseCmd.removeFlag("collect_data_flow");
kcc99a71a12017-11-09 05:49:28 +0000366 for (size_t Attempt = 1; Attempt <= NumAttempts; Attempt++) {
kcca3815862019-02-08 21:27:23 +0000367 Fuzzer::MaybeExitGracefully();
kccbfb59752019-02-12 03:12:40 +0000368 VPrintf(V, "MERGE-OUTER: attempt %zd\n", Attempt);
morehousea80f6452017-12-04 19:25:59 +0000369 Command Cmd(BaseCmd);
370 Cmd.addFlag("merge_control_file", CFPath);
371 Cmd.addFlag("merge_inner", "1");
kccbfb59752019-02-12 03:12:40 +0000372 if (!V) {
metzmane847d8a2019-02-27 19:27:16 +0000373 Cmd.setOutputFile(getDevNull());
kccbfb59752019-02-12 03:12:40 +0000374 Cmd.combineOutAndErr();
375 }
morehousea80f6452017-12-04 19:25:59 +0000376 auto ExitCode = ExecuteCommand(Cmd);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000377 if (!ExitCode) {
kccbfb59752019-02-12 03:12:40 +0000378 VPrintf(V, "MERGE-OUTER: succesfull in %zd attempt(s)\n", Attempt);
george.karpenkov29efa6d2017-08-21 23:25:50 +0000379 break;
380 }
381 }
george.karpenkov29efa6d2017-08-21 23:25:50 +0000382 // Read the control file and do the merge.
383 Merger M;
384 std::ifstream IF(CFPath);
385 IF.seekg(0, IF.end);
kccbfb59752019-02-12 03:12:40 +0000386 VPrintf(V, "MERGE-OUTER: the control file has %zd bytes\n",
387 (size_t)IF.tellg());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000388 IF.seekg(0, IF.beg);
389 M.ParseOrExit(IF, true);
390 IF.close();
kccbfb59752019-02-12 03:12:40 +0000391 VPrintf(V,
392 "MERGE-OUTER: consumed %zdMb (%zdMb rss) to parse the control file\n",
393 M.ApproximateMemoryConsumption() >> 20, GetPeakRSSMb());
dor1sd6908fb2019-09-11 14:11:08 +0000394
395 M.Files.insert(M.Files.end(), KnownFiles.begin(), KnownFiles.end());
kcc98a86242019-02-15 00:08:16 +0000396 M.Merge(InitialFeatures, NewFeatures, InitialCov, NewCov, NewFiles);
397 VPrintf(V, "MERGE-OUTER: %zd new files with %zd new features added; "
398 "%zd new coverage edges\n",
399 NewFiles->size(), NewFeatures->size(), NewCov->size());
george.karpenkov29efa6d2017-08-21 23:25:50 +0000400}
401
402} // namespace fuzzer