Fixed typos

lib/Fuzzer/FuzzerDictionary.h

@@ -119,7 +119,7 @@ class Dictionary {
 // otherwise returns false.
 bool ParseOneDictionaryEntry(const std::string &Str, Unit *U);
 // Parses the dictionary file, fills Units, returns true iff all lines
-// were parsed succesfully.
+// were parsed successfully.
 bool ParseDictionaryFile(const std::string &Text, std::vector<Unit> *Units);
 
 }  // namespace fuzzer

lib/Fuzzer/FuzzerMerge.cpp

@@ -293,13 +293,13 @@ void Fuzzer::CrashResistantMerge(const std::vector<std::string> &Args,
     auto ExitCode = ExecuteCommand(BaseCmd.first + " -merge_control_file=" +
                                    CFPath + " " + BaseCmd.second);
     if (!ExitCode) {
-      Printf("MERGE-OUTER: succesfull in %zd attempt(s)\n", i);
+      Printf("MERGE-OUTER: successful in %zd attempt(s)\n", i);
       Success = true;
       break;
     }
   }
   if (!Success) {
-    Printf("MERGE-OUTER: zero succesfull attempts, exiting\n");
+    Printf("MERGE-OUTER: zero successful attempts, exiting\n");
     exit(1);
   }
   // Read the control file and do the merge.

lib/IR/SafepointIRVerifier.cpp

@@ -15,7 +15,7 @@
 // safepoint semenatics.
 //
 // In its current form, this verify checks a property which is sufficient, but
-// not neccessary for correctness.  There are some cases where an unrelocated
+// not necessary for correctness.  There are some cases where an unrelocated
 // pointer can be used after the safepoint.  Consider this example:
 //
 //    a = ...
@@ -166,7 +166,7 @@ static void GatherDominatingDefs(const BasicBlock *BB,
     const auto &Defs = BlockMap[DTN->getBlock()]->Contribution;
     Result.insert(Defs.begin(), Defs.end());
     // If this block is 'Cleared', then nothing LiveIn to this block can be
-    // available after this block completes.  Note: This turns out to be 
+    // available after this block completes.  Note: This turns out to be
     // really important for reducing memory consuption of the initial available
     // sets and thus peak memory usage by this verifier.
     if (BlockMap[DTN->getBlock()]->Cleared)
@@ -195,7 +195,7 @@ static void TransferInstruction(const Instruction &I, bool &Cleared,
 static void TransferBlock(const BasicBlock *BB,
                           BasicBlockState &BBS, bool FirstPass) {
 
-  const DenseSet<const Value *> &AvailableIn = BBS.AvailableIn; 
+  const DenseSet<const Value *> &AvailableIn = BBS.AvailableIn;
   DenseSet<const Value *> &AvailableOut  = BBS.AvailableOut;
 
   if (BBS.Cleared) {
@@ -294,7 +294,7 @@ static enum BaseType getBaseType(const Value *Val) {
 static void Verify(const Function &F, const DominatorTree &DT) {
   SpecificBumpPtrAllocator<BasicBlockState> BSAllocator;
   DenseMap<const BasicBlock *, BasicBlockState *> BlockMap;
- 
+
   DEBUG(dbgs() << "Verifying gc pointers in function: " << F.getName() << "\n");
   if (PrintOnly)
     dbgs() << "Verifying gc pointers in function: " << F.getName() << "\n";

lib/Target/AMDGPU/AsmParser/AMDGPUAsmParser.cpp

@@ -3088,7 +3088,7 @@ OperandMatchResultTy AMDGPUAsmParser::parseHwreg(OperandVector &Operands) {
       if (Imm16Val < 0 || !isUInt<16>(Imm16Val)) {
         Error(S, "invalid immediate: only 16-bit values are legal");
         // Do not return error code, but create an imm operand anyway and proceed
-        // to the next operand, if any. That avoids unneccessary error messages.
+        // to the next operand, if any. That avoids unnecessary error messages.
       }
       break;
 
@@ -3377,7 +3377,7 @@ AMDGPUAsmParser::parseSendMsgOp(OperandVector &Operands) {
     if (Imm16Val < 0 || !isUInt<16>(Imm16Val)) {
       Error(S, "invalid immediate: only 16-bit values are legal");
       // Do not return error code, but create an imm operand anyway and proceed
-      // to the next operand, if any. That avoids unneccessary error messages.
+      // to the next operand, if any. That avoids unnecessary error messages.
     }
     break;
   case AsmToken::Identifier: {

lib/Target/AMDGPU/SIMachineScheduler.cpp

@@ -717,7 +717,7 @@ void SIScheduleBlockCreator::colorHighLatenciesGroups() {
         bool HasSubGraph;
         std::vector<int> SubGraph;
         // By construction (topological order), if SU and
-        // DAG->SUnits[j] are linked, DAG->SUnits[j] is neccessary
+        // DAG->SUnits[j] are linked, DAG->SUnits[j] is necessary
         // in the parent graph of SU.
 #ifndef NDEBUG
         SubGraph = DAG->GetTopo()->GetSubGraph(SU, DAG->SUnits[j],

test/Transforms/CorrelatedValuePropagation/select.ll

@@ -82,7 +82,7 @@ define i1 @test1(i32* %p, i1 %unknown) {
 
 next:
   %min = select i1 %unknown, i32 %pval, i32 5
-  ;; TODO: This pointless branch shouldn't be neccessary
+  ;; TODO: This pointless branch shouldn't be necessary
   br label %next2
 next2:
 ; CHECK-LABEL: next2:
@@ -105,7 +105,7 @@ define i1 @test2(i32* %p, i32 %qval, i1 %unknown) {
 
 next:
   %min = select i1 %unknown, i32 %pval, i32 %qval
-  ;; TODO: This pointless branch shouldn't be neccessary
+  ;; TODO: This pointless branch shouldn't be necessary
   br label %next2
 next2:
 ; CHECK-LABEL: next2
@@ -128,7 +128,7 @@ define i1 @test3(i32* %p, i32 %qval, i1 %unknown) {
 
 next:
   %min = select i1 %unknown, i32 %qval, i32 %pval
-  ;; TODO: This pointless branch shouldn't be neccessary
+  ;; TODO: This pointless branch shouldn't be necessary
   br label %next2
 next2:
 ; CHECK-LABEL: next2
@@ -154,7 +154,7 @@ define i1 @test4(i32* %p, i32 %qval, i1 %unknown) {
 
 next:
   %min = select i1 %unknown, double 1.0, double 0.0
-  ;; TODO: This pointless branch shouldn't be neccessary
+  ;; TODO: This pointless branch shouldn't be necessary
   br label %next2
 next2:
 ; CHECK-LABEL: next2
@@ -180,7 +180,7 @@ define i1 @test5(i32* %p, i1 %unknown) {
 next:
   %cond = icmp sgt i32 %pval, 0
   %min = select i1 %cond, i32 %pval, i32 5
-  ;; TODO: This pointless branch shouldn't be neccessary
+  ;; TODO: This pointless branch shouldn't be necessary
   br label %next2
 next2:
 ; CHECK-LABEL: next2:
@@ -203,7 +203,7 @@ define i1 @test6(i32* %p, i1 %unknown) {
 next:
   %cond = icmp ne i32 %pval, 254
   %sel = select i1 %cond, i32 %pval, i32 1
-  ;; TODO: This pointless branch shouldn't be neccessary
+  ;; TODO: This pointless branch shouldn't be necessary
   br label %next2
 next2:
 ; CHECK-LABEL: next2: