[llvm-commits] CVS: llvm/lib/Transforms/Scalar/ADCE.cpp CorrelatedExprs.cpp GCSE.cpp IndVarSimplify.cpp LICM.cpp LoopPreheaders.cpp PiNodeInsertion.cpp SCCP.cpp
Misha Brukman
brukman at cs.uiuc.edu
Fri Oct 10 12:52:01 PDT 2003
Changes in directory llvm/lib/Transforms/Scalar:
ADCE.cpp updated: 1.62 -> 1.63
CorrelatedExprs.cpp updated: 1.14 -> 1.15
GCSE.cpp updated: 1.28 -> 1.29
IndVarSimplify.cpp updated: 1.38 -> 1.39
LICM.cpp updated: 1.35 -> 1.36
LoopPreheaders.cpp updated: 1.16 -> 1.17
PiNodeInsertion.cpp updated: 1.10 -> 1.11
SCCP.cpp updated: 1.78 -> 1.79
---
Log message:
Fix spelling.
---
Diffs of the changes: (+17 -17)
Index: llvm/lib/Transforms/Scalar/ADCE.cpp
diff -u llvm/lib/Transforms/Scalar/ADCE.cpp:1.62 llvm/lib/Transforms/Scalar/ADCE.cpp:1.63
--- llvm/lib/Transforms/Scalar/ADCE.cpp:1.62 Sat Sep 20 09:38:50 2003
+++ llvm/lib/Transforms/Scalar/ADCE.cpp Fri Oct 10 12:50:50 2003
@@ -259,7 +259,7 @@
// Loop over all of the instructions in the function, telling dead
// instructions to drop their references. This is so that the next sweep
// over the program can safely delete dead instructions without other dead
- // instructions still refering to them.
+ // instructions still referring to them.
//
dropReferencesOfDeadInstructionsInLiveBlock(I);
@@ -328,9 +328,9 @@
if (LastNode == 0) { // No postdominator!
// Call RemoveSuccessor to transmogrify the terminator instruction
// to not contain the outgoing branch, or to create a new
- // terminator if the form fundementally changes (ie unconditional
- // branch to return). Note that this will change a branch into an
- // infinite loop into a return instruction!
+ // terminator if the form fundamentally changes (i.e.,
+ // unconditional branch to return). Note that this will change a
+ // branch into an infinite loop into a return instruction!
//
RemoveSuccessor(TI, i);
@@ -378,7 +378,7 @@
// Now loop over all of the instructions in the basic block, telling
// dead instructions to drop their references. This is so that the next
// sweep over the program can safely delete dead instructions without
- // other dead instructions still refering to them.
+ // other dead instructions still referring to them.
//
dropReferencesOfDeadInstructionsInLiveBlock(BB);
}
Index: llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp
diff -u llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.14 llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.15
--- llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.14 Sat Sep 20 09:38:50 2003
+++ llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp Fri Oct 10 12:50:50 2003
@@ -121,7 +121,7 @@
void setReplacement(Value *Repl) { Replacement = Repl; }
// getRelation - return the relationship entry for the specified value.
- // This can invalidate references to other Relation's, so use it carefully.
+ // This can invalidate references to other Relations, so use it carefully.
//
Relation &getRelation(Value *V) {
// Binary search for V's entry...
@@ -896,7 +896,7 @@
return;
}
- // If the information propogted is new, then we want process the uses of this
+ // If the information propagated is new, then we want process the uses of this
// instruction to propagate the information down to them.
//
if (Op1R.incorporate(Opcode, VI))
Index: llvm/lib/Transforms/Scalar/GCSE.cpp
diff -u llvm/lib/Transforms/Scalar/GCSE.cpp:1.28 llvm/lib/Transforms/Scalar/GCSE.cpp:1.29
--- llvm/lib/Transforms/Scalar/GCSE.cpp:1.28 Mon Jun 16 22:57:18 2003
+++ llvm/lib/Transforms/Scalar/GCSE.cpp Fri Oct 10 12:50:50 2003
@@ -193,7 +193,7 @@
Instruction *Ret = 0;
if (BB1 == BB2) {
- // Eliminate the second occuring instruction. Add all uses of the second
+ // Eliminate the second occurring instruction. Add all uses of the second
// instruction to the worklist.
//
// Scan the basic block looking for the "first" instruction
@@ -242,7 +242,7 @@
// ... X+Y ...
// }
//
- // In thiscase, the expression would be hoisted to outside the 'if' stmt,
+ // In this case, the expression would be hoisted to outside the 'if' stmt,
// causing the expression to be evaluated, even for the if (d) path, which
// could cause problems, if, for example, it caused a divide by zero. In
// general the problem this case is trying to solve is better addressed with
Index: llvm/lib/Transforms/Scalar/IndVarSimplify.cpp
diff -u llvm/lib/Transforms/Scalar/IndVarSimplify.cpp:1.38 llvm/lib/Transforms/Scalar/IndVarSimplify.cpp:1.39
--- llvm/lib/Transforms/Scalar/IndVarSimplify.cpp:1.38 Tue Sep 23 15:26:48 2003
+++ llvm/lib/Transforms/Scalar/IndVarSimplify.cpp Fri Oct 10 12:50:50 2003
@@ -50,7 +50,7 @@
BasicBlock::iterator AfterPHIIt = Header->begin();
for (; PHINode *PN = dyn_cast<PHINode>(AfterPHIIt); ++AfterPHIIt)
IndVars.push_back(InductionVariable(PN, Loops));
- // AfterPHIIt now points to first nonphi instruction...
+ // AfterPHIIt now points to first non-phi instruction...
// If there are no phi nodes in this basic block, there can't be indvars...
if (IndVars.empty()) return Changed;
Index: llvm/lib/Transforms/Scalar/LICM.cpp
diff -u llvm/lib/Transforms/Scalar/LICM.cpp:1.35 llvm/lib/Transforms/Scalar/LICM.cpp:1.36
--- llvm/lib/Transforms/Scalar/LICM.cpp:1.35 Sun Oct 5 16:20:02 2003
+++ llvm/lib/Transforms/Scalar/LICM.cpp Fri Oct 10 12:50:50 2003
@@ -77,7 +77,7 @@
/// HoistRegion - Walk the specified region of the CFG (defined by all
/// blocks dominated by the specified block, and that are in the current
/// loop) in depth first order w.r.t the DominatorTree. This allows us to
- /// visit defintions before uses, allowing us to hoist a loop body in one
+ /// visit definitions before uses, allowing us to hoist a loop body in one
/// pass without iteration.
///
void HoistRegion(DominatorTree::Node *N);
@@ -240,7 +240,7 @@
/// HoistRegion - Walk the specified region of the CFG (defined by all blocks
/// dominated by the specified block, and that are in the current loop) in depth
-/// first order w.r.t the DominatorTree. This allows us to visit defintions
+/// first order w.r.t the DominatorTree. This allows us to visit definitions
/// before uses, allowing us to hoist a loop body in one pass without iteration.
///
void LICM::HoistRegion(DominatorTree::Node *N) {
Index: llvm/lib/Transforms/Scalar/LoopPreheaders.cpp
diff -u llvm/lib/Transforms/Scalar/LoopPreheaders.cpp:1.16 llvm/lib/Transforms/Scalar/LoopPreheaders.cpp:1.17
--- llvm/lib/Transforms/Scalar/LoopPreheaders.cpp:1.16 Thu Sep 11 11:26:11 2003
+++ llvm/lib/Transforms/Scalar/LoopPreheaders.cpp Fri Oct 10 12:50:50 2003
@@ -13,7 +13,7 @@
// as store-sinking that are built into LICM.
//
// Note that the simplifycfg pass will clean up blocks which are split out but
-// end up being unnecessary, so usage of this pass does not neccesarily
+// end up being unnecessary, so usage of this pass does not necessarily
// pessimize generated code.
//
//===----------------------------------------------------------------------===//
@@ -203,7 +203,7 @@
SplitBlockPredecessors(Header, ".preheader", OutsideBlocks);
//===--------------------------------------------------------------------===//
- // Update analysis results now that we have preformed the transformation
+ // Update analysis results now that we have performed the transformation
//
// We know that we have loop information to update... update it now.
Index: llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp
diff -u llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp:1.10 llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp:1.11
--- llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp:1.10 Wed Sep 10 00:29:03 2003
+++ llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp Fri Oct 10 12:50:50 2003
@@ -1,7 +1,7 @@
//===- PiNodeInsertion.cpp - Insert Pi nodes into a program ---------------===//
//
// PiNodeInsertion - This pass inserts single entry Phi nodes into basic blocks
-// that are preceeded by a conditional branch, where the branch gives
+// that are preceded by a conditional branch, where the branch gives
// information about the operands of the condition. For example, this C code:
// if (x == 0) { ... = x + 4;
// becomes:
@@ -15,7 +15,7 @@
// saying that X has a value of 0 in this scope. The power of this analysis
// information is that "in the scope" translates to "for all uses of x2".
//
-// This special form of Phi node is refered to as a Pi node, following the
+// This special form of Phi node is referred to as a Pi node, following the
// terminology defined in the "Array Bounds Checks on Demand" paper.
//
// As a really trivial example of what the Pi nodes are good for, this pass
Index: llvm/lib/Transforms/Scalar/SCCP.cpp
diff -u llvm/lib/Transforms/Scalar/SCCP.cpp:1.78 llvm/lib/Transforms/Scalar/SCCP.cpp:1.79
--- llvm/lib/Transforms/Scalar/SCCP.cpp:1.78 Wed Oct 8 11:56:11 2003
+++ llvm/lib/Transforms/Scalar/SCCP.cpp Fri Oct 10 12:50:50 2003
@@ -499,7 +499,7 @@
// this is the case, the PHI remains undefined.
//
if (OperandVal)
- markConstant(PNIV, &PN, OperandVal); // Aquire operand value
+ markConstant(PNIV, &PN, OperandVal); // Acquire operand value
}
void SCCP::visitTerminatorInst(TerminatorInst &TI) {
More information about the llvm-commits
mailing list