[llvm-commits] CVS: llvm/lib/Analysis/Expressions.cpp IntervalPartition.cpp LoopInfo.cpp PostDominators.cpp
Misha Brukman
brukman at cs.uiuc.edu
Thu Apr 21 20:55:06 PDT 2005
Changes in directory llvm/lib/Analysis:
Expressions.cpp updated: 1.44 -> 1.45
IntervalPartition.cpp updated: 1.29 -> 1.30
LoopInfo.cpp updated: 1.62 -> 1.63
PostDominators.cpp updated: 1.51 -> 1.52
---
Log message:
Convert tabs to spaces
---
Diffs of the changes: (+18 -18)
Expressions.cpp | 18 +++++++++---------
IntervalPartition.cpp | 2 +-
LoopInfo.cpp | 6 +++---
PostDominators.cpp | 10 +++++-----
4 files changed, 18 insertions(+), 18 deletions(-)
Index: llvm/lib/Analysis/Expressions.cpp
diff -u llvm/lib/Analysis/Expressions.cpp:1.44 llvm/lib/Analysis/Expressions.cpp:1.45
--- llvm/lib/Analysis/Expressions.cpp:1.44 Thu Apr 21 16:04:58 2005
+++ llvm/lib/Analysis/Expressions.cpp Thu Apr 21 22:54:55 2005
@@ -38,7 +38,7 @@
}
ExprType::ExprType(const ConstantInt *scale, Value *var,
- const ConstantInt *offset) {
+ const ConstantInt *offset) {
Scale = var ? scale : 0; Var = var; Offset = offset;
ExprTy = Scale ? ScaledLinear : (Var ? Linear : Constant);
if (Scale && Scale->isNullValue()) { // Simplify 0*Var + const
@@ -169,7 +169,7 @@
Constant *Result = ConstantExpr::get(Instruction::Mul, (Constant*)Arg1,
(Constant*)Arg2);
assert(Result && Result->getType() == Arg1->getType() &&
- "Couldn't perform multiplication!");
+ "Couldn't perform multiplication!");
ConstantInt *ResultI = cast<ConstantInt>(Result);
// Check to see if the result is one of the special cases that we want to
@@ -207,15 +207,15 @@
switch (Left.ExprTy) {
case ExprType::Constant:
return ExprType(Right.Scale, Right.Var,
- DefZero(Right.Offset, Ty) + DefZero(Left.Offset, Ty));
+ DefZero(Right.Offset, Ty) + DefZero(Left.Offset, Ty));
case ExprType::Linear: // RHS side must be linear or scaled
case ExprType::ScaledLinear: // RHS must be scaled
if (Left.Var != Right.Var) // Are they the same variables?
return V; // if not, we don't know anything!
return ExprType(DefOne(Left.Scale , Ty) + DefOne(Right.Scale , Ty),
- Right.Var,
- DefZero(Left.Offset, Ty) + DefZero(Right.Offset, Ty));
+ Right.Var,
+ DefZero(Left.Offset, Ty) + DefZero(Right.Offset, Ty));
default:
assert(0 && "Dont' know how to handle this case!");
return ExprType();
@@ -233,7 +233,7 @@
if (NegOne == 0) return V; // Couldn't subtract values...
return ExprType(DefOne (E.Scale , Ty) * NegOne, E.Var,
- DefZero(E.Offset, Ty) * NegOne);
+ DefZero(E.Offset, Ty) * NegOne);
}
@@ -283,7 +283,7 @@
ExprType Left(ClassifyExpr(I->getOperand(0)));
if (Right.Offset == 0) return Left; // shl x, 0 = x
assert(Right.Offset->getType() == Type::UByteTy &&
- "Shift amount must always be a unsigned byte!");
+ "Shift amount must always be a unsigned byte!");
uint64_t ShiftAmount = cast<ConstantUInt>(Right.Offset)->getValue();
ConstantInt *Multiplier = getUnsignedConstant(1ULL << ShiftAmount, Ty);
@@ -301,7 +301,7 @@
return Expr;
return ExprType(DefOne(Left.Scale, Ty) * Multiplier, Left.Var,
- DefZero(Left.Offset, Ty) * Multiplier);
+ DefZero(Left.Offset, Ty) * Multiplier);
} // end case Instruction::Shl
case Instruction::Mul: {
@@ -316,7 +316,7 @@
const ConstantInt *Offs = Left.Offset;
if (Offs == 0) return ExprType();
return ExprType( DefOne(Right.Scale , Ty) * Offs, Right.Var,
- DefZero(Right.Offset, Ty) * Offs);
+ DefZero(Right.Offset, Ty) * Offs);
} // end case Instruction::Mul
case Instruction::Cast: {
Index: llvm/lib/Analysis/IntervalPartition.cpp
diff -u llvm/lib/Analysis/IntervalPartition.cpp:1.29 llvm/lib/Analysis/IntervalPartition.cpp:1.30
--- llvm/lib/Analysis/IntervalPartition.cpp:1.29 Thu Apr 21 16:04:58 2005
+++ llvm/lib/Analysis/IntervalPartition.cpp Thu Apr 21 22:54:55 2005
@@ -56,7 +56,7 @@
void IntervalPartition::updatePredecessors(Interval *Int) {
BasicBlock *Header = Int->getHeaderNode();
for (Interval::succ_iterator I = Int->Successors.begin(),
- E = Int->Successors.end(); I != E; ++I)
+ E = Int->Successors.end(); I != E; ++I)
getBlockInterval(*I)->Predecessors.push_back(Header);
}
Index: llvm/lib/Analysis/LoopInfo.cpp
diff -u llvm/lib/Analysis/LoopInfo.cpp:1.62 llvm/lib/Analysis/LoopInfo.cpp:1.63
--- llvm/lib/Analysis/LoopInfo.cpp:1.62 Thu Apr 21 16:04:58 2005
+++ llvm/lib/Analysis/LoopInfo.cpp Thu Apr 21 22:54:55 2005
@@ -109,7 +109,7 @@
BasicBlock *RootNode = DS.getRoot();
for (df_iterator<BasicBlock*> NI = df_begin(RootNode),
- NE = df_end(RootNode); NI != NE; ++NI)
+ NE = df_end(RootNode); NI != NE; ++NI)
if (Loop *L = ConsiderForLoop(*NI, DS))
TopLevelLoops.push_back(L);
}
@@ -191,7 +191,7 @@
// If there are any loops nested within this loop, create them now!
for (std::vector<BasicBlock*>::iterator I = L->Blocks.begin(),
- E = L->Blocks.end(); I != E; ++I)
+ E = L->Blocks.end(); I != E; ++I)
if (Loop *NewLoop = ConsiderForLoop(*I, DS)) {
L->SubLoops.push_back(NewLoop);
NewLoop->ParentLoop = L;
@@ -201,7 +201,7 @@
// loop can be found for them.
//
for (std::vector<BasicBlock*>::iterator I = L->Blocks.begin(),
- E = L->Blocks.end(); I != E; ++I) {
+ E = L->Blocks.end(); I != E; ++I) {
std::map<BasicBlock*, Loop*>::iterator BBMI = BBMap.lower_bound(*I);
if (BBMI == BBMap.end() || BBMI->first != *I) // Not in map yet...
BBMap.insert(BBMI, std::make_pair(*I, L)); // Must be at this level
Index: llvm/lib/Analysis/PostDominators.cpp
diff -u llvm/lib/Analysis/PostDominators.cpp:1.51 llvm/lib/Analysis/PostDominators.cpp:1.52
--- llvm/lib/Analysis/PostDominators.cpp:1.51 Thu Apr 21 16:04:58 2005
+++ llvm/lib/Analysis/PostDominators.cpp Thu Apr 21 22:54:55 2005
@@ -88,7 +88,7 @@
if (Roots.size() > 1)
WorkingSet.insert(0);
}
-
+
WorkingSet.insert(BB); // A block always dominates itself
DomSetType &BBSet = Doms[BB];
if (BBSet != WorkingSet) {
@@ -138,8 +138,8 @@
// dominator set size will be one less than BB's...
//
if (DS.getDominators(*I).size() == DomSetSize - 1) {
- IDoms[BB] = *I;
- break;
+ IDoms[BB] = *I;
+ break;
}
}
}
@@ -196,7 +196,7 @@
//
Node *IDomNode = Nodes[*I];
assert(IDomNode && "No node for IDOM?");
-
+
// Add a new tree node for this BasicBlock, and link it as a child of
// IDomNode
Nodes[BB] = IDomNode->addChild(new Node(BB, IDomNode));
@@ -240,7 +240,7 @@
DomSetType::const_iterator CDFI = ChildDF.begin(), CDFE = ChildDF.end();
for (; CDFI != CDFE; ++CDFI) {
if (!Node->dominates(DT[*CDFI]))
- S.insert(*CDFI);
+ S.insert(*CDFI);
}
}
More information about the llvm-commits
mailing list