[llvm-commits] CVS: llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp InstructionCombining.cpp LICM.cpp PiNodeInsertion.cpp

[Chris Lattner]

Changes in directory llvm/lib/Transforms/Scalar:

CorrelatedExprs.cpp updated: 1.11 -> 1.12
InstructionCombining.cpp updated: 1.117 -> 1.118
LICM.cpp updated: 1.31 -> 1.32
PiNodeInsertion.cpp updated: 1.9 -> 1.10

---
Log message:

Fix spell-o's



---
Diffs of the changes:

Index: llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp
diff -u llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.11 llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.12
--- llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp:1.11	Fri Aug  1 17:15:03 2003
+++ llvm/lib/Transforms/Scalar/CorrelatedExprs.cpp	Wed Sep 10 00:29:03 2003
@@ -38,7 +38,7 @@
 
 namespace {
   Statistic<> NumSetCCRemoved("cee", "Number of setcc instruction eliminated");
-  Statistic<> NumOperandsCann("cee", "Number of operands cannonicalized");
+  Statistic<> NumOperandsCann("cee", "Number of operands canonicalized");
   Statistic<> BranchRevectors("cee", "Number of branches revectored");
 
   class ValueInfo;
@@ -950,7 +950,7 @@
 // X and a constant C, we can replace all uses of X with C in the region we are
 // interested in.  We generalize this replacement to replace variables with
 // other variables if they are equal and there is a variable with lower rank
-// than the current one.  This offers a cannonicalizing property that exposes
+// than the current one.  This offers a canonicalizing property that exposes
 // more redundancies for later transformations to take advantage of.
 //
 void CEE::ComputeReplacements(RegionInfo &RI) {
@@ -1019,7 +1019,7 @@
 }
 
 // SimplifyInstruction - Inspect the operands of the instruction, converting
-// them to their cannonical form if possible.  This takes care of, for example,
+// them to their canonical form if possible.  This takes care of, for example,
 // replacing a value 'X' with a constant 'C' if the instruction in question is
 // dominated by a true seteq 'X', 'C'.
 //


Index: llvm/lib/Transforms/Scalar/InstructionCombining.cpp
diff -u llvm/lib/Transforms/Scalar/InstructionCombining.cpp:1.117 llvm/lib/Transforms/Scalar/InstructionCombining.cpp:1.118
--- llvm/lib/Transforms/Scalar/InstructionCombining.cpp:1.117	Wed Aug 13 15:16:26 2003
+++ llvm/lib/Transforms/Scalar/InstructionCombining.cpp	Wed Sep 10 00:29:03 2003
@@ -12,7 +12,7 @@
 //
 // This is a simple worklist driven algorithm.
 //
-// This pass guarantees that the following cannonicalizations are performed on
+// This pass guarantees that the following canonicalizations are performed on
 // the program:
 //    1. If a binary operator has a constant operand, it is moved to the RHS
 //    2. Bitwise operators with constant operands are always grouped so that


Index: llvm/lib/Transforms/Scalar/LICM.cpp
diff -u llvm/lib/Transforms/Scalar/LICM.cpp:1.31 llvm/lib/Transforms/Scalar/LICM.cpp:1.32
--- llvm/lib/Transforms/Scalar/LICM.cpp:1.31	Mon Sep  8 13:17:14 2003
+++ llvm/lib/Transforms/Scalar/LICM.cpp	Wed Sep 10 00:29:03 2003
@@ -332,7 +332,7 @@
 ///
 void LICM::PromoteValuesInLoop() {
   // PromotedValues - List of values that are promoted out of the loop.  Each
-  // value has an alloca instruction for it, and a cannonical version of the
+  // value has an alloca instruction for it, and a canonical version of the
   // pointer.
   std::vector<std::pair<AllocaInst*, Value*> > PromotedValues;
   std::map<Value*, AllocaInst*> ValueToAllocaMap; // Map of ptr to alloca


Index: llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp
diff -u llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp:1.9 llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp:1.10
--- llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp:1.9	Mon Oct 21 15:00:26 2002
+++ llvm/lib/Transforms/Scalar/PiNodeInsertion.cpp	Wed Sep 10 00:29:03 2003
@@ -77,7 +77,7 @@
           Value *TrueRep = 0, *FalseRep = 0;
 
           // Make sure the the constant is the second operand if there is one...
-          // This fits with our cannonicalization patterns used elsewhere in the
+          // This fits with our canonicalization patterns used elsewhere in the
           // compiler, without depending on instcombine running before us.
           //
           if (isa<Constant>(SCI->getOperand(0)) &&