1 //===-ThinLTOCodeGenerator.cpp - LLVM Link Time Optimizer -----------------===// 2 // 3 // The LLVM Compiler Infrastructure 4 // 5 // This file is distributed under the University of Illinois Open Source 6 // License. See LICENSE.TXT for details. 7 // 8 //===----------------------------------------------------------------------===// 9 // 10 // This file implements the Thin Link Time Optimization library. This library is 11 // intended to be used by linker to optimize code at link time. 12 // 13 //===----------------------------------------------------------------------===// 14 15 #include "llvm/LTO/legacy/ThinLTOCodeGenerator.h" 16 17 #include "llvm/ADT/Statistic.h" 18 #include "llvm/ADT/StringExtras.h" 19 #include "llvm/Analysis/ModuleSummaryAnalysis.h" 20 #include "llvm/Analysis/ProfileSummaryInfo.h" 21 #include "llvm/Analysis/TargetLibraryInfo.h" 22 #include "llvm/Analysis/TargetTransformInfo.h" 23 #include "llvm/Bitcode/BitcodeReader.h" 24 #include "llvm/Bitcode/BitcodeWriter.h" 25 #include "llvm/Bitcode/BitcodeWriterPass.h" 26 #include "llvm/Config/llvm-config.h" 27 #include "llvm/IR/DebugInfo.h" 28 #include "llvm/IR/DiagnosticPrinter.h" 29 #include "llvm/IR/LLVMContext.h" 30 #include "llvm/IR/LegacyPassManager.h" 31 #include "llvm/IR/Mangler.h" 32 #include "llvm/IR/PassTimingInfo.h" 33 #include "llvm/IR/Verifier.h" 34 #include "llvm/IRReader/IRReader.h" 35 #include "llvm/LTO/LTO.h" 36 #include "llvm/MC/SubtargetFeature.h" 37 #include "llvm/Object/IRObjectFile.h" 38 #include "llvm/Support/CachePruning.h" 39 #include "llvm/Support/Debug.h" 40 #include "llvm/Support/Error.h" 41 #include "llvm/Support/Path.h" 42 #include "llvm/Support/SHA1.h" 43 #include "llvm/Support/SmallVectorMemoryBuffer.h" 44 #include "llvm/Support/TargetRegistry.h" 45 #include "llvm/Support/ThreadPool.h" 46 #include "llvm/Support/Threading.h" 47 #include "llvm/Support/ToolOutputFile.h" 48 #include "llvm/Support/VCSRevision.h" 49 #include "llvm/Target/TargetMachine.h" 50 #include "llvm/Transforms/IPO.h" 51 #include "llvm/Transforms/IPO/FunctionImport.h" 52 #include "llvm/Transforms/IPO/Internalize.h" 53 #include "llvm/Transforms/IPO/PassManagerBuilder.h" 54 #include "llvm/Transforms/ObjCARC.h" 55 #include "llvm/Transforms/Utils/FunctionImportUtils.h" 56 57 #include <numeric> 58 59 #if !defined(_MSC_VER) && !defined(__MINGW32__) 60 #include <unistd.h> 61 #else 62 #include <io.h> 63 #endif 64 65 using namespace llvm; 66 67 #define DEBUG_TYPE "thinlto" 68 69 namespace llvm { 70 // Flags -discard-value-names, defined in LTOCodeGenerator.cpp 71 extern cl::opt<bool> LTODiscardValueNames; 72 extern cl::opt<std::string> LTORemarksFilename; 73 extern cl::opt<bool> LTOPassRemarksWithHotness; 74 } 75 76 namespace { 77 78 static cl::opt<int> 79 ThreadCount("threads", cl::init(llvm::heavyweight_hardware_concurrency())); 80 81 // Simple helper to save temporary files for debug. 82 static void saveTempBitcode(const Module &TheModule, StringRef TempDir, 83 unsigned count, StringRef Suffix) { 84 if (TempDir.empty()) 85 return; 86 // User asked to save temps, let dump the bitcode file after import. 87 std::string SaveTempPath = (TempDir + llvm::Twine(count) + Suffix).str(); 88 std::error_code EC; 89 raw_fd_ostream OS(SaveTempPath, EC, sys::fs::F_None); 90 if (EC) 91 report_fatal_error(Twine("Failed to open ") + SaveTempPath + 92 " to save optimized bitcode\n"); 93 WriteBitcodeToFile(TheModule, OS, /* ShouldPreserveUseListOrder */ true); 94 } 95 96 static const GlobalValueSummary * 97 getFirstDefinitionForLinker(const GlobalValueSummaryList &GVSummaryList) { 98 // If there is any strong definition anywhere, get it. 99 auto StrongDefForLinker = llvm::find_if( 100 GVSummaryList, [](const std::unique_ptr<GlobalValueSummary> &Summary) { 101 auto Linkage = Summary->linkage(); 102 return !GlobalValue::isAvailableExternallyLinkage(Linkage) && 103 !GlobalValue::isWeakForLinker(Linkage); 104 }); 105 if (StrongDefForLinker != GVSummaryList.end()) 106 return StrongDefForLinker->get(); 107 // Get the first *linker visible* definition for this global in the summary 108 // list. 109 auto FirstDefForLinker = llvm::find_if( 110 GVSummaryList, [](const std::unique_ptr<GlobalValueSummary> &Summary) { 111 auto Linkage = Summary->linkage(); 112 return !GlobalValue::isAvailableExternallyLinkage(Linkage); 113 }); 114 // Extern templates can be emitted as available_externally. 115 if (FirstDefForLinker == GVSummaryList.end()) 116 return nullptr; 117 return FirstDefForLinker->get(); 118 } 119 120 // Populate map of GUID to the prevailing copy for any multiply defined 121 // symbols. Currently assume first copy is prevailing, or any strong 122 // definition. Can be refined with Linker information in the future. 123 static void computePrevailingCopies( 124 const ModuleSummaryIndex &Index, 125 DenseMap<GlobalValue::GUID, const GlobalValueSummary *> &PrevailingCopy) { 126 auto HasMultipleCopies = [&](const GlobalValueSummaryList &GVSummaryList) { 127 return GVSummaryList.size() > 1; 128 }; 129 130 for (auto &I : Index) { 131 if (HasMultipleCopies(I.second.SummaryList)) 132 PrevailingCopy[I.first] = 133 getFirstDefinitionForLinker(I.second.SummaryList); 134 } 135 } 136 137 static StringMap<MemoryBufferRef> 138 generateModuleMap(const std::vector<ThinLTOBuffer> &Modules) { 139 StringMap<MemoryBufferRef> ModuleMap; 140 for (auto &ModuleBuffer : Modules) { 141 assert(ModuleMap.find(ModuleBuffer.getBufferIdentifier()) == 142 ModuleMap.end() && 143 "Expect unique Buffer Identifier"); 144 ModuleMap[ModuleBuffer.getBufferIdentifier()] = ModuleBuffer.getMemBuffer(); 145 } 146 return ModuleMap; 147 } 148 149 static void promoteModule(Module &TheModule, const ModuleSummaryIndex &Index) { 150 if (renameModuleForThinLTO(TheModule, Index)) 151 report_fatal_error("renameModuleForThinLTO failed"); 152 } 153 154 namespace { 155 class ThinLTODiagnosticInfo : public DiagnosticInfo { 156 const Twine &Msg; 157 public: 158 ThinLTODiagnosticInfo(const Twine &DiagMsg, 159 DiagnosticSeverity Severity = DS_Error) 160 : DiagnosticInfo(DK_Linker, Severity), Msg(DiagMsg) {} 161 void print(DiagnosticPrinter &DP) const override { DP << Msg; } 162 }; 163 } 164 165 /// Verify the module and strip broken debug info. 166 static void verifyLoadedModule(Module &TheModule) { 167 bool BrokenDebugInfo = false; 168 if (verifyModule(TheModule, &dbgs(), &BrokenDebugInfo)) 169 report_fatal_error("Broken module found, compilation aborted!"); 170 if (BrokenDebugInfo) { 171 TheModule.getContext().diagnose(ThinLTODiagnosticInfo( 172 "Invalid debug info found, debug info will be stripped", DS_Warning)); 173 StripDebugInfo(TheModule); 174 } 175 } 176 177 static std::unique_ptr<Module> 178 loadModuleFromBuffer(const MemoryBufferRef &Buffer, LLVMContext &Context, 179 bool Lazy, bool IsImporting) { 180 SMDiagnostic Err; 181 Expected<std::unique_ptr<Module>> ModuleOrErr = 182 Lazy 183 ? getLazyBitcodeModule(Buffer, Context, 184 /* ShouldLazyLoadMetadata */ true, IsImporting) 185 : parseBitcodeFile(Buffer, Context); 186 if (!ModuleOrErr) { 187 handleAllErrors(ModuleOrErr.takeError(), [&](ErrorInfoBase &EIB) { 188 SMDiagnostic Err = SMDiagnostic(Buffer.getBufferIdentifier(), 189 SourceMgr::DK_Error, EIB.message()); 190 Err.print("ThinLTO", errs()); 191 }); 192 report_fatal_error("Can't load module, abort."); 193 } 194 if (!Lazy) 195 verifyLoadedModule(*ModuleOrErr.get()); 196 return std::move(ModuleOrErr.get()); 197 } 198 199 static void 200 crossImportIntoModule(Module &TheModule, const ModuleSummaryIndex &Index, 201 StringMap<MemoryBufferRef> &ModuleMap, 202 const FunctionImporter::ImportMapTy &ImportList) { 203 auto Loader = [&](StringRef Identifier) { 204 return loadModuleFromBuffer(ModuleMap[Identifier], TheModule.getContext(), 205 /*Lazy=*/true, /*IsImporting*/ true); 206 }; 207 208 FunctionImporter Importer(Index, Loader); 209 Expected<bool> Result = Importer.importFunctions(TheModule, ImportList); 210 if (!Result) { 211 handleAllErrors(Result.takeError(), [&](ErrorInfoBase &EIB) { 212 SMDiagnostic Err = SMDiagnostic(TheModule.getModuleIdentifier(), 213 SourceMgr::DK_Error, EIB.message()); 214 Err.print("ThinLTO", errs()); 215 }); 216 report_fatal_error("importFunctions failed"); 217 } 218 // Verify again after cross-importing. 219 verifyLoadedModule(TheModule); 220 } 221 222 static void optimizeModule(Module &TheModule, TargetMachine &TM, 223 unsigned OptLevel, bool Freestanding) { 224 // Populate the PassManager 225 PassManagerBuilder PMB; 226 PMB.LibraryInfo = new TargetLibraryInfoImpl(TM.getTargetTriple()); 227 if (Freestanding) 228 PMB.LibraryInfo->disableAllFunctions(); 229 PMB.Inliner = createFunctionInliningPass(); 230 // FIXME: should get it from the bitcode? 231 PMB.OptLevel = OptLevel; 232 PMB.LoopVectorize = true; 233 PMB.SLPVectorize = true; 234 // Already did this in verifyLoadedModule(). 235 PMB.VerifyInput = false; 236 PMB.VerifyOutput = false; 237 238 legacy::PassManager PM; 239 240 // Add the TTI (required to inform the vectorizer about register size for 241 // instance) 242 PM.add(createTargetTransformInfoWrapperPass(TM.getTargetIRAnalysis())); 243 244 // Add optimizations 245 PMB.populateThinLTOPassManager(PM); 246 247 PM.run(TheModule); 248 } 249 250 // Convert the PreservedSymbols map from "Name" based to "GUID" based. 251 static DenseSet<GlobalValue::GUID> 252 computeGUIDPreservedSymbols(const StringSet<> &PreservedSymbols, 253 const Triple &TheTriple) { 254 DenseSet<GlobalValue::GUID> GUIDPreservedSymbols(PreservedSymbols.size()); 255 for (auto &Entry : PreservedSymbols) { 256 StringRef Name = Entry.first(); 257 if (TheTriple.isOSBinFormatMachO() && Name.size() > 0 && Name[0] == '_') 258 Name = Name.drop_front(); 259 GUIDPreservedSymbols.insert(GlobalValue::getGUID(Name)); 260 } 261 return GUIDPreservedSymbols; 262 } 263 264 std::unique_ptr<MemoryBuffer> codegenModule(Module &TheModule, 265 TargetMachine &TM) { 266 SmallVector<char, 128> OutputBuffer; 267 268 // CodeGen 269 { 270 raw_svector_ostream OS(OutputBuffer); 271 legacy::PassManager PM; 272 273 // If the bitcode files contain ARC code and were compiled with optimization, 274 // the ObjCARCContractPass must be run, so do it unconditionally here. 275 PM.add(createObjCARCContractPass()); 276 277 // Setup the codegen now. 278 if (TM.addPassesToEmitFile(PM, OS, nullptr, TargetMachine::CGFT_ObjectFile, 279 /* DisableVerify */ true)) 280 report_fatal_error("Failed to setup codegen"); 281 282 // Run codegen now. resulting binary is in OutputBuffer. 283 PM.run(TheModule); 284 } 285 return make_unique<SmallVectorMemoryBuffer>(std::move(OutputBuffer)); 286 } 287 288 /// Manage caching for a single Module. 289 class ModuleCacheEntry { 290 SmallString<128> EntryPath; 291 292 public: 293 // Create a cache entry. This compute a unique hash for the Module considering 294 // the current list of export/import, and offer an interface to query to 295 // access the content in the cache. 296 ModuleCacheEntry( 297 StringRef CachePath, const ModuleSummaryIndex &Index, StringRef ModuleID, 298 const FunctionImporter::ImportMapTy &ImportList, 299 const FunctionImporter::ExportSetTy &ExportList, 300 const std::map<GlobalValue::GUID, GlobalValue::LinkageTypes> &ResolvedODR, 301 const GVSummaryMapTy &DefinedGVSummaries, unsigned OptLevel, 302 bool Freestanding, const TargetMachineBuilder &TMBuilder) { 303 if (CachePath.empty()) 304 return; 305 306 if (!Index.modulePaths().count(ModuleID)) 307 // The module does not have an entry, it can't have a hash at all 308 return; 309 310 if (all_of(Index.getModuleHash(ModuleID), 311 [](uint32_t V) { return V == 0; })) 312 // No hash entry, no caching! 313 return; 314 315 llvm::lto::Config Conf; 316 Conf.OptLevel = OptLevel; 317 Conf.Options = TMBuilder.Options; 318 Conf.CPU = TMBuilder.MCpu; 319 Conf.MAttrs.push_back(TMBuilder.MAttr); 320 Conf.RelocModel = TMBuilder.RelocModel; 321 Conf.CGOptLevel = TMBuilder.CGOptLevel; 322 Conf.Freestanding = Freestanding; 323 SmallString<40> Key; 324 computeLTOCacheKey(Key, Conf, Index, ModuleID, ImportList, ExportList, 325 ResolvedODR, DefinedGVSummaries); 326 327 // This choice of file name allows the cache to be pruned (see pruneCache() 328 // in include/llvm/Support/CachePruning.h). 329 sys::path::append(EntryPath, CachePath, "llvmcache-" + Key); 330 } 331 332 // Access the path to this entry in the cache. 333 StringRef getEntryPath() { return EntryPath; } 334 335 // Try loading the buffer for this cache entry. 336 ErrorOr<std::unique_ptr<MemoryBuffer>> tryLoadingBuffer() { 337 if (EntryPath.empty()) 338 return std::error_code(); 339 int FD; 340 SmallString<64> ResultPath; 341 std::error_code EC = sys::fs::openFileForRead( 342 Twine(EntryPath), FD, sys::fs::OF_UpdateAtime, &ResultPath); 343 if (EC) 344 return EC; 345 ErrorOr<std::unique_ptr<MemoryBuffer>> MBOrErr = 346 MemoryBuffer::getOpenFile(FD, EntryPath, 347 /*FileSize*/ -1, 348 /*RequiresNullTerminator*/ false); 349 close(FD); 350 return MBOrErr; 351 } 352 353 // Cache the Produced object file 354 void write(const MemoryBuffer &OutputBuffer) { 355 if (EntryPath.empty()) 356 return; 357 358 // Write to a temporary to avoid race condition 359 SmallString<128> TempFilename; 360 SmallString<128> CachePath(EntryPath); 361 int TempFD; 362 llvm::sys::path::remove_filename(CachePath); 363 sys::path::append(TempFilename, CachePath, "Thin-%%%%%%.tmp.o"); 364 std::error_code EC = 365 sys::fs::createUniqueFile(TempFilename, TempFD, TempFilename); 366 if (EC) { 367 errs() << "Error: " << EC.message() << "\n"; 368 report_fatal_error("ThinLTO: Can't get a temporary file"); 369 } 370 { 371 raw_fd_ostream OS(TempFD, /* ShouldClose */ true); 372 OS << OutputBuffer.getBuffer(); 373 } 374 // Rename temp file to final destination; rename is atomic 375 EC = sys::fs::rename(TempFilename, EntryPath); 376 if (EC) 377 sys::fs::remove(TempFilename); 378 } 379 }; 380 381 static std::unique_ptr<MemoryBuffer> 382 ProcessThinLTOModule(Module &TheModule, ModuleSummaryIndex &Index, 383 StringMap<MemoryBufferRef> &ModuleMap, TargetMachine &TM, 384 const FunctionImporter::ImportMapTy &ImportList, 385 const FunctionImporter::ExportSetTy &ExportList, 386 const DenseSet<GlobalValue::GUID> &GUIDPreservedSymbols, 387 const GVSummaryMapTy &DefinedGlobals, 388 const ThinLTOCodeGenerator::CachingOptions &CacheOptions, 389 bool DisableCodeGen, StringRef SaveTempsDir, 390 bool Freestanding, unsigned OptLevel, unsigned count) { 391 392 // "Benchmark"-like optimization: single-source case 393 bool SingleModule = (ModuleMap.size() == 1); 394 395 if (!SingleModule) { 396 promoteModule(TheModule, Index); 397 398 // Apply summary-based prevailing-symbol resolution decisions. 399 thinLTOResolvePrevailingInModule(TheModule, DefinedGlobals); 400 401 // Save temps: after promotion. 402 saveTempBitcode(TheModule, SaveTempsDir, count, ".1.promoted.bc"); 403 } 404 405 // Be friendly and don't nuke totally the module when the client didn't 406 // supply anything to preserve. 407 if (!ExportList.empty() || !GUIDPreservedSymbols.empty()) { 408 // Apply summary-based internalization decisions. 409 thinLTOInternalizeModule(TheModule, DefinedGlobals); 410 } 411 412 // Save internalized bitcode 413 saveTempBitcode(TheModule, SaveTempsDir, count, ".2.internalized.bc"); 414 415 if (!SingleModule) { 416 crossImportIntoModule(TheModule, Index, ModuleMap, ImportList); 417 418 // Save temps: after cross-module import. 419 saveTempBitcode(TheModule, SaveTempsDir, count, ".3.imported.bc"); 420 } 421 422 optimizeModule(TheModule, TM, OptLevel, Freestanding); 423 424 saveTempBitcode(TheModule, SaveTempsDir, count, ".4.opt.bc"); 425 426 if (DisableCodeGen) { 427 // Configured to stop before CodeGen, serialize the bitcode and return. 428 SmallVector<char, 128> OutputBuffer; 429 { 430 raw_svector_ostream OS(OutputBuffer); 431 ProfileSummaryInfo PSI(TheModule); 432 auto Index = buildModuleSummaryIndex(TheModule, nullptr, &PSI); 433 WriteBitcodeToFile(TheModule, OS, true, &Index); 434 } 435 return make_unique<SmallVectorMemoryBuffer>(std::move(OutputBuffer)); 436 } 437 438 return codegenModule(TheModule, TM); 439 } 440 441 /// Resolve prevailing symbols. Record resolutions in the \p ResolvedODR map 442 /// for caching, and in the \p Index for application during the ThinLTO 443 /// backends. This is needed for correctness for exported symbols (ensure 444 /// at least one copy kept) and a compile-time optimization (to drop duplicate 445 /// copies when possible). 446 static void resolvePrevailingInIndex( 447 ModuleSummaryIndex &Index, 448 StringMap<std::map<GlobalValue::GUID, GlobalValue::LinkageTypes>> 449 &ResolvedODR) { 450 451 DenseMap<GlobalValue::GUID, const GlobalValueSummary *> PrevailingCopy; 452 computePrevailingCopies(Index, PrevailingCopy); 453 454 auto isPrevailing = [&](GlobalValue::GUID GUID, const GlobalValueSummary *S) { 455 const auto &Prevailing = PrevailingCopy.find(GUID); 456 // Not in map means that there was only one copy, which must be prevailing. 457 if (Prevailing == PrevailingCopy.end()) 458 return true; 459 return Prevailing->second == S; 460 }; 461 462 auto recordNewLinkage = [&](StringRef ModuleIdentifier, 463 GlobalValue::GUID GUID, 464 GlobalValue::LinkageTypes NewLinkage) { 465 ResolvedODR[ModuleIdentifier][GUID] = NewLinkage; 466 }; 467 468 thinLTOResolvePrevailingInIndex(Index, isPrevailing, recordNewLinkage); 469 } 470 471 // Initialize the TargetMachine builder for a given Triple 472 static void initTMBuilder(TargetMachineBuilder &TMBuilder, 473 const Triple &TheTriple) { 474 // Set a default CPU for Darwin triples (copied from LTOCodeGenerator). 475 // FIXME this looks pretty terrible... 476 if (TMBuilder.MCpu.empty() && TheTriple.isOSDarwin()) { 477 if (TheTriple.getArch() == llvm::Triple::x86_64) 478 TMBuilder.MCpu = "core2"; 479 else if (TheTriple.getArch() == llvm::Triple::x86) 480 TMBuilder.MCpu = "yonah"; 481 else if (TheTriple.getArch() == llvm::Triple::aarch64) 482 TMBuilder.MCpu = "cyclone"; 483 } 484 TMBuilder.TheTriple = std::move(TheTriple); 485 } 486 487 } // end anonymous namespace 488 489 void ThinLTOCodeGenerator::addModule(StringRef Identifier, StringRef Data) { 490 ThinLTOBuffer Buffer(Data, Identifier); 491 LLVMContext Context; 492 StringRef TripleStr; 493 ErrorOr<std::string> TripleOrErr = expectedToErrorOrAndEmitErrors( 494 Context, getBitcodeTargetTriple(Buffer.getMemBuffer())); 495 496 if (TripleOrErr) 497 TripleStr = *TripleOrErr; 498 499 Triple TheTriple(TripleStr); 500 501 if (Modules.empty()) 502 initTMBuilder(TMBuilder, Triple(TheTriple)); 503 else if (TMBuilder.TheTriple != TheTriple) { 504 if (!TMBuilder.TheTriple.isCompatibleWith(TheTriple)) 505 report_fatal_error("ThinLTO modules with incompatible triples not " 506 "supported"); 507 initTMBuilder(TMBuilder, Triple(TMBuilder.TheTriple.merge(TheTriple))); 508 } 509 510 Modules.push_back(Buffer); 511 } 512 513 void ThinLTOCodeGenerator::preserveSymbol(StringRef Name) { 514 PreservedSymbols.insert(Name); 515 } 516 517 void ThinLTOCodeGenerator::crossReferenceSymbol(StringRef Name) { 518 // FIXME: At the moment, we don't take advantage of this extra information, 519 // we're conservatively considering cross-references as preserved. 520 // CrossReferencedSymbols.insert(Name); 521 PreservedSymbols.insert(Name); 522 } 523 524 // TargetMachine factory 525 std::unique_ptr<TargetMachine> TargetMachineBuilder::create() const { 526 std::string ErrMsg; 527 const Target *TheTarget = 528 TargetRegistry::lookupTarget(TheTriple.str(), ErrMsg); 529 if (!TheTarget) { 530 report_fatal_error("Can't load target for this Triple: " + ErrMsg); 531 } 532 533 // Use MAttr as the default set of features. 534 SubtargetFeatures Features(MAttr); 535 Features.getDefaultSubtargetFeatures(TheTriple); 536 std::string FeatureStr = Features.getString(); 537 538 return std::unique_ptr<TargetMachine>( 539 TheTarget->createTargetMachine(TheTriple.str(), MCpu, FeatureStr, Options, 540 RelocModel, None, CGOptLevel)); 541 } 542 543 /** 544 * Produce the combined summary index from all the bitcode files: 545 * "thin-link". 546 */ 547 std::unique_ptr<ModuleSummaryIndex> ThinLTOCodeGenerator::linkCombinedIndex() { 548 std::unique_ptr<ModuleSummaryIndex> CombinedIndex = 549 llvm::make_unique<ModuleSummaryIndex>(/*HaveGVs=*/false); 550 uint64_t NextModuleId = 0; 551 for (auto &ModuleBuffer : Modules) { 552 if (Error Err = readModuleSummaryIndex(ModuleBuffer.getMemBuffer(), 553 *CombinedIndex, NextModuleId++)) { 554 // FIXME diagnose 555 logAllUnhandledErrors( 556 std::move(Err), errs(), 557 "error: can't create module summary index for buffer: "); 558 return nullptr; 559 } 560 } 561 return CombinedIndex; 562 } 563 564 static void internalizeAndPromoteInIndex( 565 const StringMap<FunctionImporter::ExportSetTy> &ExportLists, 566 const DenseSet<GlobalValue::GUID> &GUIDPreservedSymbols, 567 ModuleSummaryIndex &Index) { 568 auto isExported = [&](StringRef ModuleIdentifier, GlobalValue::GUID GUID) { 569 const auto &ExportList = ExportLists.find(ModuleIdentifier); 570 return (ExportList != ExportLists.end() && 571 ExportList->second.count(GUID)) || 572 GUIDPreservedSymbols.count(GUID); 573 }; 574 575 thinLTOInternalizeAndPromoteInIndex(Index, isExported); 576 } 577 578 static void computeDeadSymbolsInIndex( 579 ModuleSummaryIndex &Index, 580 const DenseSet<GlobalValue::GUID> &GUIDPreservedSymbols) { 581 // We have no symbols resolution available. And can't do any better now in the 582 // case where the prevailing symbol is in a native object. It can be refined 583 // with linker information in the future. 584 auto isPrevailing = [&](GlobalValue::GUID G) { 585 return PrevailingType::Unknown; 586 }; 587 computeDeadSymbolsWithConstProp(Index, GUIDPreservedSymbols, isPrevailing, 588 /* ImportEnabled = */ true); 589 } 590 591 /** 592 * Perform promotion and renaming of exported internal functions. 593 * Index is updated to reflect linkage changes from weak resolution. 594 */ 595 void ThinLTOCodeGenerator::promote(Module &TheModule, 596 ModuleSummaryIndex &Index) { 597 auto ModuleCount = Index.modulePaths().size(); 598 auto ModuleIdentifier = TheModule.getModuleIdentifier(); 599 600 // Collect for each module the list of function it defines (GUID -> Summary). 601 StringMap<GVSummaryMapTy> ModuleToDefinedGVSummaries; 602 Index.collectDefinedGVSummariesPerModule(ModuleToDefinedGVSummaries); 603 604 // Convert the preserved symbols set from string to GUID 605 auto GUIDPreservedSymbols = computeGUIDPreservedSymbols( 606 PreservedSymbols, Triple(TheModule.getTargetTriple())); 607 608 // Compute "dead" symbols, we don't want to import/export these! 609 computeDeadSymbolsInIndex(Index, GUIDPreservedSymbols); 610 611 // Generate import/export list 612 StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount); 613 StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount); 614 ComputeCrossModuleImport(Index, ModuleToDefinedGVSummaries, ImportLists, 615 ExportLists); 616 617 // Resolve prevailing symbols 618 StringMap<std::map<GlobalValue::GUID, GlobalValue::LinkageTypes>> ResolvedODR; 619 resolvePrevailingInIndex(Index, ResolvedODR); 620 621 thinLTOResolvePrevailingInModule( 622 TheModule, ModuleToDefinedGVSummaries[ModuleIdentifier]); 623 624 // Promote the exported values in the index, so that they are promoted 625 // in the module. 626 internalizeAndPromoteInIndex(ExportLists, GUIDPreservedSymbols, Index); 627 628 promoteModule(TheModule, Index); 629 } 630 631 /** 632 * Perform cross-module importing for the module identified by ModuleIdentifier. 633 */ 634 void ThinLTOCodeGenerator::crossModuleImport(Module &TheModule, 635 ModuleSummaryIndex &Index) { 636 auto ModuleMap = generateModuleMap(Modules); 637 auto ModuleCount = Index.modulePaths().size(); 638 639 // Collect for each module the list of function it defines (GUID -> Summary). 640 StringMap<GVSummaryMapTy> ModuleToDefinedGVSummaries(ModuleCount); 641 Index.collectDefinedGVSummariesPerModule(ModuleToDefinedGVSummaries); 642 643 // Convert the preserved symbols set from string to GUID 644 auto GUIDPreservedSymbols = computeGUIDPreservedSymbols( 645 PreservedSymbols, Triple(TheModule.getTargetTriple())); 646 647 // Compute "dead" symbols, we don't want to import/export these! 648 computeDeadSymbolsInIndex(Index, GUIDPreservedSymbols); 649 650 // Generate import/export list 651 StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount); 652 StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount); 653 ComputeCrossModuleImport(Index, ModuleToDefinedGVSummaries, ImportLists, 654 ExportLists); 655 auto &ImportList = ImportLists[TheModule.getModuleIdentifier()]; 656 657 crossImportIntoModule(TheModule, Index, ModuleMap, ImportList); 658 } 659 660 /** 661 * Compute the list of summaries needed for importing into module. 662 */ 663 void ThinLTOCodeGenerator::gatherImportedSummariesForModule( 664 StringRef ModulePath, ModuleSummaryIndex &Index, 665 std::map<std::string, GVSummaryMapTy> &ModuleToSummariesForIndex) { 666 auto ModuleCount = Index.modulePaths().size(); 667 668 // Collect for each module the list of function it defines (GUID -> Summary). 669 StringMap<GVSummaryMapTy> ModuleToDefinedGVSummaries(ModuleCount); 670 Index.collectDefinedGVSummariesPerModule(ModuleToDefinedGVSummaries); 671 672 // Generate import/export list 673 StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount); 674 StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount); 675 ComputeCrossModuleImport(Index, ModuleToDefinedGVSummaries, ImportLists, 676 ExportLists); 677 678 llvm::gatherImportedSummariesForModule(ModulePath, ModuleToDefinedGVSummaries, 679 ImportLists[ModulePath], 680 ModuleToSummariesForIndex); 681 } 682 683 /** 684 * Emit the list of files needed for importing into module. 685 */ 686 void ThinLTOCodeGenerator::emitImports(StringRef ModulePath, 687 StringRef OutputName, 688 ModuleSummaryIndex &Index) { 689 auto ModuleCount = Index.modulePaths().size(); 690 691 // Collect for each module the list of function it defines (GUID -> Summary). 692 StringMap<GVSummaryMapTy> ModuleToDefinedGVSummaries(ModuleCount); 693 Index.collectDefinedGVSummariesPerModule(ModuleToDefinedGVSummaries); 694 695 // Generate import/export list 696 StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount); 697 StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount); 698 ComputeCrossModuleImport(Index, ModuleToDefinedGVSummaries, ImportLists, 699 ExportLists); 700 701 std::map<std::string, GVSummaryMapTy> ModuleToSummariesForIndex; 702 llvm::gatherImportedSummariesForModule(ModulePath, ModuleToDefinedGVSummaries, 703 ImportLists[ModulePath], 704 ModuleToSummariesForIndex); 705 706 std::error_code EC; 707 if ((EC = 708 EmitImportsFiles(ModulePath, OutputName, ModuleToSummariesForIndex))) 709 report_fatal_error(Twine("Failed to open ") + OutputName + 710 " to save imports lists\n"); 711 } 712 713 /** 714 * Perform internalization. Index is updated to reflect linkage changes. 715 */ 716 void ThinLTOCodeGenerator::internalize(Module &TheModule, 717 ModuleSummaryIndex &Index) { 718 initTMBuilder(TMBuilder, Triple(TheModule.getTargetTriple())); 719 auto ModuleCount = Index.modulePaths().size(); 720 auto ModuleIdentifier = TheModule.getModuleIdentifier(); 721 722 // Convert the preserved symbols set from string to GUID 723 auto GUIDPreservedSymbols = 724 computeGUIDPreservedSymbols(PreservedSymbols, TMBuilder.TheTriple); 725 726 // Collect for each module the list of function it defines (GUID -> Summary). 727 StringMap<GVSummaryMapTy> ModuleToDefinedGVSummaries(ModuleCount); 728 Index.collectDefinedGVSummariesPerModule(ModuleToDefinedGVSummaries); 729 730 // Compute "dead" symbols, we don't want to import/export these! 731 computeDeadSymbolsInIndex(Index, GUIDPreservedSymbols); 732 733 // Generate import/export list 734 StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount); 735 StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount); 736 ComputeCrossModuleImport(Index, ModuleToDefinedGVSummaries, ImportLists, 737 ExportLists); 738 auto &ExportList = ExportLists[ModuleIdentifier]; 739 740 // Be friendly and don't nuke totally the module when the client didn't 741 // supply anything to preserve. 742 if (ExportList.empty() && GUIDPreservedSymbols.empty()) 743 return; 744 745 // Internalization 746 internalizeAndPromoteInIndex(ExportLists, GUIDPreservedSymbols, Index); 747 thinLTOInternalizeModule(TheModule, 748 ModuleToDefinedGVSummaries[ModuleIdentifier]); 749 } 750 751 /** 752 * Perform post-importing ThinLTO optimizations. 753 */ 754 void ThinLTOCodeGenerator::optimize(Module &TheModule) { 755 initTMBuilder(TMBuilder, Triple(TheModule.getTargetTriple())); 756 757 // Optimize now 758 optimizeModule(TheModule, *TMBuilder.create(), OptLevel, Freestanding); 759 } 760 761 /// Write out the generated object file, either from CacheEntryPath or from 762 /// OutputBuffer, preferring hard-link when possible. 763 /// Returns the path to the generated file in SavedObjectsDirectoryPath. 764 static std::string writeGeneratedObject(int count, StringRef CacheEntryPath, 765 StringRef SavedObjectsDirectoryPath, 766 const MemoryBuffer &OutputBuffer) { 767 SmallString<128> OutputPath(SavedObjectsDirectoryPath); 768 llvm::sys::path::append(OutputPath, Twine(count) + ".thinlto.o"); 769 OutputPath.c_str(); // Ensure the string is null terminated. 770 if (sys::fs::exists(OutputPath)) 771 sys::fs::remove(OutputPath); 772 773 // We don't return a memory buffer to the linker, just a list of files. 774 if (!CacheEntryPath.empty()) { 775 // Cache is enabled, hard-link the entry (or copy if hard-link fails). 776 auto Err = sys::fs::create_hard_link(CacheEntryPath, OutputPath); 777 if (!Err) 778 return OutputPath.str(); 779 // Hard linking failed, try to copy. 780 Err = sys::fs::copy_file(CacheEntryPath, OutputPath); 781 if (!Err) 782 return OutputPath.str(); 783 // Copy failed (could be because the CacheEntry was removed from the cache 784 // in the meantime by another process), fall back and try to write down the 785 // buffer to the output. 786 errs() << "error: can't link or copy from cached entry '" << CacheEntryPath 787 << "' to '" << OutputPath << "'\n"; 788 } 789 // No cache entry, just write out the buffer. 790 std::error_code Err; 791 raw_fd_ostream OS(OutputPath, Err, sys::fs::F_None); 792 if (Err) 793 report_fatal_error("Can't open output '" + OutputPath + "'\n"); 794 OS << OutputBuffer.getBuffer(); 795 return OutputPath.str(); 796 } 797 798 // Main entry point for the ThinLTO processing 799 void ThinLTOCodeGenerator::run() { 800 // Prepare the resulting object vector 801 assert(ProducedBinaries.empty() && "The generator should not be reused"); 802 if (SavedObjectsDirectoryPath.empty()) 803 ProducedBinaries.resize(Modules.size()); 804 else { 805 sys::fs::create_directories(SavedObjectsDirectoryPath); 806 bool IsDir; 807 sys::fs::is_directory(SavedObjectsDirectoryPath, IsDir); 808 if (!IsDir) 809 report_fatal_error("Unexistent dir: '" + SavedObjectsDirectoryPath + "'"); 810 ProducedBinaryFiles.resize(Modules.size()); 811 } 812 813 if (CodeGenOnly) { 814 // Perform only parallel codegen and return. 815 ThreadPool Pool; 816 int count = 0; 817 for (auto &ModuleBuffer : Modules) { 818 Pool.async([&](int count) { 819 LLVMContext Context; 820 Context.setDiscardValueNames(LTODiscardValueNames); 821 822 // Parse module now 823 auto TheModule = 824 loadModuleFromBuffer(ModuleBuffer.getMemBuffer(), Context, false, 825 /*IsImporting*/ false); 826 827 // CodeGen 828 auto OutputBuffer = codegenModule(*TheModule, *TMBuilder.create()); 829 if (SavedObjectsDirectoryPath.empty()) 830 ProducedBinaries[count] = std::move(OutputBuffer); 831 else 832 ProducedBinaryFiles[count] = writeGeneratedObject( 833 count, "", SavedObjectsDirectoryPath, *OutputBuffer); 834 }, count++); 835 } 836 837 return; 838 } 839 840 // Sequential linking phase 841 auto Index = linkCombinedIndex(); 842 843 // Save temps: index. 844 if (!SaveTempsDir.empty()) { 845 auto SaveTempPath = SaveTempsDir + "index.bc"; 846 std::error_code EC; 847 raw_fd_ostream OS(SaveTempPath, EC, sys::fs::F_None); 848 if (EC) 849 report_fatal_error(Twine("Failed to open ") + SaveTempPath + 850 " to save optimized bitcode\n"); 851 WriteIndexToFile(*Index, OS); 852 } 853 854 855 // Prepare the module map. 856 auto ModuleMap = generateModuleMap(Modules); 857 auto ModuleCount = Modules.size(); 858 859 // Collect for each module the list of function it defines (GUID -> Summary). 860 StringMap<GVSummaryMapTy> ModuleToDefinedGVSummaries(ModuleCount); 861 Index->collectDefinedGVSummariesPerModule(ModuleToDefinedGVSummaries); 862 863 // Convert the preserved symbols set from string to GUID, this is needed for 864 // computing the caching hash and the internalization. 865 auto GUIDPreservedSymbols = 866 computeGUIDPreservedSymbols(PreservedSymbols, TMBuilder.TheTriple); 867 868 // Compute "dead" symbols, we don't want to import/export these! 869 computeDeadSymbolsInIndex(*Index, GUIDPreservedSymbols); 870 871 // Collect the import/export lists for all modules from the call-graph in the 872 // combined index. 873 StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount); 874 StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount); 875 ComputeCrossModuleImport(*Index, ModuleToDefinedGVSummaries, ImportLists, 876 ExportLists); 877 878 // We use a std::map here to be able to have a defined ordering when 879 // producing a hash for the cache entry. 880 // FIXME: we should be able to compute the caching hash for the entry based 881 // on the index, and nuke this map. 882 StringMap<std::map<GlobalValue::GUID, GlobalValue::LinkageTypes>> ResolvedODR; 883 884 // Resolve prevailing symbols, this has to be computed early because it 885 // impacts the caching. 886 resolvePrevailingInIndex(*Index, ResolvedODR); 887 888 // Use global summary-based analysis to identify symbols that can be 889 // internalized (because they aren't exported or preserved as per callback). 890 // Changes are made in the index, consumed in the ThinLTO backends. 891 internalizeAndPromoteInIndex(ExportLists, GUIDPreservedSymbols, *Index); 892 893 // Make sure that every module has an entry in the ExportLists, ImportList, 894 // GVSummary and ResolvedODR maps to enable threaded access to these maps 895 // below. 896 for (auto &Module : Modules) { 897 auto ModuleIdentifier = Module.getBufferIdentifier(); 898 ExportLists[ModuleIdentifier]; 899 ImportLists[ModuleIdentifier]; 900 ResolvedODR[ModuleIdentifier]; 901 ModuleToDefinedGVSummaries[ModuleIdentifier]; 902 } 903 904 // Compute the ordering we will process the inputs: the rough heuristic here 905 // is to sort them per size so that the largest module get schedule as soon as 906 // possible. This is purely a compile-time optimization. 907 std::vector<int> ModulesOrdering; 908 ModulesOrdering.resize(Modules.size()); 909 std::iota(ModulesOrdering.begin(), ModulesOrdering.end(), 0); 910 llvm::sort(ModulesOrdering, [&](int LeftIndex, int RightIndex) { 911 auto LSize = Modules[LeftIndex].getBuffer().size(); 912 auto RSize = Modules[RightIndex].getBuffer().size(); 913 return LSize > RSize; 914 }); 915 916 // Parallel optimizer + codegen 917 { 918 ThreadPool Pool(ThreadCount); 919 for (auto IndexCount : ModulesOrdering) { 920 auto &ModuleBuffer = Modules[IndexCount]; 921 Pool.async([&](int count) { 922 auto ModuleIdentifier = ModuleBuffer.getBufferIdentifier(); 923 auto &ExportList = ExportLists[ModuleIdentifier]; 924 925 auto &DefinedGVSummaries = ModuleToDefinedGVSummaries[ModuleIdentifier]; 926 927 // The module may be cached, this helps handling it. 928 ModuleCacheEntry CacheEntry(CacheOptions.Path, *Index, ModuleIdentifier, 929 ImportLists[ModuleIdentifier], ExportList, 930 ResolvedODR[ModuleIdentifier], 931 DefinedGVSummaries, OptLevel, Freestanding, 932 TMBuilder); 933 auto CacheEntryPath = CacheEntry.getEntryPath(); 934 935 { 936 auto ErrOrBuffer = CacheEntry.tryLoadingBuffer(); 937 LLVM_DEBUG(dbgs() << "Cache " << (ErrOrBuffer ? "hit" : "miss") 938 << " '" << CacheEntryPath << "' for buffer " 939 << count << " " << ModuleIdentifier << "\n"); 940 941 if (ErrOrBuffer) { 942 // Cache Hit! 943 if (SavedObjectsDirectoryPath.empty()) 944 ProducedBinaries[count] = std::move(ErrOrBuffer.get()); 945 else 946 ProducedBinaryFiles[count] = writeGeneratedObject( 947 count, CacheEntryPath, SavedObjectsDirectoryPath, 948 *ErrOrBuffer.get()); 949 return; 950 } 951 } 952 953 LLVMContext Context; 954 Context.setDiscardValueNames(LTODiscardValueNames); 955 Context.enableDebugTypeODRUniquing(); 956 auto DiagFileOrErr = lto::setupOptimizationRemarks( 957 Context, LTORemarksFilename, LTOPassRemarksWithHotness, count); 958 if (!DiagFileOrErr) { 959 errs() << "Error: " << toString(DiagFileOrErr.takeError()) << "\n"; 960 report_fatal_error("ThinLTO: Can't get an output file for the " 961 "remarks"); 962 } 963 964 // Parse module now 965 auto TheModule = 966 loadModuleFromBuffer(ModuleBuffer.getMemBuffer(), Context, false, 967 /*IsImporting*/ false); 968 969 // Save temps: original file. 970 saveTempBitcode(*TheModule, SaveTempsDir, count, ".0.original.bc"); 971 972 auto &ImportList = ImportLists[ModuleIdentifier]; 973 // Run the main process now, and generates a binary 974 auto OutputBuffer = ProcessThinLTOModule( 975 *TheModule, *Index, ModuleMap, *TMBuilder.create(), ImportList, 976 ExportList, GUIDPreservedSymbols, 977 ModuleToDefinedGVSummaries[ModuleIdentifier], CacheOptions, 978 DisableCodeGen, SaveTempsDir, Freestanding, OptLevel, count); 979 980 // Commit to the cache (if enabled) 981 CacheEntry.write(*OutputBuffer); 982 983 if (SavedObjectsDirectoryPath.empty()) { 984 // We need to generated a memory buffer for the linker. 985 if (!CacheEntryPath.empty()) { 986 // When cache is enabled, reload from the cache if possible. 987 // Releasing the buffer from the heap and reloading it from the 988 // cache file with mmap helps us to lower memory pressure. 989 // The freed memory can be used for the next input file. 990 // The final binary link will read from the VFS cache (hopefully!) 991 // or from disk (if the memory pressure was too high). 992 auto ReloadedBufferOrErr = CacheEntry.tryLoadingBuffer(); 993 if (auto EC = ReloadedBufferOrErr.getError()) { 994 // On error, keep the preexisting buffer and print a diagnostic. 995 errs() << "error: can't reload cached file '" << CacheEntryPath 996 << "': " << EC.message() << "\n"; 997 } else { 998 OutputBuffer = std::move(*ReloadedBufferOrErr); 999 } 1000 } 1001 ProducedBinaries[count] = std::move(OutputBuffer); 1002 return; 1003 } 1004 ProducedBinaryFiles[count] = writeGeneratedObject( 1005 count, CacheEntryPath, SavedObjectsDirectoryPath, *OutputBuffer); 1006 }, IndexCount); 1007 } 1008 } 1009 1010 pruneCache(CacheOptions.Path, CacheOptions.Policy); 1011 1012 // If statistics were requested, print them out now. 1013 if (llvm::AreStatisticsEnabled()) 1014 llvm::PrintStatistics(); 1015 reportAndResetTimings(); 1016 } 1017