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

[Chris Lattner]

Changes in directory llvm-poolalloc/lib/PoolAllocate:

Heuristic.cpp updated: 1.8 -> 1.9
PointerCompress.cpp updated: 1.57 -> 1.58
PoolAllocate.cpp updated: 1.111 -> 1.112
---
Log message:

convert code to use normal ilist iterators instead of compat iterators


---
Diffs of the changes:  (+6 -6)

 Heuristic.cpp       |    2 +-
 PointerCompress.cpp |    8 ++++----
 PoolAllocate.cpp    |    2 +-
 3 files changed, 6 insertions(+), 6 deletions(-)


Index: llvm-poolalloc/lib/PoolAllocate/Heuristic.cpp
diff -u llvm-poolalloc/lib/PoolAllocate/Heuristic.cpp:1.8 llvm-poolalloc/lib/PoolAllocate/Heuristic.cpp:1.9
--- llvm-poolalloc/lib/PoolAllocate/Heuristic.cpp:1.8	Wed Mar  2 20:38:52 2005
+++ llvm-poolalloc/lib/PoolAllocate/Heuristic.cpp	Wed Mar 16 16:46:45 2005
@@ -146,7 +146,7 @@
     std::set<const DSNode*> ReachableFromMemory;
     for (DSGraph::node_iterator I = G.node_begin(), E = G.node_end();
          I != E; ++I) {
-      DSNode *N = *I;
+      DSNode *N = I;
       // Ignore nodes that are just globals and not arrays.
       /*
       if (N->isArray() || N->isHeapNode() || N->isAllocaNode() ||


Index: llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp
diff -u llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp:1.57 llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp:1.58
--- llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp:1.57	Mon Mar 14 22:46:30 2005
+++ llvm-poolalloc/lib/PoolAllocate/PointerCompress.cpp	Wed Mar 16 16:46:45 2005
@@ -1119,12 +1119,12 @@
   // globals graph, and if so, if it is compressed.
   for (DSGraph::node_iterator I = DSG.node_begin(), E = DSG.node_end();
        I != E;++I)
-    if (GlobalsGraphNodeMapping.count(*I)) {
+    if (GlobalsGraphNodeMapping.count(I)) {
       // If it is a global pool, set up the pool descriptor appropriately.
-      DSNode *GGN = GlobalsGraphNodeMapping[*I].getNode();
+      DSNode *GGN = GlobalsGraphNodeMapping[I].getNode();
       if (CompressedGlobalPools.count(GGN)) {
-        Pools.insert(*I);
-        PreassignedPools[*I] = CompressedGlobalPools[GGN];
+        Pools.insert(I);
+        PreassignedPools[I] = CompressedGlobalPools[GGN];
       }
     }
 }


Index: llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp
diff -u llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.111 llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.112
--- llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp:1.111	Mon Mar 14 22:46:30 2005
+++ llvm-poolalloc/lib/PoolAllocate/PoolAllocate.cpp	Wed Mar 16 16:46:45 2005
@@ -555,7 +555,7 @@
   // ones to the NodesToPA vector.
   for (DSGraph::node_iterator I = G.node_begin(), E = G.node_end(); I != E;++I){
     // We only need to make a pool if there is a heap object in it...
-    DSNode *N = *I;
+    DSNode *N = I;
     if (N->isHeapNode())
       if (GlobalsGraphNodeMapping.count(N)) {
         // If it is a global pool, set up the pool descriptor appropriately.