139   InputFileInfo() : f(nullptr), level(0), index(0) {}  in InputFileInfo()
141   FileMetaData* f;  member
153     return (ucmp_->Compare(i1.f->smallest.user_key(),  in operator ()()
154                            i2.f->smallest.user_key()) > 0);  in operator ()()
178           input_file.f = c->input(0, i);  in create_level_heap()
184         input_file.f = c->input(l, 0);  in create_level_heap()
200   for (FileMetaData* f : files) {  in GetSmallestLargestSeqno()
201     assert(f->fd.smallest_seqno <= f->fd.largest_seqno);  in GetSmallestLargestSeqno()
204       *smallest_seqno = f->fd.smallest_seqno;  in GetSmallestLargestSeqno()
205       *largest_seqno = f->fd.largest_seqno;  in GetSmallestLargestSeqno()
207       if (f->fd.smallest_seqno < *smallest_seqno) {  in GetSmallestLargestSeqno()
208         *smallest_seqno = f->fd.smallest_seqno;  in GetSmallestLargestSeqno()
210       if (f->fd.largest_seqno > *largest_seqno) {  in GetSmallestLargestSeqno()
211         *largest_seqno = f->fd.largest_seqno;  in GetSmallestLargestSeqno()
238       if (comparator->Compare(prev.f->largest.user_key(),  in IsInputFilesNonOverlapping()
239                               curr.f->smallest.user_key()) >= 0) {  in IsInputFilesNonOverlapping()
243       assert(comparator->Compare(curr.f->largest.user_key(),  in IsInputFilesNonOverlapping()
244                                  prev.f->largest.user_key()) > 0);  in IsInputFilesNonOverlapping()
248     next.f = nullptr;  in IsInputFilesNonOverlapping()
252       next.f = c->input(curr.level, curr.index + 1);  in IsInputFilesNonOverlapping()
257     if (next.f) {  in IsInputFilesNonOverlapping()
331   for (FileMetaData* f : vstorage.LevelFiles(0)) {  in CalculateSortedRuns()
332     ret.emplace_back(0, f, f->fd.GetFileSize(), f->compensated_file_size,  in CalculateSortedRuns()
333                      f->being_compacted);  in CalculateSortedRuns()
340     for (FileMetaData* f : vstorage.LevelFiles(level)) {  in CalculateSortedRuns()
341       total_compensated_size += f->compensated_file_size;  in CalculateSortedRuns()
342       total_size += f->fd.GetFileSize();  in CalculateSortedRuns()
345         if (f->being_compacted) {  in CalculateSortedRuns()
346           being_compacted = f->being_compacted;  in CalculateSortedRuns()
355         assert(is_first || f->being_compacted == being_compacted);  in CalculateSortedRuns()
358         being_compacted = f->being_compacted;  in CalculateSortedRuns()
483     for (auto f : *c->inputs(0)) {  in PickCompaction()
484       assert(f->fd.smallest_seqno <= f->fd.largest_seqno);  in PickCompaction()
488       prev_smallest_seqno = f->fd.smallest_seqno;  in PickCompaction()
730       for (auto* f : vstorage_->LevelFiles(picking_sr.level)) {  in PickCompactionToReduceSortedRuns()  local
731         files.push_back(f);  in PickCompactionToReduceSortedRuns()
867     for (FileMetaData* f : vstorage_->LevelFiles(0)) {  in PickDeleteTriggeredCompaction()
868       if (f->marked_for_compaction) {  in PickDeleteTriggeredCompaction()
872         start_level_inputs.files.push_back(f);  in PickDeleteTriggeredCompaction()
949   for (FileMetaData* f : vstorage_->LevelFiles(output_level)) {  in PickDeleteTriggeredCompaction()
950     estimated_total_size += f->fd.GetFileSize();  in PickDeleteTriggeredCompaction()
988       FileMetaData* f = picking_sr.file;  in PickCompactionToOldest()  local
989       inputs[0].files.push_back(f);  in PickCompactionToOldest()
992       for (auto* f : vstorage_->LevelFiles(picking_sr.level)) {  in PickCompactionToOldest()  local
993         files.push_back(f);  in PickCompactionToOldest()