[llvm-commits] [llvm] r122688 - /llvm/trunk/include/llvm/Analysis/DominatorInternals.h

[Cameron Zwarich]

Author: zwarich
Date: Sun Jan  2 04:10:02 2011
New Revision: 122688

URL: http://llvm.org/viewvc/llvm-project?rev=122688&view=rev
Log:
Tidy up indentation.

Modified:
    llvm/trunk/include/llvm/Analysis/DominatorInternals.h

Modified: llvm/trunk/include/llvm/Analysis/DominatorInternals.h
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/include/llvm/Analysis/DominatorInternals.h?rev=122688&r1=122687&r2=122688&view=diff
==============================================================================
--- llvm/trunk/include/llvm/Analysis/DominatorInternals.h (original)
+++ llvm/trunk/include/llvm/Analysis/DominatorInternals.h Sun Jan  2 04:10:02 2011
@@ -207,9 +207,9 @@
 
     // 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 @@
   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;
     }
   }