forked from OSchip/llvm-project
143 lines
4.8 KiB
C++
143 lines
4.8 KiB
C++
//===- CodegenCleanup.cpp -------------------------------------------------===//
|
|
//
|
|
// The LLVM Compiler Infrastructure
|
|
//
|
|
// This file is distributed under the University of Illinois Open Source
|
|
// License. See LICENSE.TXT for details.
|
|
//
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
#include "polly/CodeGen/CodegenCleanup.h"
|
|
|
|
#include "llvm/Analysis/ScopedNoAliasAA.h"
|
|
#include "llvm/Analysis/TypeBasedAliasAnalysis.h"
|
|
#include "llvm/IR/Function.h"
|
|
#include "llvm/IR/LegacyPassManager.h"
|
|
#include "llvm/PassInfo.h"
|
|
#include "llvm/PassRegistry.h"
|
|
#include "llvm/PassSupport.h"
|
|
#include "llvm/Support/Debug.h"
|
|
#include "llvm/Transforms/InstCombine/InstCombine.h"
|
|
#include "llvm/Transforms/Scalar.h"
|
|
#include "llvm/Transforms/Scalar/GVN.h"
|
|
#include "llvm/Transforms/Utils.h"
|
|
|
|
#define DEBUG_TYPE "polly-cleanup"
|
|
|
|
using namespace llvm;
|
|
using namespace polly;
|
|
|
|
namespace {
|
|
|
|
class CodegenCleanup : public FunctionPass {
|
|
private:
|
|
CodegenCleanup(const CodegenCleanup &) = delete;
|
|
const CodegenCleanup &operator=(const CodegenCleanup &) = delete;
|
|
|
|
llvm::legacy::FunctionPassManager *FPM;
|
|
|
|
public:
|
|
static char ID;
|
|
explicit CodegenCleanup() : FunctionPass(ID), FPM(nullptr) {}
|
|
|
|
/// @name FunctionPass interface
|
|
//@{
|
|
virtual void getAnalysisUsage(llvm::AnalysisUsage &AU) const override {}
|
|
|
|
virtual bool doInitialization(Module &M) override {
|
|
assert(!FPM);
|
|
|
|
FPM = new llvm::legacy::FunctionPassManager(&M);
|
|
|
|
// TODO: How to make parent passes discoverable?
|
|
// TODO: Should be sensitive to compiler options in PassManagerBuilder, to
|
|
// which we do not have access here.
|
|
FPM->add(createScopedNoAliasAAWrapperPass());
|
|
FPM->add(createTypeBasedAAWrapperPass());
|
|
FPM->add(createAAResultsWrapperPass());
|
|
|
|
// TODO: These are non-conditional passes that run between
|
|
// EP_ModuleOptimizerEarly and EP_VectorizerStart just to ensure we do not
|
|
// miss any optimization that would have run after Polly with
|
|
// -polly-position=early. This can probably be reduced to a more compact set
|
|
// of passes.
|
|
FPM->add(createCFGSimplificationPass());
|
|
FPM->add(createSROAPass());
|
|
FPM->add(createEarlyCSEPass());
|
|
|
|
FPM->add(createPromoteMemoryToRegisterPass());
|
|
FPM->add(createInstructionCombiningPass(true));
|
|
FPM->add(createCFGSimplificationPass());
|
|
FPM->add(createSROAPass());
|
|
FPM->add(createEarlyCSEPass(true));
|
|
FPM->add(createSpeculativeExecutionIfHasBranchDivergencePass());
|
|
FPM->add(createJumpThreadingPass());
|
|
FPM->add(createCorrelatedValuePropagationPass());
|
|
FPM->add(createCFGSimplificationPass());
|
|
FPM->add(createInstructionCombiningPass(true));
|
|
FPM->add(createLibCallsShrinkWrapPass());
|
|
FPM->add(createTailCallEliminationPass());
|
|
FPM->add(createCFGSimplificationPass());
|
|
FPM->add(createReassociatePass());
|
|
FPM->add(createLoopRotatePass(-1));
|
|
FPM->add(createGVNPass());
|
|
FPM->add(createLICMPass());
|
|
FPM->add(createLoopUnswitchPass());
|
|
FPM->add(createCFGSimplificationPass());
|
|
FPM->add(createInstructionCombiningPass(true));
|
|
FPM->add(createIndVarSimplifyPass());
|
|
FPM->add(createLoopIdiomPass());
|
|
FPM->add(createLoopDeletionPass());
|
|
FPM->add(createCFGSimplificationPass());
|
|
FPM->add(createSimpleLoopUnrollPass(3));
|
|
FPM->add(createMergedLoadStoreMotionPass());
|
|
FPM->add(createGVNPass());
|
|
FPM->add(createMemCpyOptPass());
|
|
FPM->add(createSCCPPass());
|
|
FPM->add(createBitTrackingDCEPass());
|
|
FPM->add(createInstructionCombiningPass(true));
|
|
FPM->add(createJumpThreadingPass());
|
|
FPM->add(createCorrelatedValuePropagationPass());
|
|
FPM->add(createDeadStoreEliminationPass());
|
|
FPM->add(createLICMPass());
|
|
FPM->add(createAggressiveDCEPass());
|
|
FPM->add(createCFGSimplificationPass());
|
|
FPM->add(createInstructionCombiningPass(true));
|
|
FPM->add(createFloat2IntPass());
|
|
|
|
return FPM->doInitialization();
|
|
}
|
|
|
|
virtual bool doFinalization(Module &M) override {
|
|
bool Result = FPM->doFinalization();
|
|
|
|
delete FPM;
|
|
FPM = nullptr;
|
|
|
|
return Result;
|
|
}
|
|
|
|
virtual bool runOnFunction(llvm::Function &F) override {
|
|
if (!F.hasFnAttribute("polly-optimized")) {
|
|
LLVM_DEBUG(
|
|
dbgs() << F.getName()
|
|
<< ": Skipping cleanup because Polly did not optimize it.");
|
|
return false;
|
|
}
|
|
|
|
LLVM_DEBUG(dbgs() << F.getName() << ": Running codegen cleanup...");
|
|
return FPM->run(F);
|
|
}
|
|
//@}
|
|
};
|
|
|
|
char CodegenCleanup::ID;
|
|
} // namespace
|
|
|
|
FunctionPass *polly::createCodegenCleanupPass() { return new CodegenCleanup(); }
|
|
|
|
INITIALIZE_PASS_BEGIN(CodegenCleanup, "polly-cleanup",
|
|
"Polly - Cleanup after code generation", false, false)
|
|
INITIALIZE_PASS_END(CodegenCleanup, "polly-cleanup",
|
|
"Polly - Cleanup after code generation", false, false)
|