Spell `necessary' correctly.

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

4 files changed, 4 insertions, 4 deletions

diff --git a/lib/Transforms/Utils/BasicBlockUtils.cpp b/lib/Transforms/Utils/BasicBlockUtils.cpp
index 33834277b7..0f0f14aeba 100644
--- a/lib/Transforms/Utils/BasicBlockUtils.cpp
+++ b/lib/Transforms/Utils/BasicBlockUtils.cpp
@@ -23,7 +23,7 @@ void ReplaceInstWithValue(BasicBlock::InstListType &BIL,
 
   std::string OldName = I.getName();
   
-  // Delete the unneccesary instruction now...
+  // Delete the unnecessary instruction now...
   BI = BIL.erase(BI);
 
   // Make sure to propagate a name if there is one already...
diff --git a/lib/Transforms/Utils/LoopSimplify.cpp b/lib/Transforms/Utils/LoopSimplify.cpp
index 7576b01130..9507941f6c 100644
--- a/lib/Transforms/Utils/LoopSimplify.cpp
+++ b/lib/Transforms/Utils/LoopSimplify.cpp
@@ -13,7 +13,7 @@
 // as store-sinking that is built into LICM.
 //
 // Note that the simplifycfg pass will clean up blocks which are split out but
-// end up being unneccesary, so usage of this pass does not neccesarily
+// end up being unnecessary, so usage of this pass does not neccesarily
 // pessimize generated code.
 //
 //===----------------------------------------------------------------------===//
diff --git a/lib/Transforms/Utils/LowerAllocations.cpp b/lib/Transforms/Utils/LowerAllocations.cpp
index 53584d9d3e..8d75ae8e8c 100644
--- a/lib/Transforms/Utils/LowerAllocations.cpp
+++ b/lib/Transforms/Utils/LowerAllocations.cpp
@@ -97,7 +97,7 @@ bool LowerAllocations::runOnBasicBlock(BasicBlock &BB) {
       if (MI->getNumOperands() && Size == 1) {
         MallocArg = MI->getOperand(0);         // Operand * 1 = Operand
       } else if (MI->getNumOperands()) {
-        // Multiply it by the array size if neccesary...
+        // Multiply it by the array size if necessary...
         MallocArg = BinaryOperator::create(Instruction::Mul, MI->getOperand(0),
                                            MallocArg, "", I);
       }
diff --git a/lib/Transforms/Utils/PromoteMemoryToRegister.cpp b/lib/Transforms/Utils/PromoteMemoryToRegister.cpp
index 85acce66e1..d22451c6a1 100644
--- a/lib/Transforms/Utils/PromoteMemoryToRegister.cpp
+++ b/lib/Transforms/Utils/PromoteMemoryToRegister.cpp
@@ -202,7 +202,7 @@ bool PromoteMem2Reg::QueuePhiNode(BasicBlock *BB, unsigned AllocaNo) {
   // correct number of entries for their predecessors.
   Value *NullVal = Constant::getNullValue(PN->getType());
 
-  // This is neccesary because adding incoming values to the PHI node adds uses
+  // This is necessary because adding incoming values to the PHI node adds uses
   // to the basic blocks being used, which can invalidate the predecessor
   // iterator!
   std::vector<BasicBlock*> Preds(pred_begin(BB), pred_end(BB));