87       for (const auto* f : inputs[i].files) {  in GetBoundaryKeys()  local
88         const Slice& start_user_key = f->smallest.user_key();  in GetBoundaryKeys()
93         const Slice& end_user_key = f->largest.user_key();  in GetBoundaryKeys()
134       const auto* f = inputs[i].files[j];  in PopulateWithAtomicBoundaries()  local
137         cur_boundary.smallest = &f->smallest;  in PopulateWithAtomicBoundaries()
138         cur_boundary.largest = &f->largest;  in PopulateWithAtomicBoundaries()
139       } else if (sstableKeyCompare(ucmp, *cur_boundary.largest, f->smallest) ==  in PopulateWithAtomicBoundaries()
144         cur_boundary.largest = &f->largest;  in PopulateWithAtomicBoundaries()
148         cur_boundary.smallest = &f->smallest;  in PopulateWithAtomicBoundaries()
149         cur_boundary.largest = &f->largest;  in PopulateWithAtomicBoundaries()
371         auto* f = files[level_ptrs->at(lvl)];  in KeyNotExistsBeyondOutputLevel()  local
372         if (user_cmp->Compare(user_key, f->largest.user_key()) <= 0) {  in KeyNotExistsBeyondOutputLevel()
374           if (user_cmp->Compare(user_key, f->smallest.user_key()) >= 0) {  in KeyNotExistsBeyondOutputLevel()
431     for (auto f : input_level.files) {  in CalculateTotalInputSize()  local
432       size += f->fd.GetFileSize();  in CalculateTotalInputSize()