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