76     VersionStorageInfo* vstorage,  in GetBoundaryKeys()  argument
80   const Comparator* ucmp = vstorage->InternalComparator()->user_comparator();  in GetBoundaryKeys()
117     VersionStorageInfo* vstorage, std::vector<CompactionInputFiles> inputs) {  in PopulateWithAtomicBoundaries()  argument
118   const Comparator* ucmp = vstorage->InternalComparator()->user_comparator();  in PopulateWithAtomicBoundaries()
162     int output_level, VersionStorageInfo* vstorage,  in IsBottommostLevel()  argument
167     for (const auto* file : vstorage->LevelFiles(0)) {  in IsBottommostLevel()
173     assert(static_cast<size_t>(output_l0_idx) < vstorage->LevelFiles(0).size());  in IsBottommostLevel()
178   GetBoundaryKeys(vstorage, inputs, &smallest_key, &largest_key);  in IsBottommostLevel()
179   return !vstorage->RangeMightExistAfterSortedRun(smallest_key, largest_key,  in IsBottommostLevel()
186     int output_level, VersionStorageInfo* vstorage,  in TEST_IsBottommostLevel()  argument
188   return IsBottommostLevel(output_level, vstorage, inputs);  in TEST_IsBottommostLevel()
192     VersionStorageInfo* vstorage,  in IsFullCompaction()  argument
196   for (int l = 0; l < vstorage->num_levels(); l++) {  in IsFullCompaction()
197     total_num_files += vstorage->NumLevelFiles(l);  in IsFullCompaction()
205 Compaction::Compaction(VersionStorageInfo* vstorage,  in Compaction()  argument
218     : input_vstorage_(vstorage),  in Compaction()
227       number_levels_(vstorage->num_levels()),  in Compaction()
233       inputs_(PopulateWithAtomicBoundaries(vstorage, std::move(_inputs))),  in Compaction()
236       bottommost_level_(IsBottommostLevel(output_level_, vstorage, inputs_)),  in Compaction()
237       is_full_compaction_(IsFullCompaction(vstorage, inputs_)),  in Compaction()
270   GetBoundaryKeys(vstorage, inputs_, &smallest_user_key_, &largest_user_key_);  in Compaction()