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()
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()
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()
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()
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()
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()
318     for (const auto &F : Files[i].Features)  in SetCoverMerge()
336       const auto &File = Files[i];  in SetCoverMerge()
349                   File.Size < Files[MaxFeaturesIndex].Size)) {  in SetCoverMerge()
357     assert(MaxFeaturesIndex < Files.size());  in SetCoverMerge()
373     const auto &MaxFeatureFile = Files[MaxFeaturesIndex];  in SetCoverMerge()
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()
472         KnownFiles = M.Files;  in CrashResistantMerge()
475         NumAttempts = M.Files.size() - M.FirstNotProcessedFile;  in CrashResistantMerge()
529   M.Files.insert(M.Files.end(), KnownFiles.begin(), KnownFiles.end());  in CrashResistantMerge()