Tidy up indentation.
authorCameron Zwarich <zwarich@apple.com>
Sun, 2 Jan 2011 10:10:02 +0000 (10:10 +0000)
committerCameron Zwarich <zwarich@apple.com>
Sun, 2 Jan 2011 10:10:02 +0000 (10:10 +0000)
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@122688 91177308-0d34-0410-b5e6-96231b3b80d8

include/llvm/Analysis/DominatorInternals.h

index 658e75bd3ba33fcad05f9889141d2d2e63f22ffd..8f8a2715484fdc5ece3049ead2af5adc69fe500c 100644 (file)
@@ -207,9 +207,9 @@ void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT,
 
     // Step #2: Implicitly define the immediate dominator of vertices
     for (unsigned j = i; Buckets[j] != i; j = Buckets[j]) {
-       typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
-       typename GraphT::NodeType* U = Eval<GraphT>(DT, V);
-       DT.IDoms[V] = DT.Info[U].Semi < i ? U : W;
+      typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
+      typename GraphT::NodeType* U = Eval<GraphT>(DT, V);
+      DT.IDoms[V] = DT.Info[U].Semi < i ? U : W;
     }
 
     // Step #3: Calculate the semidominators of all vertices
@@ -246,8 +246,8 @@ void Calculate(DominatorTreeBase<typename GraphTraits<NodeT>::NodeType>& DT,
   if (N >= 1) {
     typename GraphT::NodeType* Root = DT.Vertex[1];
     for (unsigned j = 1; Buckets[j] != 1; j = Buckets[j]) {
-       typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
-       DT.IDoms[V] = Root;
+      typename GraphT::NodeType* V = DT.Vertex[Buckets[j]];
+      DT.IDoms[V] = Root;
     }
   }