Index: llvm/lib/Transforms/Utils/LCSSA.cpp
===================================================================
--- llvm/lib/Transforms/Utils/LCSSA.cpp
+++ llvm/lib/Transforms/Utils/LCSSA.cpp
@@ -317,7 +317,7 @@
     // worklist, unless we visited it already.
     BasicBlock *IDomBB = DT.getNode(BB)->getIDom()->getBlock();
 
-    // Exit blocks can have an immediate dominator not beloinging to the
+    // Exit blocks can have an immediate dominator not belonging to the
     // loop. For an exit block to be immediately dominated by another block
     // outside the loop, it implies not all paths from that dominator, to the
     // exit block, go through the loop.
@@ -361,7 +361,7 @@
   // We want to avoid use-scanning leveraging dominance informations.
   // If a block doesn't dominate any of the loop exits, the none of the values
   // defined in the loop can be used outside.
-  // We compute the set of blocks fullfilling the conditions in advance
+  // We compute the set of blocks fulfilling the conditions in advance
   // walking the dominator tree upwards until we hit a loop header.
   computeBlocksDominatingExits(L, DT, ExitBlocks, BlocksDominatingExits);