diff options
author | Evan Cheng <evan.cheng@apple.com> | 2008-06-12 20:55:39 +0000 |
---|---|---|
committer | Evan Cheng <evan.cheng@apple.com> | 2008-06-12 20:55:39 +0000 |
commit | 01247f9d6b09cb9f414583f74194d70e5e4c27a3 (patch) | |
tree | da74a8f83132bcfd314234ecaf57f8515b0ea206 /lib | |
parent | 9334fc68a7a03b4c2318422f08138b8711cb7526 (diff) | |
download | external_llvm-01247f9d6b09cb9f414583f74194d70e5e4c27a3.zip external_llvm-01247f9d6b09cb9f414583f74194d70e5e4c27a3.tar.gz external_llvm-01247f9d6b09cb9f414583f74194d70e5e4c27a3.tar.bz2 |
Revert 52223.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@52243 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib')
-rw-r--r-- | lib/Transforms/Scalar/TailDuplication.cpp | 18 |
1 files changed, 0 insertions, 18 deletions
diff --git a/lib/Transforms/Scalar/TailDuplication.cpp b/lib/Transforms/Scalar/TailDuplication.cpp index 4e0949a..d0998ab 100644 --- a/lib/Transforms/Scalar/TailDuplication.cpp +++ b/lib/Transforms/Scalar/TailDuplication.cpp @@ -33,7 +33,6 @@ #include "llvm/Support/Debug.h" #include "llvm/ADT/Statistic.h" #include "llvm/ADT/SmallPtrSet.h" -#include "llvm/Analysis/LoopInfo.h" #include <map> using namespace llvm; @@ -51,12 +50,10 @@ namespace { static char ID; // Pass identification, replacement for typeid TailDup() : FunctionPass((intptr_t)&ID) {} - virtual void getAnalysisUsage(AnalysisUsage &AU) const; private: inline bool shouldEliminateUnconditionalBranch(TerminatorInst *, unsigned); inline void eliminateUnconditionalBranch(BranchInst *BI); SmallPtrSet<BasicBlock*, 4> CycleDetector; - LoopInfo *LI; // The current loop information }; } @@ -72,9 +69,6 @@ FunctionPass *llvm::createTailDuplicationPass() { return new TailDup(); } /// a place it already pointed to earlier; see PR 2323. bool TailDup::runOnFunction(Function &F) { bool Changed = false; - - LI = &getAnalysis<LoopInfo>(); - CycleDetector.clear(); for (Function::iterator I = F.begin(), E = F.end(); I != E; ) { if (shouldEliminateUnconditionalBranch(I->getTerminator(), @@ -89,10 +83,6 @@ bool TailDup::runOnFunction(Function &F) { return Changed; } -void TailDup::getAnalysisUsage(AnalysisUsage &AU) const { - AU.addRequired<LoopInfo>(); -} - /// shouldEliminateUnconditionalBranch - Return true if this branch looks /// attractive to eliminate. We eliminate the branch if the destination basic /// block has <= 5 instructions in it, not counting PHI nodes. In practice, @@ -196,14 +186,6 @@ bool TailDup::shouldEliminateUnconditionalBranch(TerminatorInst *TI, if (!CycleDetector.insert(Dest)) return false; - // Avoid non-natural loops: - // If a loop header is duplicated, the former natural loop will contain two - // paths into the loop --> the loop it not natural anymore. We want to avoid - // this, because other optimizaions may fail to improve the loop because of - // this. - if (LI->isLoopHeader(Dest)) - return false; - return true; } |