[llvm-commits] [poolalloc] r122870 - /poolalloc/trunk/lib/PoolAllocate/AllNodesHeuristic.cpp

[Arushi Aggarwal]

Author: aggarwa4
Date: Wed Jan  5 04:41:42 2011
New Revision: 122870

URL: http://llvm.org/viewvc/llvm-project?rev=122870&view=rev
Log:
This code seems to cause 254.gap to fail.  
Commenting while we investigate.

Modified:
    poolalloc/trunk/lib/PoolAllocate/AllNodesHeuristic.cpp

Modified: poolalloc/trunk/lib/PoolAllocate/AllNodesHeuristic.cpp
URL: http://llvm.org/viewvc/llvm-project/poolalloc/trunk/lib/PoolAllocate/AllNodesHeuristic.cpp?rev=122870&r1=122869&r2=122870&view=diff
==============================================================================
--- poolalloc/trunk/lib/PoolAllocate/AllNodesHeuristic.cpp (original)
+++ poolalloc/trunk/lib/PoolAllocate/AllNodesHeuristic.cpp Wed Jan  5 04:41:42 2011
@@ -72,7 +72,7 @@
   //
   // Remove those global nodes which we know will never be pool allocated.
   //
-  std::vector<const DSNode *> toRemove;
+  /*std::vector<const DSNode *> toRemove;
   for (DenseSet<const DSNode*>::iterator I = NodesFromGlobals.begin(),
          E = NodesFromGlobals.end(); I != E; ) {
     DenseSet<const DSNode*>::iterator Last = I; ++I;
@@ -91,7 +91,7 @@
   //
   for (unsigned index = 0; index < toRemove.size(); ++index) {
     NodesFromGlobals.erase(toRemove[index]);
-  }
+  }*/
 
   //
   // Now the fun part.  Find DSNodes in the local graph that correspond to