Fix spell-o's

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@8431 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/docs/ProgrammersManual.html b/docs/ProgrammersManual.html
index be40ba32f1b59bc0d975d647e7536e03b0dcc974..116370ffd50556094d3753f4ea785379a0aa29e1 100644 (file)
--- a/docs/ProgrammersManual.html
+++ b/docs/ProgrammersManual.html
@@ -487,7 +487,7 @@ a report that looks like this:<p>
      49 cee             - Number of setcc instruction eliminated
     532 gcse            - Number of loads removed
    2919 gcse            - Number of instructions removed
-     86 indvars         - Number of cannonical indvars added
+     86 indvars         - Number of canonical indvars added
      87 indvars         - Number of aux indvars removed
      25 instcombine     - Number of dead inst eliminate
     434 instcombine     - Number of insts combined

diff --git a/docs/WritingAnLLVMPass.html b/docs/WritingAnLLVMPass.html
index f537066547ac969b0a5b300e884f9236f18b4326..0832a81644762b2f9ece3f03e23b94c4033f6a0d 100644 (file)
--- a/docs/WritingAnLLVMPass.html
+++ b/docs/WritingAnLLVMPass.html
@@ -308,7 +308,7 @@ OPTIONS:
     -gcse           - Global Common Subexpression Elimination
     -globaldce      - Dead Global Elimination
     <b>-hello          - Hello World Pass</b>
-    -indvars        - Cannonicalize Induction Variables
+    -indvars        - Canonicalize Induction Variables
     -inline         - Function Integration/Inlining
     -instcombine    - Combine redundant instructions
 ...

diff --git a/include/llvm/Transforms/Scalar.h b/include/llvm/Transforms/Scalar.h
index 50c6b2133497e441ea9fb2548e0842419c35f5b5..b240f58dc83cddc1dc0ace1638dcf5c58ea12a97 100644 (file)
--- a/include/llvm/Transforms/Scalar.h
+++ b/include/llvm/Transforms/Scalar.h
@@ -100,7 +100,7 @@ Pass *createGCSEPass();
 //===----------------------------------------------------------------------===//
 //
 // InductionVariableSimplify - Transform induction variables in a program to all
-// use a single cannonical induction variable per loop.
+// use a single canonical induction variable per loop.
 //
 Pass *createIndVarSimplifyPass();
 

diff --git a/lib/Transforms/IPO/ConstantMerge.cpp b/lib/Transforms/IPO/ConstantMerge.cpp
index 0774cf28942466e8f6ae3c4627a05b2ec2ab70cc..8372d3e0a663b2819a0dad6ee933f2611f6f8b22 100644 (file)
--- a/lib/Transforms/IPO/ConstantMerge.cpp
+++ b/lib/Transforms/IPO/ConstantMerge.cpp
@@ -46,7 +46,7 @@ bool ConstantMerge::run(Module &M) {
       if (I == CMap.end()) {    // Nope, add it to the map
         CMap.insert(I, std::make_pair(Init, GV));
       } else {                  // Yup, this is a duplicate!
-        // Make all uses of the duplicate constant use the cannonical version...
+        // Make all uses of the duplicate constant use the canonical version...
         GV->replaceAllUsesWith(I->second);
 
         // Delete the global value from the module... and back up iterator to

diff --git a/lib/Transforms/Scalar/CorrelatedExprs.cpp b/lib/Transforms/Scalar/CorrelatedExprs.cpp
index 3e8dc0ce5dab0c6e4a7f41ca255844d9e885d551..9b90155ca82a56a63ea31ef44e5f6fbb96a97482 100644 (file)
--- a/lib/Transforms/Scalar/CorrelatedExprs.cpp
+++ b/lib/Transforms/Scalar/CorrelatedExprs.cpp
@@ -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 @@ void CEE::IncorporateInstruction(Instruction *Inst, RegionInfo &RI) {
 // 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 @@ bool CEE::SimplifyBasicBlock(BasicBlock &BB, const RegionInfo &RI) {
 }
 
 // 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'.
 //

diff --git a/lib/Transforms/Scalar/InstructionCombining.cpp b/lib/Transforms/Scalar/InstructionCombining.cpp
index 4dd3cdccf8f9df394fedaf5f3097ab31acdbb937..eddde0caf1799d2b5345851163ce70c900963f7c 100644 (file)
--- a/lib/Transforms/Scalar/InstructionCombining.cpp
+++ b/lib/Transforms/Scalar/InstructionCombining.cpp
@@ -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

diff --git a/lib/Transforms/Scalar/LICM.cpp b/lib/Transforms/Scalar/LICM.cpp
index 4940566b2a75ca46151c629425ff039fe9bc17e5..416c83e357e0b7d25fac22fcb44a34687c02543e 100644 (file)
--- a/lib/Transforms/Scalar/LICM.cpp
+++ b/lib/Transforms/Scalar/LICM.cpp
@@ -332,7 +332,7 @@ void LICM::visitLoadInst(LoadInst &LI) {
 ///
 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

diff --git a/lib/Transforms/Scalar/PiNodeInsertion.cpp b/lib/Transforms/Scalar/PiNodeInsertion.cpp
index 4f52051e61bfa26cced32fe2df40bcec0908bc26..21eaf23bd71b19cbd035f87c5da0daee6dbc3984 100644 (file)
--- a/lib/Transforms/Scalar/PiNodeInsertion.cpp
+++ b/lib/Transforms/Scalar/PiNodeInsertion.cpp
@@ -77,7 +77,7 @@ bool PiNodeInserter::runOnFunction(Function &F) {
           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)) &&

diff --git a/lib/VMCore/Type.cpp b/lib/VMCore/Type.cpp
index db47fdba74158c351d0857e16a65729b7c937615..eb1c99e9f4146068874c4efc27a076977ef768e4 100644 (file)
--- a/lib/VMCore/Type.cpp
+++ b/lib/VMCore/Type.cpp
@@ -13,7 +13,7 @@
 
 // DEBUG_MERGE_TYPES - Enable this #define to see how and when derived types are
 // created and later destroyed, all in an effort to make sure that there is only
-// a single cannonical version of a type.
+// a single canonical version of a type.
 //
 //#define DEBUG_MERGE_TYPES 1