[llvm] r293148 - test commit

[Taewook Oh via llvm-commits]

Author: twoh
Date: Wed Jan 25 22:32:40 2017
New Revision: 293148

URL: http://llvm.org/viewvc/llvm-project?rev=293148&view=rev
Log:
test commit


Modified:
    llvm/trunk/lib/Transforms/Scalar/ADCE.cpp

Modified: llvm/trunk/lib/Transforms/Scalar/ADCE.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Scalar/ADCE.cpp?rev=293148&r1=293147&r2=293148&view=diff
==============================================================================
--- llvm/trunk/lib/Transforms/Scalar/ADCE.cpp (original)
+++ llvm/trunk/lib/Transforms/Scalar/ADCE.cpp Wed Jan 25 22:32:40 2017
@@ -234,7 +234,7 @@ void AggressiveDeadCodeElimination::init
         return Iter != end() && Iter->second;
       }
     } State;
-    
+
     State.reserve(F.size());
     // Iterate over blocks in depth-first pre-order and
     // treat all edges to a block already seen as loop back edges
@@ -594,12 +594,12 @@ void AggressiveDeadCodeElimination::upda
 
 // reverse top-sort order
 void AggressiveDeadCodeElimination::computeReversePostOrder() {
-  
+
   // This provides a post-order numbering of the reverse conrtol flow graph
   // Note that it is incomplete in the presence of infinite loops but we don't
   // need numbers blocks which don't reach the end of the functions since
   // all branches in those blocks are forced live.
-  
+
   // For each block without successors, extend the DFS from the bloack
   // backward through the graph
   SmallPtrSet<BasicBlock*, 16> Visited;
@@ -681,3 +681,4 @@ INITIALIZE_PASS_END(ADCELegacyPass, "adc
                     false, false)
 
 FunctionPass *llvm::createAggressiveDCEPass() { return new ADCELegacyPass(); }
+