diff --git a/lib/Analysis/IPA/Andersens.cpp b/lib/Analysis/IPA/Andersens.cpp
index 22f151b0953..345b8bd52b3 100644
--- a/lib/Analysis/IPA/Andersens.cpp
+++ b/lib/Analysis/IPA/Andersens.cpp
@@ -2347,15 +2347,15 @@ void Andersens::SolveConstraints() {
         unsigned DestVar = *bi;
         unsigned Rep = FindNode(DestVar);
 
-	// If we ended up with this node as our destination, or we've already
-	// got an edge for the representative, delete the current edge.
-	if (Rep == CurrNodeIndex ||
-	    (Rep != DestVar && NewEdges.test(Rep))) {
-	    ToErase.set(DestVar);
-	    continue;
-	}
+        // If we ended up with this node as our destination, or we've already
+        // got an edge for the representative, delete the current edge.
+        if (Rep == CurrNodeIndex ||
+            (Rep != DestVar && NewEdges.test(Rep))) {
+          ToErase.set(DestVar);
+          continue;
+        }
         
-	std::pair<unsigned,unsigned> edge(CurrNodeIndex,Rep);
+        std::pair<unsigned,unsigned> edge(CurrNodeIndex,Rep);
         
         // This is where we do lazy cycle detection.
         // If this is a cycle candidate (equal points-to sets and this
diff --git a/lib/CodeGen/VirtRegMap.cpp b/lib/CodeGen/VirtRegMap.cpp
index 227ac0c7388..48e5a16a509 100644
--- a/lib/CodeGen/VirtRegMap.cpp
+++ b/lib/CodeGen/VirtRegMap.cpp
@@ -779,7 +779,7 @@ namespace {
 ///     xorl  %edi, %eax
 ///     movl  %eax, -32(%ebp)
 ///     movl  -36(%ebp), %eax
-///	orl   %eax, -32(%ebp)
+///     orl   %eax, -32(%ebp)
 /// ==>
 ///     xorl  %edi, %eax
 ///     orl   -36(%ebp), %eax