[llvm-commits] CVS: poolalloc/lib/PoolAllocate/PoolAllocate.cpp

[Chris Lattner]

Changes in directory poolalloc/lib/PoolAllocate:

PoolAllocate.cpp updated: 1.65 -> 1.66

---
Log message:

Tweak the pool allocation heuristic


---
Diffs of the changes:  (+2 -5)

Index: poolalloc/lib/PoolAllocate/PoolAllocate.cpp
diff -u poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.65 poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.66
--- poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.65	Fri Mar  5 00:55:30 2004
+++ poolalloc/lib/PoolAllocate/PoolAllocate.cpp	Fri Mar  5 09:09:56 2004
@@ -565,8 +565,10 @@
     case AllNodes: break;
     case NoNodes: ShouldPoolAlloc = false; break;
     case SmartCoallesceNodes:
+#if 0
       if ((*I)->isArray() && !(*I)->isNodeCompletelyFolded())
         ShouldPoolAlloc = false;
+#endif
       // fall through
     case CyclicNodes:
       if (!NodeExistsInCycle(*I))
@@ -691,11 +693,6 @@
         
           // Update the PoolDescriptors map
           PoolDescriptors.insert(std::make_pair(N, AI));
-        } else if (N->isArray() && !N->isNodeCompletelyFolded()) {
-          // We never pool allocate array nodes.
-          PoolDescriptors[N] =
-            Constant::getNullValue(PointerType::get(PoolDescType));
-          ++NumNonprofit;
         } else {
           // Otherwise the node is not self recursive.  If the node is not an
           // array, we can co-locate it with the pool of a predecessor node if