From: Eli Friedman <eli.friedman@gmail.com>
Date: Thu, 21 May 2009 21:08:47 +0000 (+0000)
Subject: Fix indentation.
X-Git-Url: http://plrg.eecs.uci.edu/git/?a=commitdiff_plain;h=e528fca6735158caefe5d6bb58dcbd0c108845c5;p=oota-llvm.git

Fix indentation.



git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@72227 91177308-0d34-0410-b5e6-96231b3b80d8
---

diff --git a/include/llvm/Analysis/Dominators.h b/include/llvm/Analysis/Dominators.h
index 0bb98ec6a88..b9ac2805c9f 100644
--- a/include/llvm/Analysis/Dominators.h
+++ b/include/llvm/Analysis/Dominators.h
@@ -249,26 +249,26 @@ protected:
          PE = GraphTraits<Inverse<N> >::child_end(NewBB); PI != PE; ++PI)
       PredBlocks.push_back(*PI);  
 
-      assert(!PredBlocks.empty() && "No predblocks??");
-
-      // The newly inserted basic block will dominate existing basic blocks iff the
-      // PredBlocks dominate all of the non-pred blocks.  If all predblocks dominate
-      // the non-pred blocks, then they all must be the same block!
-      //
-      bool NewBBDominatesNewBBSucc = true;
-      {
-        typename GraphT::NodeType* OnePred = PredBlocks[0];
-        size_t i = 1, e = PredBlocks.size();
-        for (i = 1; !DT.isReachableFromEntry(OnePred); ++i) {
-          assert(i != e && "Didn't find reachable pred?");
-          OnePred = PredBlocks[i];
-        }
+    assert(!PredBlocks.empty() && "No predblocks??");
+
+    // The newly inserted basic block will dominate existing basic blocks iff the
+    // PredBlocks dominate all of the non-pred blocks.  If all predblocks dominate
+    // the non-pred blocks, then they all must be the same block!
+    //
+    bool NewBBDominatesNewBBSucc = true;
+    {
+      typename GraphT::NodeType* OnePred = PredBlocks[0];
+      size_t i = 1, e = PredBlocks.size();
+      for (i = 1; !DT.isReachableFromEntry(OnePred); ++i) {
+        assert(i != e && "Didn't find reachable pred?");
+        OnePred = PredBlocks[i];
+      }
 
-        for (; i != e; ++i)
-          if (PredBlocks[i] != OnePred && DT.isReachableFromEntry(OnePred)) {
-            NewBBDominatesNewBBSucc = false;
-            break;
-          }
+      for (; i != e; ++i)
+        if (PredBlocks[i] != OnePred && DT.isReachableFromEntry(OnePred)) {
+          NewBBDominatesNewBBSucc = false;
+          break;
+        }
 
       if (NewBBDominatesNewBBSucc)
         for (typename GraphTraits<Inverse<N> >::ChildIteratorType PI =
@@ -288,7 +288,7 @@ protected:
       for (typename GraphTraits<Inverse<N> >::ChildIteratorType PI = 
            GraphTraits<Inverse<N> >::child_begin(NewBBSucc),
            E = GraphTraits<Inverse<N> >::child_end(NewBBSucc); PI != E; ++PI)
-         if (*PI != NewBB && !DT.dominates(NewBBSucc, *PI)) {
+        if (*PI != NewBB && !DT.dominates(NewBBSucc, *PI)) {
           NewBBDominatesNewBBSucc = false;
           break;
         }