70     return icmp.InternalKeyComparator::Compare(f.largest_key, k) < 0;  in FindFileInRange()
184                 user_key_, ExtractUserKey(f->largest_key));  in GetNextFile()
212                 prev_file_->largest_key, f->smallest_key);  in GetNextFile()
460               user_key, ExtractUserKey(f->largest_key));  in GetNextFileInLevelWithKeys()
781     Slice largest_key = files[i]->largest.Encode();  in DoGenerateLevelFilesBrief()  local
785     size_t largest_size = largest_key.size();  in DoGenerateLevelFilesBrief()
788     memcpy(mem + smallest_size, largest_key.data(), largest_size);  in DoGenerateLevelFilesBrief()
794     f.largest_key = Slice(mem + smallest_size, largest_size);  in DoGenerateLevelFilesBrief()
803                                         ExtractUserKey(f->largest_key)) > 0);  in AfterFile()
1033             target, cur_file.largest_key) <= 0 &&  in Seek()
2796     if (internal_comparator_->Compare(prev.largest_key, f.smallest_key) >= 0) {  in GenerateLevel0NonOverlapping()
2817       Slice largest_user_key = ExtractUserKey(f.largest_key);  in GenerateBottommostFiles()
2933       const Slice file_limit = ExtractUserKey(f->largest_key);  in GetOverlappingInputs()
5346     if (icmp.Compare(files_brief.files[idx_end].largest_key, end) < 0) {  in ApproximateSize()
5418   if (icmp.Compare(f.largest_key, key) <= 0) {  in ApproximateOffsetOf()
5445   if (icmp.Compare(f.largest_key, start) <= 0 ||  in ApproximateSize()
5456   if (icmp.Compare(f.largest_key, end) < 0) {  in ApproximateSize()