[llvm-commits] [poolalloc] r122738 - /poolalloc/trunk/lib/DSA/BottomUpClosure.cpp

[Arushi Aggarwal]

Author: aggarwa4
Date: Mon Jan  3 00:08:39 2011
New Revision: 122738

URL: http://llvm.org/viewvc/llvm-project?rev=122738&view=rev
Log:
Remove dead code. 
No functionality changes.

Modified:
    poolalloc/trunk/lib/DSA/BottomUpClosure.cpp

Modified: poolalloc/trunk/lib/DSA/BottomUpClosure.cpp
URL: http://llvm.org/viewvc/llvm-project/poolalloc/trunk/lib/DSA/BottomUpClosure.cpp?rev=122738&r1=122737&r2=122738&view=diff
==============================================================================
--- poolalloc/trunk/lib/DSA/BottomUpClosure.cpp (original)
+++ poolalloc/trunk/lib/DSA/BottomUpClosure.cpp Mon Jan  3 00:08:39 2011
@@ -404,17 +404,11 @@
     }
     return MyID;
   } else {
-    //
-    // SCCFunctions - Keep track of the functions in the current SCC
-    //
-    std::vector<const Function*> SCCFunctions;
-
     unsigned SCCSize = 1;
     const Function *NF = Stack.back();
     if(NF != F)
       ValMap[NF] = ~0U;
     DSGraph* SCCGraph = getDSGraph(*NF);
-    SCCFunctions.push_back(NF);
 
     //
     // First thing first: collapse all of the DSGraphs into a single graph for
@@ -424,7 +418,6 @@
     while (NF != F) {
       Stack.pop_back();
       NF = Stack.back();
-      SCCFunctions.push_back(NF);
       if(NF != F)
         ValMap[NF] = ~0U;
 
@@ -467,8 +460,6 @@
     } else {
       ValMap[F] = ~0U;
     }
-
-    // We never have to revisit "SCC" processed functions...
     return MyID;
   }