maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Stylistic and 80-col fixes 

llvm-svn: 163940
This commit is contained in:
Evan Cheng 2012-09-14 21:25:34 +00:00
parent 617108990d
commit 71be12b35b
3 changed files with 5 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

2
llvm/include/llvm/Transforms/Utils/BypassSlowDivision.h
View File

@ -26,7 +26,7 @@ namespace llvm {
/// profitably bypassed and carried out with a shorter, faster divide.
bool bypassSlowDivision(Function &F,
Function::iterator &I,
const DenseMap<Type *, Type *> &BypassTypeMap);
const DenseMap<Type*, Type*> &BypassTypeMap);
} // End llvm namespace

10
llvm/lib/Transforms/Scalar/CodeGenPrepare.cpp
View File

@ -152,13 +152,9 @@ bool CodeGenPrepare::runOnFunction(Function &F) {
/// This optimization identifies DIV instructions that can be
/// profitably bypassed and carried out with a shorter, faster divide.
if (TLI && TLI->isSlowDivBypassed()) {
const DenseMap<Type *, Type *> &BypassTypeMap = TLI->getBypassSlowDivTypes();
for (Function::iterator I = F.begin(); I != F.end(); I++) {
EverMadeChange |= bypassSlowDivision(F,
I,
BypassTypeMap);
}
const DenseMap<Type*, Type*> &BypassTypeMap = TLI->getBypassSlowDivTypes();
for (Function::iterator I = F.begin(); I != F.end(); I++)
EverMadeChange |= bypassSlowDivision(F, I, BypassTypeMap);
}
// Eliminate blocks that contain only PHI nodes and an

2
llvm/lib/Transforms/Utils/BypassSlowDivision.cpp
View File

@ -221,7 +221,7 @@ static bool reuseOrInsertFastDiv(Function &F,
// be profitably bypassed and carried out with a shorter, faster divide.
bool llvm::bypassSlowDivision(Function &F,
Function::iterator &I,
const DenseMap<Type *, Type *> &BypassTypeMap) {
const DenseMap<Type*, Type*> &BypassTypeMap) {
DivCacheTy DivCache;
bool MadeChange = false;