2016-03-09 09:37:22 +08:00
|
|
|
//===-ThinLTOCodeGenerator.cpp - LLVM Link Time Optimizer -----------------===//
|
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
|
|
|
// This file implements the Thin Link Time Optimization library. This library is
|
|
|
|
// intended to be used by linker to optimize code at link time.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
#include "llvm/LTO/ThinLTOCodeGenerator.h"
|
|
|
|
|
2016-03-15 05:18:10 +08:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2016-03-15 08:04:37 +08:00
|
|
|
#include "llvm/ADT/StringExtras.h"
|
2016-03-09 09:37:22 +08:00
|
|
|
#include "llvm/Analysis/TargetLibraryInfo.h"
|
|
|
|
#include "llvm/Analysis/TargetTransformInfo.h"
|
2016-03-15 05:18:10 +08:00
|
|
|
#include "llvm/Bitcode/BitcodeWriterPass.h"
|
2016-03-15 08:04:37 +08:00
|
|
|
#include "llvm/Bitcode/ReaderWriter.h"
|
2016-03-09 09:37:22 +08:00
|
|
|
#include "llvm/ExecutionEngine/ObjectMemoryBuffer.h"
|
2016-03-15 05:18:10 +08:00
|
|
|
#include "llvm/IR/DiagnosticPrinter.h"
|
2016-03-15 08:04:37 +08:00
|
|
|
#include "llvm/IR/LLVMContext.h"
|
2016-03-09 09:37:22 +08:00
|
|
|
#include "llvm/IR/LegacyPassManager.h"
|
|
|
|
#include "llvm/IR/Mangler.h"
|
|
|
|
#include "llvm/IRReader/IRReader.h"
|
|
|
|
#include "llvm/Linker/Linker.h"
|
|
|
|
#include "llvm/MC/SubtargetFeature.h"
|
2016-03-15 08:04:37 +08:00
|
|
|
#include "llvm/Object/ModuleSummaryIndexObjectFile.h"
|
2016-03-09 09:37:22 +08:00
|
|
|
#include "llvm/Support/SourceMgr.h"
|
|
|
|
#include "llvm/Support/TargetRegistry.h"
|
|
|
|
#include "llvm/Support/ThreadPool.h"
|
|
|
|
#include "llvm/Target/TargetMachine.h"
|
|
|
|
#include "llvm/Transforms/IPO.h"
|
|
|
|
#include "llvm/Transforms/IPO/FunctionImport.h"
|
|
|
|
#include "llvm/Transforms/IPO/PassManagerBuilder.h"
|
|
|
|
#include "llvm/Transforms/ObjCARC.h"
|
|
|
|
#include "llvm/Transforms/Utils/FunctionImportUtils.h"
|
|
|
|
|
|
|
|
using namespace llvm;
|
|
|
|
|
Add a flag to the LLVMContext to disable name for Value other than GlobalValue
Summary:
This is intended to be a performance flag, on the same level as clang
cc1 option "--disable-free". LLVM will never initialize it by default,
it will be up to the client creating the LLVMContext to request this
behavior. Clang will do it by default in Release build (just like
--disable-free).
"opt" and "llc" can opt-in using -disable-named-value command line
option.
When performing LTO on llvm-tblgen, the initial merging of IR peaks
at 92MB without this patch, and 86MB after this patch,setNameImpl()
drops from 6.5MB to 0.5MB.
The total link time goes from ~29.5s to ~27.8s.
Compared to a compile-time flag (like the IRBuilder one), it performs
very close. I profiled on SROA and obtain these results:
420ms with IRBuilder that preserve name
372ms with IRBuilder that strip name
375ms with IRBuilder that preserve name, and a runtime flag to strip
Reviewers: chandlerc, dexonsmith, bogner
Subscribers: joker.eph, llvm-commits
Differential Revision: http://reviews.llvm.org/D17946
From: Mehdi Amini <mehdi.amini@apple.com>
llvm-svn: 263086
2016-03-10 09:28:54 +08:00
|
|
|
namespace llvm {
|
|
|
|
// Flags -discard-value-names, defined in LTOCodeGenerator.cpp
|
|
|
|
extern cl::opt<bool> LTODiscardValueNames;
|
|
|
|
}
|
|
|
|
|
2016-03-09 09:37:22 +08:00
|
|
|
namespace {
|
|
|
|
|
|
|
|
static cl::opt<int> ThreadCount("threads",
|
|
|
|
cl::init(std::thread::hardware_concurrency()));
|
|
|
|
|
|
|
|
static void diagnosticHandler(const DiagnosticInfo &DI) {
|
|
|
|
DiagnosticPrinterRawOStream DP(errs());
|
|
|
|
DI.print(DP);
|
|
|
|
errs() << '\n';
|
|
|
|
}
|
|
|
|
|
|
|
|
// Simple helper to load a module from bitcode
|
|
|
|
static std::unique_ptr<Module>
|
|
|
|
loadModuleFromBuffer(const MemoryBufferRef &Buffer, LLVMContext &Context,
|
|
|
|
bool Lazy) {
|
|
|
|
SMDiagnostic Err;
|
|
|
|
ErrorOr<std::unique_ptr<Module>> ModuleOrErr(nullptr);
|
|
|
|
if (Lazy) {
|
|
|
|
ModuleOrErr =
|
|
|
|
getLazyBitcodeModule(MemoryBuffer::getMemBuffer(Buffer, false), Context,
|
|
|
|
/* ShouldLazyLoadMetadata */ Lazy);
|
|
|
|
} else {
|
|
|
|
ModuleOrErr = parseBitcodeFile(Buffer, Context);
|
|
|
|
}
|
|
|
|
if (std::error_code EC = ModuleOrErr.getError()) {
|
|
|
|
Err = SMDiagnostic(Buffer.getBufferIdentifier(), SourceMgr::DK_Error,
|
|
|
|
EC.message());
|
|
|
|
Err.print("ThinLTO", errs());
|
|
|
|
report_fatal_error("Can't load module, abort.");
|
|
|
|
}
|
|
|
|
return std::move(ModuleOrErr.get());
|
|
|
|
}
|
|
|
|
|
|
|
|
// Simple helper to save temporary files for debug.
|
|
|
|
static void saveTempBitcode(const Module &TheModule, StringRef TempDir,
|
|
|
|
unsigned count, StringRef Suffix) {
|
|
|
|
if (TempDir.empty())
|
|
|
|
return;
|
|
|
|
// User asked to save temps, let dump the bitcode file after import.
|
|
|
|
auto SaveTempPath = TempDir + llvm::utostr(count) + Suffix;
|
|
|
|
std::error_code EC;
|
|
|
|
raw_fd_ostream OS(SaveTempPath.str(), EC, sys::fs::F_None);
|
|
|
|
if (EC)
|
|
|
|
report_fatal_error(Twine("Failed to open ") + SaveTempPath +
|
|
|
|
" to save optimized bitcode\n");
|
|
|
|
WriteBitcodeToFile(&TheModule, OS, true, false);
|
|
|
|
}
|
|
|
|
|
|
|
|
static StringMap<MemoryBufferRef>
|
|
|
|
generateModuleMap(const std::vector<MemoryBufferRef> &Modules) {
|
|
|
|
StringMap<MemoryBufferRef> ModuleMap;
|
|
|
|
for (auto &ModuleBuffer : Modules) {
|
|
|
|
assert(ModuleMap.find(ModuleBuffer.getBufferIdentifier()) ==
|
|
|
|
ModuleMap.end() &&
|
|
|
|
"Expect unique Buffer Identifier");
|
|
|
|
ModuleMap[ModuleBuffer.getBufferIdentifier()] = ModuleBuffer;
|
|
|
|
}
|
|
|
|
return ModuleMap;
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Provide a "loader" for the FunctionImporter to access function from other
|
|
|
|
/// modules.
|
|
|
|
class ModuleLoader {
|
|
|
|
/// The context that will be used for importing.
|
|
|
|
LLVMContext &Context;
|
|
|
|
|
|
|
|
/// Map from Module identifier to MemoryBuffer. Used by clients like the
|
|
|
|
/// FunctionImported to request loading a Module.
|
|
|
|
StringMap<MemoryBufferRef> &ModuleMap;
|
|
|
|
|
|
|
|
public:
|
|
|
|
ModuleLoader(LLVMContext &Context, StringMap<MemoryBufferRef> &ModuleMap)
|
|
|
|
: Context(Context), ModuleMap(ModuleMap) {}
|
|
|
|
|
|
|
|
/// Load a module on demand.
|
|
|
|
std::unique_ptr<Module> operator()(StringRef Identifier) {
|
|
|
|
return loadModuleFromBuffer(ModuleMap[Identifier], Context, /*Lazy*/ true);
|
|
|
|
}
|
|
|
|
};
|
|
|
|
|
2016-03-15 08:04:37 +08:00
|
|
|
static void promoteModule(Module &TheModule, const ModuleSummaryIndex &Index) {
|
2016-03-09 09:37:22 +08:00
|
|
|
if (renameModuleForThinLTO(TheModule, Index))
|
|
|
|
report_fatal_error("renameModuleForThinLTO failed");
|
|
|
|
}
|
|
|
|
|
2016-03-26 13:40:34 +08:00
|
|
|
static void
|
|
|
|
crossImportIntoModule(Module &TheModule, const ModuleSummaryIndex &Index,
|
|
|
|
StringMap<MemoryBufferRef> &ModuleMap,
|
|
|
|
const FunctionImporter::ImportMapTy &ImportList) {
|
2016-03-09 09:37:22 +08:00
|
|
|
ModuleLoader Loader(TheModule.getContext(), ModuleMap);
|
|
|
|
FunctionImporter Importer(Index, Loader);
|
2016-03-26 13:40:34 +08:00
|
|
|
Importer.importFunctions(TheModule, ImportList);
|
2016-03-09 09:37:22 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
static void optimizeModule(Module &TheModule, TargetMachine &TM) {
|
|
|
|
// Populate the PassManager
|
|
|
|
PassManagerBuilder PMB;
|
|
|
|
PMB.LibraryInfo = new TargetLibraryInfoImpl(TM.getTargetTriple());
|
|
|
|
PMB.Inliner = createFunctionInliningPass();
|
|
|
|
// FIXME: should get it from the bitcode?
|
|
|
|
PMB.OptLevel = 3;
|
|
|
|
PMB.LoopVectorize = true;
|
|
|
|
PMB.SLPVectorize = true;
|
|
|
|
PMB.VerifyInput = true;
|
|
|
|
PMB.VerifyOutput = false;
|
|
|
|
|
|
|
|
legacy::PassManager PM;
|
|
|
|
|
|
|
|
// Add the TTI (required to inform the vectorizer about register size for
|
|
|
|
// instance)
|
|
|
|
PM.add(createTargetTransformInfoWrapperPass(TM.getTargetIRAnalysis()));
|
|
|
|
|
|
|
|
// Add optimizations
|
|
|
|
PMB.populateThinLTOPassManager(PM);
|
|
|
|
PM.add(createObjCARCContractPass());
|
|
|
|
|
|
|
|
PM.run(TheModule);
|
|
|
|
}
|
|
|
|
|
|
|
|
std::unique_ptr<MemoryBuffer> codegenModule(Module &TheModule,
|
|
|
|
TargetMachine &TM) {
|
|
|
|
SmallVector<char, 128> OutputBuffer;
|
|
|
|
|
|
|
|
// CodeGen
|
|
|
|
{
|
|
|
|
raw_svector_ostream OS(OutputBuffer);
|
|
|
|
legacy::PassManager PM;
|
|
|
|
if (TM.addPassesToEmitFile(PM, OS, TargetMachine::CGFT_ObjectFile,
|
|
|
|
/* DisableVerify */ true))
|
|
|
|
report_fatal_error("Failed to setup codegen");
|
|
|
|
|
|
|
|
// Run codegen now. resulting binary is in OutputBuffer.
|
|
|
|
PM.run(TheModule);
|
|
|
|
}
|
|
|
|
return make_unique<ObjectMemoryBuffer>(std::move(OutputBuffer));
|
|
|
|
}
|
|
|
|
|
|
|
|
static std::unique_ptr<MemoryBuffer>
|
2016-03-15 08:04:37 +08:00
|
|
|
ProcessThinLTOModule(Module &TheModule, const ModuleSummaryIndex &Index,
|
2016-03-09 09:37:22 +08:00
|
|
|
StringMap<MemoryBufferRef> &ModuleMap, TargetMachine &TM,
|
2016-03-26 13:40:34 +08:00
|
|
|
const FunctionImporter::ImportMapTy &ImportList,
|
2016-03-09 09:37:22 +08:00
|
|
|
ThinLTOCodeGenerator::CachingOptions CacheOptions,
|
2016-04-01 14:47:02 +08:00
|
|
|
bool DisableCodeGen, StringRef SaveTempsDir,
|
|
|
|
unsigned count) {
|
2016-03-09 09:37:22 +08:00
|
|
|
|
|
|
|
// Save temps: after IPO.
|
|
|
|
saveTempBitcode(TheModule, SaveTempsDir, count, ".1.IPO.bc");
|
|
|
|
|
|
|
|
// "Benchmark"-like optimization: single-source case
|
|
|
|
bool SingleModule = (ModuleMap.size() == 1);
|
|
|
|
|
|
|
|
if (!SingleModule) {
|
|
|
|
promoteModule(TheModule, Index);
|
|
|
|
|
|
|
|
// Save temps: after promotion.
|
|
|
|
saveTempBitcode(TheModule, SaveTempsDir, count, ".2.promoted.bc");
|
|
|
|
|
2016-03-26 13:40:34 +08:00
|
|
|
crossImportIntoModule(TheModule, Index, ModuleMap, ImportList);
|
2016-03-09 09:37:22 +08:00
|
|
|
|
|
|
|
// Save temps: after cross-module import.
|
|
|
|
saveTempBitcode(TheModule, SaveTempsDir, count, ".3.imported.bc");
|
|
|
|
}
|
|
|
|
|
|
|
|
optimizeModule(TheModule, TM);
|
|
|
|
|
|
|
|
saveTempBitcode(TheModule, SaveTempsDir, count, ".3.opt.bc");
|
|
|
|
|
2016-04-01 14:47:02 +08:00
|
|
|
if (DisableCodeGen) {
|
|
|
|
// Configured to stop before CodeGen, serialize the bitcode and return.
|
|
|
|
SmallVector<char, 128> OutputBuffer;
|
|
|
|
{
|
|
|
|
raw_svector_ostream OS(OutputBuffer);
|
|
|
|
WriteBitcodeToFile(&TheModule, OS, true, true);
|
|
|
|
}
|
|
|
|
return make_unique<ObjectMemoryBuffer>(std::move(OutputBuffer));
|
|
|
|
}
|
|
|
|
|
2016-03-09 09:37:22 +08:00
|
|
|
return codegenModule(TheModule, TM);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Initialize the TargetMachine builder for a given Triple
|
|
|
|
static void initTMBuilder(TargetMachineBuilder &TMBuilder,
|
|
|
|
const Triple &TheTriple) {
|
|
|
|
// Set a default CPU for Darwin triples (copied from LTOCodeGenerator).
|
|
|
|
// FIXME this looks pretty terrible...
|
|
|
|
if (TMBuilder.MCpu.empty() && TheTriple.isOSDarwin()) {
|
|
|
|
if (TheTriple.getArch() == llvm::Triple::x86_64)
|
|
|
|
TMBuilder.MCpu = "core2";
|
|
|
|
else if (TheTriple.getArch() == llvm::Triple::x86)
|
|
|
|
TMBuilder.MCpu = "yonah";
|
|
|
|
else if (TheTriple.getArch() == llvm::Triple::aarch64)
|
|
|
|
TMBuilder.MCpu = "cyclone";
|
|
|
|
}
|
|
|
|
TMBuilder.TheTriple = std::move(TheTriple);
|
|
|
|
}
|
|
|
|
|
|
|
|
} // end anonymous namespace
|
|
|
|
|
|
|
|
void ThinLTOCodeGenerator::addModule(StringRef Identifier, StringRef Data) {
|
|
|
|
MemoryBufferRef Buffer(Data, Identifier);
|
|
|
|
if (Modules.empty()) {
|
|
|
|
// First module added, so initialize the triple and some options
|
|
|
|
LLVMContext Context;
|
|
|
|
Triple TheTriple(getBitcodeTargetTriple(Buffer, Context));
|
|
|
|
initTMBuilder(TMBuilder, Triple(TheTriple));
|
|
|
|
}
|
|
|
|
#ifndef NDEBUG
|
|
|
|
else {
|
|
|
|
LLVMContext Context;
|
|
|
|
assert(TMBuilder.TheTriple.str() ==
|
|
|
|
getBitcodeTargetTriple(Buffer, Context) &&
|
|
|
|
"ThinLTO modules with different triple not supported");
|
|
|
|
}
|
|
|
|
#endif
|
|
|
|
Modules.push_back(Buffer);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThinLTOCodeGenerator::preserveSymbol(StringRef Name) {
|
|
|
|
PreservedSymbols.insert(Name);
|
|
|
|
}
|
|
|
|
|
|
|
|
void ThinLTOCodeGenerator::crossReferenceSymbol(StringRef Name) {
|
|
|
|
CrossReferencedSymbols.insert(Name);
|
|
|
|
}
|
|
|
|
|
|
|
|
// TargetMachine factory
|
|
|
|
std::unique_ptr<TargetMachine> TargetMachineBuilder::create() const {
|
|
|
|
std::string ErrMsg;
|
|
|
|
const Target *TheTarget =
|
|
|
|
TargetRegistry::lookupTarget(TheTriple.str(), ErrMsg);
|
|
|
|
if (!TheTarget) {
|
|
|
|
report_fatal_error("Can't load target for this Triple: " + ErrMsg);
|
|
|
|
}
|
|
|
|
|
|
|
|
// Use MAttr as the default set of features.
|
|
|
|
SubtargetFeatures Features(MAttr);
|
|
|
|
Features.getDefaultSubtargetFeatures(TheTriple);
|
|
|
|
std::string FeatureStr = Features.getString();
|
|
|
|
return std::unique_ptr<TargetMachine>(TheTarget->createTargetMachine(
|
|
|
|
TheTriple.str(), MCpu, FeatureStr, Options, RelocModel,
|
|
|
|
CodeModel::Default, CGOptLevel));
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
2016-03-15 08:04:37 +08:00
|
|
|
* Produce the combined summary index from all the bitcode files:
|
2016-03-09 09:37:22 +08:00
|
|
|
* "thin-link".
|
|
|
|
*/
|
2016-03-15 08:04:37 +08:00
|
|
|
std::unique_ptr<ModuleSummaryIndex> ThinLTOCodeGenerator::linkCombinedIndex() {
|
|
|
|
std::unique_ptr<ModuleSummaryIndex> CombinedIndex;
|
2016-03-09 09:37:22 +08:00
|
|
|
uint64_t NextModuleId = 0;
|
|
|
|
for (auto &ModuleBuffer : Modules) {
|
2016-03-15 08:04:37 +08:00
|
|
|
ErrorOr<std::unique_ptr<object::ModuleSummaryIndexObjectFile>> ObjOrErr =
|
|
|
|
object::ModuleSummaryIndexObjectFile::create(ModuleBuffer,
|
|
|
|
diagnosticHandler, false);
|
2016-03-09 09:37:22 +08:00
|
|
|
if (std::error_code EC = ObjOrErr.getError()) {
|
|
|
|
// FIXME diagnose
|
2016-03-15 08:04:37 +08:00
|
|
|
errs() << "error: can't create ModuleSummaryIndexObjectFile for buffer: "
|
2016-03-09 09:37:22 +08:00
|
|
|
<< EC.message() << "\n";
|
|
|
|
return nullptr;
|
|
|
|
}
|
|
|
|
auto Index = (*ObjOrErr)->takeIndex();
|
|
|
|
if (CombinedIndex) {
|
|
|
|
CombinedIndex->mergeFrom(std::move(Index), ++NextModuleId);
|
|
|
|
} else {
|
|
|
|
CombinedIndex = std::move(Index);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return CombinedIndex;
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform promotion and renaming of exported internal functions.
|
|
|
|
*/
|
|
|
|
void ThinLTOCodeGenerator::promote(Module &TheModule,
|
2016-03-15 08:04:37 +08:00
|
|
|
ModuleSummaryIndex &Index) {
|
2016-03-09 09:37:22 +08:00
|
|
|
promoteModule(TheModule, Index);
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform cross-module importing for the module identified by ModuleIdentifier.
|
|
|
|
*/
|
|
|
|
void ThinLTOCodeGenerator::crossModuleImport(Module &TheModule,
|
2016-03-15 08:04:37 +08:00
|
|
|
ModuleSummaryIndex &Index) {
|
2016-03-09 09:37:22 +08:00
|
|
|
auto ModuleMap = generateModuleMap(Modules);
|
2016-03-26 13:40:34 +08:00
|
|
|
|
|
|
|
// Generate import/export list
|
|
|
|
auto ModuleCount = Index.modulePaths().size();
|
|
|
|
StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount);
|
|
|
|
StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount);
|
|
|
|
ComputeCrossModuleImport(Index, ImportLists, ExportLists);
|
|
|
|
auto &ImportList = ImportLists[TheModule.getModuleIdentifier()];
|
|
|
|
|
|
|
|
crossImportIntoModule(TheModule, Index, ModuleMap, ImportList);
|
2016-03-09 09:37:22 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform post-importing ThinLTO optimizations.
|
|
|
|
*/
|
|
|
|
void ThinLTOCodeGenerator::optimize(Module &TheModule) {
|
|
|
|
initTMBuilder(TMBuilder, Triple(TheModule.getTargetTriple()));
|
|
|
|
optimizeModule(TheModule, *TMBuilder.create());
|
|
|
|
}
|
|
|
|
|
|
|
|
/**
|
|
|
|
* Perform ThinLTO CodeGen.
|
|
|
|
*/
|
|
|
|
std::unique_ptr<MemoryBuffer> ThinLTOCodeGenerator::codegen(Module &TheModule) {
|
|
|
|
initTMBuilder(TMBuilder, Triple(TheModule.getTargetTriple()));
|
|
|
|
return codegenModule(TheModule, *TMBuilder.create());
|
|
|
|
}
|
|
|
|
|
|
|
|
// Main entry point for the ThinLTO processing
|
|
|
|
void ThinLTOCodeGenerator::run() {
|
2016-04-01 14:47:02 +08:00
|
|
|
if (CodeGenOnly) {
|
|
|
|
// Perform only parallel codegen and return.
|
|
|
|
ThreadPool Pool;
|
|
|
|
assert(ProducedBinaries.empty() && "The generator should not be reused");
|
|
|
|
ProducedBinaries.resize(Modules.size());
|
|
|
|
int count = 0;
|
|
|
|
for (auto &ModuleBuffer : Modules) {
|
|
|
|
Pool.async([&](int count) {
|
|
|
|
LLVMContext Context;
|
|
|
|
Context.setDiscardValueNames(LTODiscardValueNames);
|
|
|
|
|
|
|
|
// Parse module now
|
|
|
|
auto TheModule = loadModuleFromBuffer(ModuleBuffer, Context, false);
|
|
|
|
|
|
|
|
// CodeGen
|
|
|
|
ProducedBinaries[count] = codegen(*TheModule);
|
|
|
|
}, count++);
|
|
|
|
}
|
|
|
|
|
|
|
|
return;
|
|
|
|
}
|
|
|
|
|
2016-03-09 09:37:22 +08:00
|
|
|
// Sequential linking phase
|
|
|
|
auto Index = linkCombinedIndex();
|
|
|
|
|
|
|
|
// Save temps: index.
|
|
|
|
if (!SaveTempsDir.empty()) {
|
|
|
|
auto SaveTempPath = SaveTempsDir + "index.bc";
|
|
|
|
std::error_code EC;
|
|
|
|
raw_fd_ostream OS(SaveTempPath, EC, sys::fs::F_None);
|
|
|
|
if (EC)
|
|
|
|
report_fatal_error(Twine("Failed to open ") + SaveTempPath +
|
|
|
|
" to save optimized bitcode\n");
|
[ThinLTO] Support for reference graph in per-module and combined summary.
Summary:
This patch adds support for including a full reference graph including
call graph edges and other GV references in the summary.
The reference graph edges can be used to make importing decisions
without materializing any source modules, can be used in the plugin
to make file staging decisions for distributed build systems, and is
expected to have other uses.
The call graph edges are recorded in each function summary in the
bitcode via a list of <CalleeValueIds, StaticCount> tuples when no PGO
data exists, or <CalleeValueId, StaticCount, ProfileCount> pairs when
there is PGO, where the ValueId can be mapped to the function GUID via
the ValueSymbolTable. In the function index in memory, the call graph
edges reference the target via the CalleeGUID instead of the
CalleeValueId.
The reference graph edges are recorded in each summary record with a
list of referenced value IDs, which can be mapped to value GUID via the
ValueSymbolTable.
Addtionally, a new summary record type is added to record references
from global variable initializers. A number of bitcode records and data
structures have been renamed to reflect the newly expanded scope of the
summary beyond functions. More cleanup will follow.
Reviewers: joker.eph, davidxl
Subscribers: joker.eph, llvm-commits
Differential Revision: http://reviews.llvm.org/D17212
llvm-svn: 263275
2016-03-12 02:52:24 +08:00
|
|
|
WriteIndexToFile(*Index, OS);
|
2016-03-09 09:37:22 +08:00
|
|
|
}
|
|
|
|
|
|
|
|
// Prepare the resulting object vector
|
|
|
|
assert(ProducedBinaries.empty() && "The generator should not be reused");
|
|
|
|
ProducedBinaries.resize(Modules.size());
|
|
|
|
|
|
|
|
// Prepare the module map.
|
|
|
|
auto ModuleMap = generateModuleMap(Modules);
|
2016-03-26 13:40:34 +08:00
|
|
|
auto ModuleCount = Modules.size();
|
|
|
|
|
|
|
|
// Collect the import/export lists for all modules from the call-graph in the
|
|
|
|
// combined index.
|
|
|
|
StringMap<FunctionImporter::ImportMapTy> ImportLists(ModuleCount);
|
|
|
|
StringMap<FunctionImporter::ExportSetTy> ExportLists(ModuleCount);
|
|
|
|
ComputeCrossModuleImport(*Index, ImportLists, ExportLists);
|
2016-03-09 09:37:22 +08:00
|
|
|
|
|
|
|
// Parallel optimizer + codegen
|
|
|
|
{
|
|
|
|
ThreadPool Pool(ThreadCount);
|
|
|
|
int count = 0;
|
|
|
|
for (auto &ModuleBuffer : Modules) {
|
|
|
|
Pool.async([&](int count) {
|
|
|
|
LLVMContext Context;
|
Add a flag to the LLVMContext to disable name for Value other than GlobalValue
Summary:
This is intended to be a performance flag, on the same level as clang
cc1 option "--disable-free". LLVM will never initialize it by default,
it will be up to the client creating the LLVMContext to request this
behavior. Clang will do it by default in Release build (just like
--disable-free).
"opt" and "llc" can opt-in using -disable-named-value command line
option.
When performing LTO on llvm-tblgen, the initial merging of IR peaks
at 92MB without this patch, and 86MB after this patch,setNameImpl()
drops from 6.5MB to 0.5MB.
The total link time goes from ~29.5s to ~27.8s.
Compared to a compile-time flag (like the IRBuilder one), it performs
very close. I profiled on SROA and obtain these results:
420ms with IRBuilder that preserve name
372ms with IRBuilder that strip name
375ms with IRBuilder that preserve name, and a runtime flag to strip
Reviewers: chandlerc, dexonsmith, bogner
Subscribers: joker.eph, llvm-commits
Differential Revision: http://reviews.llvm.org/D17946
From: Mehdi Amini <mehdi.amini@apple.com>
llvm-svn: 263086
2016-03-10 09:28:54 +08:00
|
|
|
Context.setDiscardValueNames(LTODiscardValueNames);
|
2016-03-09 09:37:22 +08:00
|
|
|
|
|
|
|
// Parse module now
|
|
|
|
auto TheModule = loadModuleFromBuffer(ModuleBuffer, Context, false);
|
|
|
|
|
|
|
|
// Save temps: original file.
|
|
|
|
if (!SaveTempsDir.empty()) {
|
|
|
|
saveTempBitcode(*TheModule, SaveTempsDir, count, ".0.original.bc");
|
|
|
|
}
|
|
|
|
|
2016-03-26 13:40:34 +08:00
|
|
|
auto &ImportList = ImportLists[TheModule->getModuleIdentifier()];
|
2016-03-09 09:37:22 +08:00
|
|
|
ProducedBinaries[count] = ProcessThinLTOModule(
|
2016-03-26 13:40:34 +08:00
|
|
|
*TheModule, *Index, ModuleMap, *TMBuilder.create(), ImportList,
|
2016-04-01 14:47:02 +08:00
|
|
|
CacheOptions, DisableCodeGen, SaveTempsDir, count);
|
2016-03-09 09:37:22 +08:00
|
|
|
}, count);
|
|
|
|
count++;
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
// If statistics were requested, print them out now.
|
|
|
|
if (llvm::AreStatisticsEnabled())
|
|
|
|
llvm::PrintStatistics();
|
|
|
|
}
|