diff options
Diffstat (limited to 'lib/Transforms/Scalar')
| -rw-r--r-- | lib/Transforms/Scalar/CorrelatedExprs.cpp | 6 | ||||
| -rw-r--r-- | lib/Transforms/Scalar/InstructionCombining.cpp | 2 | ||||
| -rw-r--r-- | lib/Transforms/Scalar/LICM.cpp | 2 | ||||
| -rw-r--r-- | lib/Transforms/Scalar/PiNodeInsertion.cpp | 2 |
4 files changed, 6 insertions, 6 deletions
diff --git a/lib/Transforms/Scalar/CorrelatedExprs.cpp b/lib/Transforms/Scalar/CorrelatedExprs.cpp index 3e8dc0c..9b90155 100644 --- 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 4dd3cdc..eddde0c 100644 --- 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 4940566..416c83e 100644 --- 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 4f52051..21eaf23 100644 --- 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)) && |