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()
142   assert(NumFilesInFirstCorpus <= Files.size());  in Merge()
147     auto &Cur = Files[i].Features;  in Merge()
151   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
152     auto &Cur = Files[i].Features;  in Merge()
162   std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(),  in Merge()
171   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
172     auto &Cur = Files[i].Features;  in Merge()
183       NewFiles->push_back(Files[i].Name);  in Merge()
184     for (auto Cov : Files[i].Cov)  in Merge()
193   for (auto &File : Files)  in AllFeatures()
211          M.Files.size(), M.FirstNotProcessedFile,  in CrashResistantMergeInternalStep()
212          M.Files.size() - M.FirstNotProcessedFile);  in CrashResistantMergeInternalStep()
220   for (size_t i = M.FirstNotProcessedFile; i < M.Files.size(); i++) {  in CrashResistantMergeInternalStep()
222     auto U = FileToVector(M.Files[i].Name);  in CrashResistantMergeInternalStep()
323              M.Files.size(), M.FirstNotProcessedFile);  in CrashResistantMerge()
328       if (M.FirstNotProcessedFile >= M.Files.size()) {  in CrashResistantMerge()
330         if (M.Files.size() == OldCorpus.size() + NewCorpus.size()) {  in CrashResistantMerge()
343         KnownFiles = M.Files;  in CrashResistantMerge()
346         NumAttempts = M.Files.size() - M.FirstNotProcessedFile;  in CrashResistantMerge()
397   M.Files.insert(M.Files.end(), KnownFiles.begin(), KnownFiles.end());  in CrashResistantMerge()