george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 1 | //===- FuzzerMerge.cpp - merging corpora ----------------------------------===// |
| 2 | // |
chandlerc | 4028449 | 2019-01-19 08:50:56 +0000 | [diff] [blame] | 3 | // 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.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 6 | // |
| 7 | //===----------------------------------------------------------------------===// |
| 8 | // Merging corpora. |
| 9 | //===----------------------------------------------------------------------===// |
| 10 | |
morehouse | a80f645 | 2017-12-04 19:25:59 +0000 | [diff] [blame] | 11 | #include "FuzzerCommand.h" |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 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 |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 45 | // 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.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 48 | // STARTED 2 567 |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 49 | // FT 2 8 9 |
| 50 | // COV 2 11 12 |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 51 | bool 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 | |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 75 | // Parse STARTED, FT, and COV lines. |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 76 | size_t ExpectedStartMarker = 0; |
| 77 | const size_t kInvalidStartMarker = -1; |
| 78 | size_t LastSeenStartMarker = kInvalidStartMarker; |
george.karpenkov | fbfa45c | 2017-08-27 23:20:09 +0000 | [diff] [blame] | 79 | Vector<uint32_t> TmpFeatures; |
kcc | 98a8624 | 2019-02-15 00:08:16 +0000 | [diff] [blame] | 80 | Set<uint32_t> PCs; |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 81 | 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++; |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 95 | } else if (Marker == "FT") { |
| 96 | // FT FILE_ID COV1 COV2 COV3 ... |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 97 | 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. |
kcc | 9c0ed93 | 2019-02-15 01:22:00 +0000 | [diff] [blame] | 103 | while (ISS1 >> N) |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 104 | TmpFeatures.push_back(N); |
mgrang | 2c1f00d | 2018-03-20 01:17:18 +0000 | [diff] [blame] | 105 | std::sort(TmpFeatures.begin(), TmpFeatures.end()); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 106 | Files[CurrentFileIdx].Features = TmpFeatures; |
| 107 | } |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 108 | } else if (Marker == "COV") { |
kcc | 98a8624 | 2019-02-15 00:08:16 +0000 | [diff] [blame] | 109 | size_t CurrentFileIdx = N; |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 110 | if (ParseCoverage) |
kcc | 9c0ed93 | 2019-02-15 01:22:00 +0000 | [diff] [blame] | 111 | while (ISS1 >> N) |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 112 | if (PCs.insert(N).second) |
kcc | 98a8624 | 2019-02-15 00:08:16 +0000 | [diff] [blame] | 113 | Files[CurrentFileIdx].Cov.push_back(N); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 114 | } else { |
| 115 | return false; |
| 116 | } |
| 117 | } |
| 118 | if (LastSeenStartMarker != kInvalidStartMarker) |
| 119 | LastFailure = Files[LastSeenStartMarker].Name; |
| 120 | |
| 121 | FirstNotProcessedFile = ExpectedStartMarker; |
| 122 | return true; |
| 123 | } |
| 124 | |
| 125 | size_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 | |
kcc | 243006d | 2019-02-12 00:12:33 +0000 | [diff] [blame] | 132 | // Decides which files need to be merged (add those to NewFiles). |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 133 | // Returns the number of new features added. |
kcc | 95a78ad | 2019-02-15 00:15:13 +0000 | [diff] [blame] | 134 | size_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.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 138 | NewFiles->clear(); |
| 139 | assert(NumFilesInFirstCorpus <= Files.size()); |
kcc | 243006d | 2019-02-12 00:12:33 +0000 | [diff] [blame] | 140 | Set<uint32_t> AllFeatures = InitialFeatures; |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 141 | |
| 142 | // What features are in the initial corpus? |
| 143 | for (size_t i = 0; i < NumFilesInFirstCorpus; i++) { |
| 144 | auto &Cur = Files[i].Features; |
kcc | 243006d | 2019-02-12 00:12:33 +0000 | [diff] [blame] | 145 | AllFeatures.insert(Cur.begin(), Cur.end()); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 146 | } |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 147 | // 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.karpenkov | fbfa45c | 2017-08-27 23:20:09 +0000 | [diff] [blame] | 150 | Vector<uint32_t> Tmp; |
kcc | 243006d | 2019-02-12 00:12:33 +0000 | [diff] [blame] | 151 | std::set_difference(Cur.begin(), Cur.end(), AllFeatures.begin(), |
| 152 | AllFeatures.end(), std::inserter(Tmp, Tmp.begin())); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 153 | Cur.swap(Tmp); |
| 154 | } |
| 155 | |
| 156 | // Sort. Give preference to |
| 157 | // * smaller files |
| 158 | // * files with more features. |
mgrang | 2c1f00d | 2018-03-20 01:17:18 +0000 | [diff] [blame] | 159 | 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.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 165 | |
| 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()); |
kcc | 243006d | 2019-02-12 00:12:33 +0000 | [diff] [blame] | 172 | 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.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 180 | NewFiles->push_back(Files[i].Name); |
kcc | 98a8624 | 2019-02-15 00:08:16 +0000 | [diff] [blame] | 181 | for (auto Cov : Files[i].Cov) |
| 182 | if (InitialCov.find(Cov) == InitialCov.end()) |
| 183 | NewCov->insert(Cov); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 184 | } |
kcc | 95a78ad | 2019-02-15 00:15:13 +0000 | [diff] [blame] | 185 | return NewFeatures->size(); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 186 | } |
| 187 | |
george.karpenkov | fbfa45c | 2017-08-27 23:20:09 +0000 | [diff] [blame] | 188 | Set<uint32_t> Merger::AllFeatures() const { |
| 189 | Set<uint32_t> S; |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 190 | for (auto &File : Files) |
| 191 | S.insert(File.Features.begin(), File.Features.end()); |
| 192 | return S; |
| 193 | } |
| 194 | |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 195 | // Inner process. May crash if the target crashes. |
| 196 | void 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); |
kcc | b966c9e | 2017-09-15 22:02:26 +0000 | [diff] [blame] | 212 | Set<size_t> AllFeatures; |
dor1s | 9431573 | 2019-08-12 20:21:27 +0000 | [diff] [blame] | 213 | auto PrintStatsWrapper = [this, &AllFeatures](const char* Where) { |
| 214 | this->PrintStats(Where, "\n", 0, AllFeatures.size()); |
| 215 | }; |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 216 | Set<const TracePC::PCTableEntry *> AllPCs; |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 217 | for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) { |
kcc | a381586 | 2019-02-08 21:27:23 +0000 | [diff] [blame] | 218 | Fuzzer::MaybeExitGracefully(); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 219 | 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. |
kcc | 9c0ed93 | 2019-02-15 01:22:00 +0000 | [diff] [blame] | 226 | OF << "STARTED " << i << " " << U.size() << "\n"; |
morehouse | a80f645 | 2017-12-04 19:25:59 +0000 | [diff] [blame] | 227 | OF.flush(); // Flush is important since Command::Execute may crash. |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 228 | // Run. |
| 229 | TPC.ResetMaps(); |
| 230 | ExecuteCallback(U.data(), U.size()); |
kcc | b966c9e | 2017-09-15 22:02:26 +0000 | [diff] [blame] | 231 | // 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; |
kcc | c924e38 | 2017-09-15 22:10:36 +0000 | [diff] [blame] | 237 | TPC.CollectFeatures([&](size_t Feature) { |
kcc | b966c9e | 2017-09-15 22:02:26 +0000 | [diff] [blame] | 238 | if (AllFeatures.insert(Feature).second) |
| 239 | UniqFeatures.insert(Feature); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 240 | }); |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 241 | TPC.UpdateObservedPCs(); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 242 | // Show stats. |
| 243 | if (!(TotalNumberOfRuns & (TotalNumberOfRuns - 1))) |
dor1s | 9431573 | 2019-08-12 20:21:27 +0000 | [diff] [blame] | 244 | PrintStatsWrapper("pulse "); |
dor1s | 544be6a | 2019-08-09 18:20:53 +0000 | [diff] [blame] | 245 | if (TotalNumberOfRuns == M.NumFilesInFirstCorpus) |
dor1s | 9431573 | 2019-08-12 20:21:27 +0000 | [diff] [blame] | 246 | PrintStatsWrapper("LOADED"); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 247 | // Write the post-run marker and the coverage. |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 248 | OF << "FT " << i; |
kcc | b966c9e | 2017-09-15 22:02:26 +0000 | [diff] [blame] | 249 | for (size_t F : UniqFeatures) |
kcc | 9c0ed93 | 2019-02-15 01:22:00 +0000 | [diff] [blame] | 250 | OF << " " << F; |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 251 | OF << "\n"; |
kcc | 9c0ed93 | 2019-02-15 01:22:00 +0000 | [diff] [blame] | 252 | OF << "COV " << i; |
kcc | 001e5f7 | 2019-02-14 23:12:33 +0000 | [diff] [blame] | 253 | TPC.ForEachObservedPC([&](const TracePC::PCTableEntry *TE) { |
| 254 | if (AllPCs.insert(TE).second) |
| 255 | OF << " " << TPC.PCTableEntryIdx(TE); |
| 256 | }); |
| 257 | OF << "\n"; |
kcc | a00e807 | 2017-11-09 21:30:33 +0000 | [diff] [blame] | 258 | OF.flush(); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 259 | } |
dor1s | 9431573 | 2019-08-12 20:21:27 +0000 | [diff] [blame] | 260 | PrintStatsWrapper("DONE "); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 261 | } |
| 262 | |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 263 | static void WriteNewControlFile(const std::string &CFPath, |
kcc | d1449be | 2019-02-08 22:59:03 +0000 | [diff] [blame] | 264 | const Vector<SizedFile> &OldCorpus, |
| 265 | const Vector<SizedFile> &NewCorpus) { |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 266 | RemoveFile(CFPath); |
| 267 | std::ofstream ControlFile(CFPath); |
kcc | d1449be | 2019-02-08 22:59:03 +0000 | [diff] [blame] | 268 | 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) |
kcc | b966c9e | 2017-09-15 22:02:26 +0000 | [diff] [blame] | 273 | ControlFile << SF.File << "\n"; |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 274 | if (!ControlFile) { |
| 275 | Printf("MERGE-OUTER: failed to write to the control file: %s\n", |
| 276 | CFPath.c_str()); |
| 277 | exit(1); |
| 278 | } |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 279 | } |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 280 | |
kcc | d1449be | 2019-02-08 22:59:03 +0000 | [diff] [blame] | 281 | // Outer process. Does not call the target code and thus should not fail. |
kcc | 4b5aa12 | 2019-02-09 00:16:21 +0000 | [diff] [blame] | 282 | void CrashResistantMerge(const Vector<std::string> &Args, |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 283 | const Vector<SizedFile> &OldCorpus, |
| 284 | const Vector<SizedFile> &NewCorpus, |
| 285 | Vector<std::string> *NewFiles, |
| 286 | const Set<uint32_t> &InitialFeatures, |
kcc | 98a8624 | 2019-02-15 00:08:16 +0000 | [diff] [blame] | 287 | Set<uint32_t> *NewFeatures, |
| 288 | const Set<uint32_t> &InitialCov, |
| 289 | Set<uint32_t> *NewCov, |
| 290 | const std::string &CFPath, |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 291 | bool V /*Verbose*/) { |
kcc | 64bcb92 | 2019-02-13 04:04:45 +0000 | [diff] [blame] | 292 | if (NewCorpus.empty() && OldCorpus.empty()) return; // Nothing to merge. |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 293 | size_t NumAttempts = 0; |
kcc | a381586 | 2019-02-08 21:27:23 +0000 | [diff] [blame] | 294 | if (FileSize(CFPath)) { |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 295 | VPrintf(V, "MERGE-OUTER: non-empty control file provided: '%s'\n", |
kcc | a381586 | 2019-02-08 21:27:23 +0000 | [diff] [blame] | 296 | CFPath.c_str()); |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 297 | Merger M; |
kcc | a381586 | 2019-02-08 21:27:23 +0000 | [diff] [blame] | 298 | std::ifstream IF(CFPath); |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 299 | if (M.Parse(IF, /*ParseCoverage=*/false)) { |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 300 | VPrintf(V, "MERGE-OUTER: control file ok, %zd files total," |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 301 | " first not processed file %zd\n", |
| 302 | M.Files.size(), M.FirstNotProcessedFile); |
| 303 | if (!M.LastFailure.empty()) |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 304 | VPrintf(V, "MERGE-OUTER: '%s' will be skipped as unlucky " |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 305 | "(merge has stumbled on it the last time)\n", |
| 306 | M.LastFailure.c_str()); |
| 307 | if (M.FirstNotProcessedFile >= M.Files.size()) { |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 308 | VPrintf( |
| 309 | V, "MERGE-OUTER: nothing to do, merge has been completed before\n"); |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 310 | exit(0); |
| 311 | } |
| 312 | |
| 313 | NumAttempts = M.Files.size() - M.FirstNotProcessedFile; |
| 314 | } else { |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 315 | VPrintf(V, "MERGE-OUTER: bad control file, will overwrite it\n"); |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 316 | } |
| 317 | } |
| 318 | |
| 319 | if (!NumAttempts) { |
| 320 | // The supplied control file is empty or bad, create a fresh one. |
kcc | d1449be | 2019-02-08 22:59:03 +0000 | [diff] [blame] | 321 | NumAttempts = OldCorpus.size() + NewCorpus.size(); |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 322 | VPrintf(V, "MERGE-OUTER: %zd files, %zd in the initial corpus\n", |
| 323 | NumAttempts, OldCorpus.size()); |
kcc | d1449be | 2019-02-08 22:59:03 +0000 | [diff] [blame] | 324 | WriteNewControlFile(CFPath, OldCorpus, NewCorpus); |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 325 | } |
| 326 | |
| 327 | // Execute the inner process until it passes. |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 328 | // Every inner process should execute at least one input. |
morehouse | a80f645 | 2017-12-04 19:25:59 +0000 | [diff] [blame] | 329 | Command BaseCmd(Args); |
| 330 | BaseCmd.removeFlag("merge"); |
kcc | a381586 | 2019-02-08 21:27:23 +0000 | [diff] [blame] | 331 | BaseCmd.removeFlag("fork"); |
kcc | d701d9e | 2019-05-23 00:22:46 +0000 | [diff] [blame] | 332 | BaseCmd.removeFlag("collect_data_flow"); |
kcc | 99a71a1 | 2017-11-09 05:49:28 +0000 | [diff] [blame] | 333 | for (size_t Attempt = 1; Attempt <= NumAttempts; Attempt++) { |
kcc | a381586 | 2019-02-08 21:27:23 +0000 | [diff] [blame] | 334 | Fuzzer::MaybeExitGracefully(); |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 335 | VPrintf(V, "MERGE-OUTER: attempt %zd\n", Attempt); |
morehouse | a80f645 | 2017-12-04 19:25:59 +0000 | [diff] [blame] | 336 | Command Cmd(BaseCmd); |
| 337 | Cmd.addFlag("merge_control_file", CFPath); |
| 338 | Cmd.addFlag("merge_inner", "1"); |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 339 | if (!V) { |
metzman | e847d8a | 2019-02-27 19:27:16 +0000 | [diff] [blame] | 340 | Cmd.setOutputFile(getDevNull()); |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 341 | Cmd.combineOutAndErr(); |
| 342 | } |
morehouse | a80f645 | 2017-12-04 19:25:59 +0000 | [diff] [blame] | 343 | auto ExitCode = ExecuteCommand(Cmd); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 344 | if (!ExitCode) { |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 345 | VPrintf(V, "MERGE-OUTER: succesfull in %zd attempt(s)\n", Attempt); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 346 | break; |
| 347 | } |
| 348 | } |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 349 | // Read the control file and do the merge. |
| 350 | Merger M; |
| 351 | std::ifstream IF(CFPath); |
| 352 | IF.seekg(0, IF.end); |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 353 | VPrintf(V, "MERGE-OUTER: the control file has %zd bytes\n", |
| 354 | (size_t)IF.tellg()); |
george.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 355 | IF.seekg(0, IF.beg); |
| 356 | M.ParseOrExit(IF, true); |
| 357 | IF.close(); |
kcc | bfb5975 | 2019-02-12 03:12:40 +0000 | [diff] [blame] | 358 | VPrintf(V, |
| 359 | "MERGE-OUTER: consumed %zdMb (%zdMb rss) to parse the control file\n", |
| 360 | M.ApproximateMemoryConsumption() >> 20, GetPeakRSSMb()); |
kcc | 98a8624 | 2019-02-15 00:08:16 +0000 | [diff] [blame] | 361 | 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.karpenkov | 29efa6d | 2017-08-21 23:25:50 +0000 | [diff] [blame] | 365 | } |
| 366 | |
| 367 | } // namespace fuzzer |