Fix spell-o's

llvm-svn: 8431

llvm/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

llvm/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
 ...

llvm/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();
 

llvm/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

llvm/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'.
 //

llvm/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

llvm/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

llvm/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)) &&

llvm/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