diff options
| author | Benjamin Kramer <benny.kra@googlemail.com> | 2012-09-10 11:52:08 +0000 |
|---|---|---|
| committer | Benjamin Kramer <benny.kra@googlemail.com> | 2012-09-10 11:52:08 +0000 |
| commit | 1f66f885e8ec5aac87d5d50c3d8b97ad876048f8 (patch) | |
| tree | c7c75f58e8eea8a2d1953733cd5855aa659b2369 /llvm | |
| parent | 8dd0edc7b150a3f724f000d2ef872c3dcac0bbd8 (diff) | |
| download | bcm5719-llvm-1f66f885e8ec5aac87d5d50c3d8b97ad876048f8.tar.gz bcm5719-llvm-1f66f885e8ec5aac87d5d50c3d8b97ad876048f8.zip | |
Move bypassSlowDivision into the llvm namespace.
llvm-svn: 163503
Diffstat (limited to 'llvm')
| -rw-r--r-- | llvm/include/llvm/Transforms/Utils/BypassSlowDivision.h | 10 | ||||
| -rw-r--r-- | llvm/lib/Transforms/Utils/BypassSlowDivision.cpp | 10 |
2 files changed, 13 insertions, 7 deletions
diff --git a/llvm/include/llvm/Transforms/Utils/BypassSlowDivision.h b/llvm/include/llvm/Transforms/Utils/BypassSlowDivision.h index 3646d736aba..c262434b662 100644 --- a/llvm/include/llvm/Transforms/Utils/BypassSlowDivision.h +++ b/llvm/include/llvm/Transforms/Utils/BypassSlowDivision.h @@ -20,10 +20,14 @@ #include "llvm/Function.h" +namespace llvm { + /// This optimization identifies DIV instructions that can be /// profitably bypassed and carried out with a shorter, faster divide. -bool bypassSlowDivision(llvm::Function &F, - llvm::Function::iterator &I, - const llvm::DenseMap<llvm::Type *, llvm::Type *> &BypassTypeMap); +bool bypassSlowDivision(Function &F, + Function::iterator &I, + const DenseMap<Type *, Type *> &BypassTypeMap); + +} // End llvm namespace #endif diff --git a/llvm/lib/Transforms/Utils/BypassSlowDivision.cpp b/llvm/lib/Transforms/Utils/BypassSlowDivision.cpp index b694779a532..30d60be277d 100644 --- a/llvm/lib/Transforms/Utils/BypassSlowDivision.cpp +++ b/llvm/lib/Transforms/Utils/BypassSlowDivision.cpp @@ -24,7 +24,7 @@ using namespace llvm; -namespace llvm { +namespace { struct DivOpInfo { bool SignedOp; Value *Dividend; @@ -41,7 +41,9 @@ namespace llvm { DivPhiNodes(PHINode *InQuotient, PHINode *InRemainder) : Quotient(InQuotient), Remainder(InRemainder) {} }; +} +namespace llvm { template<> struct DenseMapInfo<DivOpInfo> { static bool isEqual(const DivOpInfo &Val1, const DivOpInfo &Val2) { @@ -217,9 +219,9 @@ static bool reuseOrInsertFastDiv(Function &F, // bypassSlowDivision - This optimization identifies DIV instructions that can // be profitably bypassed and carried out with a shorter, faster divide. -bool bypassSlowDivision(Function &F, - Function::iterator &I, - const llvm::DenseMap<Type *, Type *> &BypassTypeMap) { +bool llvm::bypassSlowDivision(Function &F, + Function::iterator &I, + const DenseMap<Type *, Type *> &BypassTypeMap) { DivCacheTy DivCache; bool MadeChange = false; |

