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

Delete trailing whitespace. 

llvm-svn: 64784
This commit is contained in:
Dan Gohman 2009-02-17 19:13:57 +00:00
parent 7b8b7492dd
commit f84d42f282
1 changed files with 34 additions and 34 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

68
llvm/lib/Transforms/Scalar/IndVarSimplify.cpp
View File

@ -99,7 +99,7 @@ namespace {
void DeleteTriviallyDeadInstructions(SmallPtrSet<Instruction*, 16> &Insts); void DeleteTriviallyDeadInstructions(SmallPtrSet<Instruction*, 16> &Insts);
void HandleFloatingPointIV(Loop *L, PHINode *PH, void HandleFloatingPointIV(Loop *L, PHINode *PH,
SmallPtrSet<Instruction*, 16> &DeadInsts); SmallPtrSet<Instruction*, 16> &DeadInsts);
}; };
} }
@ -147,7 +147,7 @@ void IndVarSimplify::EliminatePointerRecurrence(PHINode *PN,
if (GEPI->getOperand(0) == PN) { if (GEPI->getOperand(0) == PN) {
assert(GEPI->getNumOperands() == 2 && "GEP types must match!"); assert(GEPI->getNumOperands() == 2 && "GEP types must match!");
DOUT << "INDVARS: Eliminating pointer recurrence: " << *GEPI; DOUT << "INDVARS: Eliminating pointer recurrence: " << *GEPI;
// Okay, we found a pointer recurrence. Transform this pointer // Okay, we found a pointer recurrence. Transform this pointer
// recurrence into an integer recurrence. Compute the value that gets // recurrence into an integer recurrence. Compute the value that gets
// added to the pointer at every iteration. // added to the pointer at every iteration.
@ -191,7 +191,7 @@ void IndVarSimplify::EliminatePointerRecurrence(PHINode *PN,
Idx[0] = Constant::getNullValue(Type::Int32Ty); Idx[0] = Constant::getNullValue(Type::Int32Ty);
Idx[1] = NewAdd; Idx[1] = NewAdd;
GetElementPtrInst *NGEPI = GetElementPtrInst::Create( GetElementPtrInst *NGEPI = GetElementPtrInst::Create(
NCE, Idx, Idx + 2, NCE, Idx, Idx + 2,
GEPI->getName(), GEPI); GEPI->getName(), GEPI);
SE->deleteValueFromRecords(GEPI); SE->deleteValueFromRecords(GEPI);
GEPI->replaceAllUsesWith(NGEPI); GEPI->replaceAllUsesWith(NGEPI);
@ -329,18 +329,18 @@ void IndVarSimplify::RewriteLoopExitValues(Loop *L, SCEV *IterationCount) {
// the exit blocks of the loop to find them. // the exit blocks of the loop to find them.
for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) { for (unsigned i = 0, e = ExitBlocks.size(); i != e; ++i) {
BasicBlock *ExitBB = ExitBlocks[i]; BasicBlock *ExitBB = ExitBlocks[i];
// If there are no PHI nodes in this exit block, then no values defined // If there are no PHI nodes in this exit block, then no values defined
// inside the loop are used on this path, skip it. // inside the loop are used on this path, skip it.
PHINode *PN = dyn_cast<PHINode>(ExitBB->begin()); PHINode *PN = dyn_cast<PHINode>(ExitBB->begin());
if (!PN) continue; if (!PN) continue;
unsigned NumPreds = PN->getNumIncomingValues(); unsigned NumPreds = PN->getNumIncomingValues();
// Iterate over all of the PHI nodes. // Iterate over all of the PHI nodes.
BasicBlock::iterator BBI = ExitBB->begin(); BasicBlock::iterator BBI = ExitBB->begin();
while ((PN = dyn_cast<PHINode>(BBI++))) { while ((PN = dyn_cast<PHINode>(BBI++))) {
// Iterate over all of the values in all the PHI nodes. // Iterate over all of the values in all the PHI nodes.
for (unsigned i = 0; i != NumPreds; ++i) { for (unsigned i = 0; i != NumPreds; ++i) {
// If the value being merged in is not integer or is not defined // If the value being merged in is not integer or is not defined
@ -352,14 +352,14 @@ void IndVarSimplify::RewriteLoopExitValues(Loop *L, SCEV *IterationCount) {
continue; continue;
// If this pred is for a subloop, not L itself, skip it. // If this pred is for a subloop, not L itself, skip it.
if (LI->getLoopFor(PN->getIncomingBlock(i)) != L) if (LI->getLoopFor(PN->getIncomingBlock(i)) != L)
continue; // The Block is in a subloop, skip it. continue; // The Block is in a subloop, skip it.
// Check that InVal is defined in the loop. // Check that InVal is defined in the loop.
Instruction *Inst = cast<Instruction>(InVal); Instruction *Inst = cast<Instruction>(InVal);
if (!L->contains(Inst->getParent())) if (!L->contains(Inst->getParent()))
continue; continue;
// We require that this value either have a computable evolution or that // We require that this value either have a computable evolution or that
// the loop have a constant iteration count. In the case where the loop // the loop have a constant iteration count. In the case where the loop
// has a constant iteration count, we can sometimes force evaluation of // has a constant iteration count, we can sometimes force evaluation of
@ -367,7 +367,7 @@ void IndVarSimplify::RewriteLoopExitValues(Loop *L, SCEV *IterationCount) {
SCEVHandle SH = SE->getSCEV(Inst); SCEVHandle SH = SE->getSCEV(Inst);
if (!SH->hasComputableLoopEvolution(L) && !HasConstantItCount) if (!SH->hasComputableLoopEvolution(L) && !HasConstantItCount)
continue; // Cannot get exit evolution for the loop value. continue; // Cannot get exit evolution for the loop value.
// Okay, this instruction has a user outside of the current loop // Okay, this instruction has a user outside of the current loop
// and varies predictably *inside* the loop. Evaluate the value it // and varies predictably *inside* the loop. Evaluate the value it
// contains when the loop exits, if possible. // contains when the loop exits, if possible.
@ -378,22 +378,22 @@ void IndVarSimplify::RewriteLoopExitValues(Loop *L, SCEV *IterationCount) {
Changed = true; Changed = true;
++NumReplaced; ++NumReplaced;
// See if we already computed the exit value for the instruction, if so, // See if we already computed the exit value for the instruction, if so,
// just reuse it. // just reuse it.
Value *&ExitVal = ExitValues[Inst]; Value *&ExitVal = ExitValues[Inst];
if (!ExitVal) if (!ExitVal)
ExitVal = Rewriter.expandCodeFor(ExitValue, InsertPt); ExitVal = Rewriter.expandCodeFor(ExitValue, InsertPt);
DOUT << "INDVARS: RLEV: AfterLoopVal = " << *ExitVal DOUT << "INDVARS: RLEV: AfterLoopVal = " << *ExitVal
<< " LoopVal = " << *Inst << "\n"; << " LoopVal = " << *Inst << "\n";
PN->setIncomingValue(i, ExitVal); PN->setIncomingValue(i, ExitVal);
// If this instruction is dead now, schedule it to be removed. // If this instruction is dead now, schedule it to be removed.
if (Inst->use_empty()) if (Inst->use_empty())
InstructionsToDelete.insert(Inst); InstructionsToDelete.insert(Inst);
// See if this is a single-entry LCSSA PHI node. If so, we can (and // See if this is a single-entry LCSSA PHI node. If so, we can (and
// have to) remove // have to) remove
// the PHI entirely. This is safe, because the NewVal won't be variant // the PHI entirely. This is safe, because the NewVal won't be variant
@ -407,7 +407,7 @@ void IndVarSimplify::RewriteLoopExitValues(Loop *L, SCEV *IterationCount) {
} }
} }
} }
DeleteTriviallyDeadInstructions(InstructionsToDelete); DeleteTriviallyDeadInstructions(InstructionsToDelete);
} }
@ -766,14 +766,14 @@ bool IndVarSimplify::runOnLoop(Loop *L, LPPassManager &LPM) {
static bool useSIToFPInst(ConstantFP &InitV, ConstantFP &ExitV, static bool useSIToFPInst(ConstantFP &InitV, ConstantFP &ExitV,
uint64_t intIV, uint64_t intEV) { uint64_t intIV, uint64_t intEV) {
if (InitV.getValueAPF().isNegative() || ExitV.getValueAPF().isNegative()) if (InitV.getValueAPF().isNegative() || ExitV.getValueAPF().isNegative())
return true; return true;
// If the iteration range can be handled by SIToFPInst then use it. // If the iteration range can be handled by SIToFPInst then use it.
APInt Max = APInt::getSignedMaxValue(32); APInt Max = APInt::getSignedMaxValue(32);
if (Max.getZExtValue() > static_cast<uint64_t>(abs(intEV - intIV))) if (Max.getZExtValue() > static_cast<uint64_t>(abs(intEV - intIV)))
return true; return true;
return false; return false;
} }
@ -783,11 +783,11 @@ static bool convertToInt(const APFloat &APF, uint64_t *intVal) {
bool isExact = false; bool isExact = false;
if (&APF.getSemantics() == &APFloat::PPCDoubleDouble) if (&APF.getSemantics() == &APFloat::PPCDoubleDouble)
return false; return false;
if (APF.convertToInteger(intVal, 32, APF.isNegative(), if (APF.convertToInteger(intVal, 32, APF.isNegative(),
APFloat::rmTowardZero, &isExact) APFloat::rmTowardZero, &isExact)
!= APFloat::opOK) != APFloat::opOK)
return false; return false;
if (!isExact) if (!isExact)
return false; return false;
return true; return true;
@ -802,12 +802,12 @@ static bool convertToInt(const APFloat &APF, uint64_t *intVal) {
/// for(int i = 0; i < 10000; ++i) /// for(int i = 0; i < 10000; ++i)
/// bar((double)i); /// bar((double)i);
/// ///
void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH, void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH,
SmallPtrSet<Instruction*, 16> &DeadInsts) { SmallPtrSet<Instruction*, 16> &DeadInsts) {
unsigned IncomingEdge = L->contains(PH->getIncomingBlock(0)); unsigned IncomingEdge = L->contains(PH->getIncomingBlock(0));
unsigned BackEdge = IncomingEdge^1; unsigned BackEdge = IncomingEdge^1;
// Check incoming value. // Check incoming value.
ConstantFP *InitValue = dyn_cast<ConstantFP>(PH->getIncomingValue(IncomingEdge)); ConstantFP *InitValue = dyn_cast<ConstantFP>(PH->getIncomingValue(IncomingEdge));
if (!InitValue) return; if (!InitValue) return;
@ -817,7 +817,7 @@ void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH,
// Check IV increment. Reject this PH if increement operation is not // Check IV increment. Reject this PH if increement operation is not
// an add or increment value can not be represented by an integer. // an add or increment value can not be represented by an integer.
BinaryOperator *Incr = BinaryOperator *Incr =
dyn_cast<BinaryOperator>(PH->getIncomingValue(BackEdge)); dyn_cast<BinaryOperator>(PH->getIncomingValue(BackEdge));
if (!Incr) return; if (!Incr) return;
if (Incr->getOpcode() != Instruction::Add) return; if (Incr->getOpcode() != Instruction::Add) return;
@ -830,7 +830,7 @@ void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH,
uint64_t newIncrValue = Type::Int32Ty->getPrimitiveSizeInBits(); uint64_t newIncrValue = Type::Int32Ty->getPrimitiveSizeInBits();
if (!convertToInt(IncrValue->getValueAPF(), &newIncrValue)) if (!convertToInt(IncrValue->getValueAPF(), &newIncrValue))
return; return;
// Check Incr uses. One user is PH and the other users is exit condition used // Check Incr uses. One user is PH and the other users is exit condition used
// by the conditional terminator. // by the conditional terminator.
Value::use_iterator IncrUse = Incr->use_begin(); Value::use_iterator IncrUse = Incr->use_begin();
@ -838,7 +838,7 @@ void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH,
if (IncrUse == Incr->use_end()) return; if (IncrUse == Incr->use_end()) return;
Instruction *U2 = cast<Instruction>(IncrUse++); Instruction *U2 = cast<Instruction>(IncrUse++);
if (IncrUse != Incr->use_end()) return; if (IncrUse != Incr->use_end()) return;
// Find exit condition. // Find exit condition.
FCmpInst *EC = dyn_cast<FCmpInst>(U1); FCmpInst *EC = dyn_cast<FCmpInst>(U1);
if (!EC) if (!EC)
@ -861,7 +861,7 @@ void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH,
uint64_t intEV = Type::Int32Ty->getPrimitiveSizeInBits(); uint64_t intEV = Type::Int32Ty->getPrimitiveSizeInBits();
if (!convertToInt(EV->getValueAPF(), &intEV)) if (!convertToInt(EV->getValueAPF(), &intEV))
return; return;
// Find new predicate for integer comparison. // Find new predicate for integer comparison.
CmpInst::Predicate NewPred = CmpInst::BAD_ICMP_PREDICATE; CmpInst::Predicate NewPred = CmpInst::BAD_ICMP_PREDICATE;
switch (EC->getPredicate()) { switch (EC->getPredicate()) {
@ -889,15 +889,15 @@ void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH,
break; break;
} }
if (NewPred == CmpInst::BAD_ICMP_PREDICATE) return; if (NewPred == CmpInst::BAD_ICMP_PREDICATE) return;
// Insert new integer induction variable. // Insert new integer induction variable.
PHINode *NewPHI = PHINode::Create(Type::Int32Ty, PHINode *NewPHI = PHINode::Create(Type::Int32Ty,
PH->getName()+".int", PH); PH->getName()+".int", PH);
NewPHI->addIncoming(ConstantInt::get(Type::Int32Ty, newInitValue), NewPHI->addIncoming(ConstantInt::get(Type::Int32Ty, newInitValue),
PH->getIncomingBlock(IncomingEdge)); PH->getIncomingBlock(IncomingEdge));
Value *NewAdd = BinaryOperator::CreateAdd(NewPHI, Value *NewAdd = BinaryOperator::CreateAdd(NewPHI,
ConstantInt::get(Type::Int32Ty, ConstantInt::get(Type::Int32Ty,
newIncrValue), newIncrValue),
Incr->getName()+".int", Incr); Incr->getName()+".int", Incr);
NewPHI->addIncoming(NewAdd, PH->getIncomingBlock(BackEdge)); NewPHI->addIncoming(NewAdd, PH->getIncomingBlock(BackEdge));
@ -905,25 +905,25 @@ void IndVarSimplify::HandleFloatingPointIV(Loop *L, PHINode *PH,
ConstantInt *NewEV = ConstantInt::get(Type::Int32Ty, intEV); ConstantInt *NewEV = ConstantInt::get(Type::Int32Ty, intEV);
Value *LHS = (EVIndex == 1 ? NewPHI->getIncomingValue(BackEdge) : NewEV); Value *LHS = (EVIndex == 1 ? NewPHI->getIncomingValue(BackEdge) : NewEV);
Value *RHS = (EVIndex == 1 ? NewEV : NewPHI->getIncomingValue(BackEdge)); Value *RHS = (EVIndex == 1 ? NewEV : NewPHI->getIncomingValue(BackEdge));
ICmpInst *NewEC = new ICmpInst(NewPred, LHS, RHS, EC->getNameStart(), ICmpInst *NewEC = new ICmpInst(NewPred, LHS, RHS, EC->getNameStart(),
EC->getParent()->getTerminator()); EC->getParent()->getTerminator());
// Delete old, floating point, exit comparision instruction. // Delete old, floating point, exit comparision instruction.
EC->replaceAllUsesWith(NewEC); EC->replaceAllUsesWith(NewEC);
DeadInsts.insert(EC); DeadInsts.insert(EC);
// Delete old, floating point, increment instruction. // Delete old, floating point, increment instruction.
Incr->replaceAllUsesWith(UndefValue::get(Incr->getType())); Incr->replaceAllUsesWith(UndefValue::get(Incr->getType()));
DeadInsts.insert(Incr); DeadInsts.insert(Incr);
// Replace floating induction variable. Give SIToFPInst preference over // Replace floating induction variable. Give SIToFPInst preference over
// UIToFPInst because it is faster on platforms that are widely used. // UIToFPInst because it is faster on platforms that are widely used.
if (useSIToFPInst(*InitValue, *EV, newInitValue, intEV)) { if (useSIToFPInst(*InitValue, *EV, newInitValue, intEV)) {
SIToFPInst *Conv = new SIToFPInst(NewPHI, PH->getType(), "indvar.conv", SIToFPInst *Conv = new SIToFPInst(NewPHI, PH->getType(), "indvar.conv",
PH->getParent()->getFirstNonPHI()); PH->getParent()->getFirstNonPHI());
PH->replaceAllUsesWith(Conv); PH->replaceAllUsesWith(Conv);
} else { } else {
UIToFPInst *Conv = new UIToFPInst(NewPHI, PH->getType(), "indvar.conv", UIToFPInst *Conv = new UIToFPInst(NewPHI, PH->getType(), "indvar.conv",
PH->getParent()->getFirstNonPHI()); PH->getParent()->getFirstNonPHI());
PH->replaceAllUsesWith(Conv); PH->replaceAllUsesWith(Conv);
} }