69   Files.resize(NumFiles);  in Parse()
71     if (!std::getline(IS, Files[i].Name, '\n'))  in Parse()
89       ISS1 >> Files[ExpectedStartMarker].Size;  in Parse()
91       assert(ExpectedStartMarker < Files.size());  in Parse()
104         Files[CurrentFileIdx].Features = TmpFeatures;  in Parse()
111     LastFailure = Files[LastSeenStartMarker].Name;  in Parse()
119   for (const auto &F: Files)  in ApproximateMemoryConsumption()
129   assert(NumFilesInFirstCorpus <= Files.size());  in Merge()
134     auto &Cur = Files[i].Features;  in Merge()
140   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
141     auto &Cur = Files[i].Features;  in Merge()
151   std::sort(Files.begin() + NumFilesInFirstCorpus, Files.end(),  in Merge()
160   for (size_t i = NumFilesInFirstCorpus; i < Files.size(); i++) {  in Merge()
161     auto &Cur = Files[i].Features;  in Merge()
167       NewFiles->push_back(Files[i].Name);  in Merge()
173   for (auto &File : Files) {  in PrintSummary()
184   for (auto &File : Files)  in AllFeatures()
221          M.Files.size(), M.FirstNotProcessedFile,  in CrashResistantMergeInternalStep()
222          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()
303              M.Files.size(), M.FirstNotProcessedFile);  in CrashResistantMerge()
308       if (M.FirstNotProcessedFile >= M.Files.size()) {  in CrashResistantMerge()
313       NumAttempts = M.Files.size() - M.FirstNotProcessedFile;  in CrashResistantMerge()
368            M.Files.size(), CoverageSummaryOutputPathOrNull);  in CrashResistantMerge()