forked from OSchip/llvm-project
[Polly] Run early cse + memory SSA to remove redundancies in the input code
This allows us to get rid of many identical loads as they commonly appear in Fortran code. llvm-svn: 311231
This commit is contained in:
parent
59dc64f3af
commit
d5f1fad77c
|
@ -28,8 +28,10 @@ static cl::opt<bool>
|
|||
cl::init(false), cl::ZeroOrMore, cl::cat(PollyCategory));
|
||||
|
||||
void polly::registerCanonicalicationPasses(llvm::legacy::PassManagerBase &PM) {
|
||||
bool UseMemSSA = true;
|
||||
PM.add(polly::createRewriteByrefParamsPass());
|
||||
PM.add(llvm::createPromoteMemoryToRegisterPass());
|
||||
PM.add(llvm::createEarlyCSEPass(UseMemSSA));
|
||||
PM.add(llvm::createInstructionCombiningPass());
|
||||
PM.add(llvm::createCFGSimplificationPass());
|
||||
PM.add(llvm::createTailCallEliminationPass());
|
||||
|
|
Loading…
Reference in New Issue