142       for (unsigned int i = 0; i < (*level_files_brief_)[0].num_files; ++i) {  in FilePicker()
155       while (curr_index_in_curr_level_ < curr_file_level_->num_files) {  in GetNextFile()
160             curr_index_in_curr_level_ == curr_file_level_->num_files - 1;  in GetNextFile()
171         if (num_levels_ > 1 || curr_file_level_->num_files > 3) {  in GetNextFile()
279       if (curr_file_level_->num_files == 0) {  in PrepareNextLevel()
310                 static_cast<int32_t>(curr_file_level_->num_files) - 1;  in PrepareNextLevel()
390       for (unsigned int i = 0; i < (*level_files_brief_)[0].num_files; ++i) {  in FilePickerMultiGet()
412     if (curr_file_index >= curr_file_level_->num_files) {  in GetNextFileInLevelWithKeys()
446       if (num_levels_ > 1 || curr_file_level_->num_files > 3) {  in GetNextFileInLevelWithKeys()
499                 : curr_file_level_->num_files;  in GetNextFileInLevelWithKeys()
540               : curr_file_level_->num_files;  in GetNextFile()
562             curr_file_index == curr_file_level_->num_files - 1;  in GetNextFile()
627           curr_file_level_->num_files) {  in PrepareNextLevel()
639       if (curr_file_level_->num_files == 0) {  in PrepareNextLevel()
660                  (*level_files_brief_)[curr_level_].num_files == 0);  in PrepareNextLevel()
686                   static_cast<int32_t>(curr_file_level_->num_files) - 1;  in PrepareNextLevel()
765                          static_cast<uint32_t>(file_level.num_files));  in FindFile()
775   file_level->num_files = num;  in DoGenerateLevelFilesBrief()
823     for (size_t i = 0; i < file_level.num_files; i++) {  in SomeFileOverlapsRange()
844   if (index >= file_level.num_files) {  in SomeFileOverlapsRange()
876         file_index_(flevel_->num_files),  in LevelIterator()
882     assert(flevel_ != nullptr && flevel_->num_files > 0);  in LevelIterator()
952     assert(file_index < flevel_->num_files);  in file_smallest_key()
964     assert(file_index_ < flevel_->num_files);  in NewFileIterator()
991         file_index_ < flevel_->num_files) {  in CheckMayBeOutOfLowerBound()
1030   if (file_iter_.iter() != nullptr && file_index_ < flevel_->num_files) {  in Seek()
1082   if (new_file_index >= flevel_->num_files) {  in SeekForPrev()
1083     new_file_index = flevel_->num_files - 1;  in SeekForPrev()
1104   InitFileIterator(flevel_->num_files - 1);  in SeekToLast()
1137     if (file_index_ >= flevel_->num_files - 1) {  in SkipEmptyFileForward()
1184   if (new_file_index >= flevel_->num_files) {  in InitFileIterator()
1404     for (size_t i = 0; i < file_level.num_files; i++) {  in GetMemoryUsageByTableReaders()
1554   } else if (storage_info_.LevelFilesBrief(level).num_files == 0) {  in AddIteratorsForLevel()
1564     for (size_t i = 0; i < storage_info_.LevelFilesBrief(0).num_files; i++) {  in AddIteratorsForLevel()
1585   } else if (storage_info_.LevelFilesBrief(level).num_files > 0) {  in AddIteratorsForLevel()
1618     for (size_t i = 0; i < storage_info_.LevelFilesBrief(0).num_files; i++) {  in OverlapWithLevelIterator()
1639   } else if (storage_info_.LevelFilesBrief(level).num_files > 0) {  in OverlapWithLevelIterator()
2648            LevelFiles(level).size() == LevelFilesBrief(level).num_files);  in SetFinalized()
2786       level_files_brief_[0].files + level_files_brief_[0].num_files);  in GenerateLevel0NonOverlapping()
2807     for (size_t file_idx = 0; file_idx < level_files_brief_[level].num_files;  in GenerateBottommostFiles()
2923   for (size_t i = 0; i < level_files_brief_[level].num_files; i++) {  in GetOverlappingInputs()
2985       level_files_brief_[level].num_files == 0) {  in GetCleanInputsWithinInterval()
3011   const int num_files = static_cast<int>(level_files_brief_[level].num_files);  in GetOverlappingInputsRangeBinarySearch()  local
3016   int end_index = num_files;  in GetOverlappingInputsRangeBinarySearch()
3030                          files + (hint_index == -1 ? num_files : hint_index),  in GetOverlappingInputsRangeBinarySearch()
3036       while (is_overlapping && start_index < num_files) {  in GetOverlappingInputsRangeBinarySearch()
3056         std::upper_bound(files + start_index, files + num_files, end, cmp) -  in GetOverlappingInputsRangeBinarySearch()
3059     if (end_index < num_files && within_interval) {  in GetOverlappingInputsRangeBinarySearch()
5320     if (files_brief.num_files == 0) {  in ApproximateSize()
5329       for (size_t i = 0; i < files_brief.num_files; i++) {  in ApproximateSize()
5336     assert(files_brief.num_files > 0);  in ApproximateSize()
5341                         static_cast<uint32_t>(files_brief.num_files - 1));  in ApproximateSize()
5342     assert(static_cast<size_t>(idx_start) < files_brief.num_files);  in ApproximateSize()
5349                           static_cast<uint32_t>(files_brief.num_files - 1));  in ApproximateSize()
5352            static_cast<size_t>(idx_end) < files_brief.num_files);  in ApproximateSize()
5532   const size_t space = (c->level() == 0 ? c->input_levels(0)->num_files +  in MakeInputIterator()
5538     if (c->input_levels(which)->num_files != 0) {  in MakeInputIterator()
5541         for (size_t i = 0; i < flevel->num_files; i++) {  in MakeInputIterator()