71   Files.resize(NumFiles);  in Parse()
73     if (!std::getline(IS, Files[i].Name, '\n'))  in Parse()
93       ISS1 >> Files[ExpectedStartMarker].Size;  in Parse()
95       assert(ExpectedStartMarker < Files.size());  in Parse()
109         Files[CurrentFileIdx].Features = TmpFeatures;  in Parse()
118             Files[CurrentFileIdx].Cov.push_back(N);  in Parse()
124     LastFailure = Files[LastSeenStartMarker].Name;  in Parse()
132   for (const auto &F: Files)  in ApproximateMemoryConsumption()
137 // Decides which files need to be merged (add those to NewFiles).
147   assert(NumFilesInFirstCorpus <= Files.size());  in Merge()
152     auto &Cur = Files[i].Features;  in Merge()
156   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
157     auto &Cur = Files[i].Features;  in Merge()
165   //   * smaller files  in Merge()
166   //   * files with more features.  in Merge()
167   std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(),  in Merge()
176   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
177     auto &Cur = Files[i].Features;  in Merge()
178     // Printf("%s -> sz %zd ft %zd\n", Files[i].Name.c_str(),  in Merge()
179     //       Files[i].Size, Cur.size());  in Merge()
188       NewFiles->push_back(Files[i].Name);  in Merge()
189     for (auto Cov : Files[i].Cov)  in Merge()
198   for (auto &File : Files)  in AllFeatures()
215   Printf("MERGE-INNER: %zd total files;"  in CrashResistantMergeInternalStep()
216          " %zd processed earlier; will process %zd files now\n",  in CrashResistantMergeInternalStep()
217          M.Files.size(), M.FirstNotProcessedFile,  in CrashResistantMergeInternalStep()
218          M.Files.size() - M.FirstNotProcessedFile);  in CrashResistantMergeInternalStep()
226   for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) {  in CrashResistantMergeInternalStep()
228     auto U = FileToVector(M.Files[i].Name);  in CrashResistantMergeInternalStep()
240     // Collect coverage. We are iterating over the files in this order:  in CrashResistantMergeInternalStep()
241     // * First, files in the initial corpus ordered by size, smallest first.  in CrashResistantMergeInternalStep()
242     // * Then, all other files, smallest first.  in CrashResistantMergeInternalStep()
276 // of corpora files, that cover all known features (set cover problem).
277 // Generally, this means that files with more features are preferred for
278 // merge into the first corpus. When two files have the same number of
285   assert(NumFilesInFirstCorpus <= Files.size());  in SetCoverMerge()
298     ExistingFeatures.insert(Files[i].Features.begin(), Files[i].Features.end());  in SetCoverMerge()
312   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); ++i) {  in SetCoverMerge()
314     // indices to all files (excluding those in the initial corpus).  in SetCoverMerge()
315     // RemainingFiles = range(NumFilesInFirstCorpus..Files.size()).  in SetCoverMerge()
318     for (const auto &F : Files[i].Features)  in SetCoverMerge()
322   // Integrate files into Covered until set is complete.  in SetCoverMerge()
332     // Iterate over all files not yet integrated into Covered,  in SetCoverMerge()
336       const auto &File = Files[i];  in SetCoverMerge()
349                   File.Size < Files[MaxFeaturesIndex].Size)) {  in SetCoverMerge()
351         // Break ties by selecting smaller files.  in SetCoverMerge()
357     assert(MaxFeaturesIndex < Files.size());  in SetCoverMerge()
358     // Remove any feature-less files found.  in SetCoverMerge()
363       // This means that we should have no remaining files.  in SetCoverMerge()
373     const auto &MaxFeatureFile = Files[MaxFeaturesIndex];  in SetCoverMerge()
450       VPrintf(V, "MERGE-OUTER: control file ok, %zd files total,"  in CrashResistantMerge()
452              M.Files.size(), M.FirstNotProcessedFile);  in CrashResistantMerge()
457       if (M.FirstNotProcessedFile >= M.Files.size()) {  in CrashResistantMerge()
459         if (M.Files.size() == OldCorpus.size() + NewCorpus.size()) {  in CrashResistantMerge()
466         // Number of input files likely changed, start merge from scratch, but  in CrashResistantMerge()
472         KnownFiles = M.Files;  in CrashResistantMerge()
475         NumAttempts = M.Files.size() - M.FirstNotProcessedFile;  in CrashResistantMerge()
485             "%zd files, %zd in the initial corpus, %zd processed earlier\n",  in CrashResistantMerge()
529   M.Files.insert(M.Files.end(), KnownFiles.begin(), KnownFiles.end());  in CrashResistantMerge()
534   VPrintf(V, "MERGE-OUTER: %zd new files with %zd new features added; "  in CrashResistantMerge()