71   Files.resize(NumFiles);  in Parse()
73     if (!std::getline(IS, Files[i].Name, '\n'))  in Parse()
92       ISS1 >> Files[ExpectedStartMarker].Size;  in Parse()
94       assert(ExpectedStartMarker < Files.size());  in Parse()
107         Files[CurrentFileIdx].Features = TmpFeatures;  in Parse()
114             Files[CurrentFileIdx].Cov.push_back(N);  in Parse()
120     LastFailure = Files[LastSeenStartMarker].Name;  in Parse()
128   for (const auto &F: Files)  in ApproximateMemoryConsumption()
143   assert(NumFilesInFirstCorpus <= Files.size());  in Merge()
148     auto &Cur = Files[i].Features;  in Merge()
152   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
153     auto &Cur = Files[i].Features;  in Merge()
163   std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(),  in Merge()
172   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
173     auto &Cur = Files[i].Features;  in Merge()
184       NewFiles->push_back(Files[i].Name);  in Merge()
185     for (auto Cov : Files[i].Cov)  in Merge()
194   for (auto &File : Files)  in AllFeatures()
213          M.Files.size(), M.FirstNotProcessedFile,  in CrashResistantMergeInternalStep()
214          M.Files.size() - M.FirstNotProcessedFile);  in CrashResistantMergeInternalStep()
222   for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) {  in CrashResistantMergeInternalStep()
224     auto U = FileToVector(M.Files[i].Name);  in CrashResistantMergeInternalStep()
281   assert(NumFilesInFirstCorpus <= Files.size());  in SetCoverMerge()
294     ExistingFeatures.insert(Files[i].Features.begin(), Files[i].Features.end());  in SetCoverMerge()
308   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); ++i) {  in SetCoverMerge()
314     for (const auto &F : Files[i].Features)  in SetCoverMerge()
332       const auto &File = Files[i];  in SetCoverMerge()
345                   File.Size < Files[MaxFeaturesIndex].Size)) {  in SetCoverMerge()
353     assert(MaxFeaturesIndex < Files.size());  in SetCoverMerge()
369     const auto &MaxFeatureFile = Files[MaxFeaturesIndex];  in SetCoverMerge()
448              M.Files.size(), M.FirstNotProcessedFile);  in CrashResistantMerge()
453       if (M.FirstNotProcessedFile >= M.Files.size()) {  in CrashResistantMerge()
455         if (M.Files.size() == OldCorpus.size() + NewCorpus.size()) {  in CrashResistantMerge()
468         KnownFiles = M.Files;  in CrashResistantMerge()
471         NumAttempts = M.Files.size() - M.FirstNotProcessedFile;  in CrashResistantMerge()
525   M.Files.insert(M.Files.end(), KnownFiles.begin(), KnownFiles.end());  in CrashResistantMerge()