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

[John Criswell]

Author: criswell
Date: Mon Nov  3 10:09:30 2008
New Revision: 58616

URL: http://llvm.org/viewvc/llvm-project?rev=58616&view=rev
Log:
Formatting improvements.
No functionality changes.

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

Modified: poolalloc/trunk/lib/PoolAllocate/PoolAllocate.cpp
URL: http://llvm.org/viewvc/llvm-project/poolalloc/trunk/lib/PoolAllocate/PoolAllocate.cpp?rev=58616&r1=58615&r2=58616&view=diff

==============================================================================
--- poolalloc/trunk/lib/PoolAllocate/PoolAllocate.cpp (original)
+++ poolalloc/trunk/lib/PoolAllocate/PoolAllocate.cpp Mon Nov  3 10:09:30 2008
@@ -108,10 +108,15 @@
   if (M.begin() == M.end()) return false;
   CurModule = &M;
 
+  //
+  // Get references to the DSA information.  For SAFECode, we need Top-Down
+  // DSA.  For Automatic Pool Allocation only, we need Bottom-Up DSA.  In all
+  // cases, we need to use the Equivalence-Class version of DSA.
+  //
   if (SAFECodeEnabled)
-    Graphs = &getAnalysis<EQTDDataStructures>();   // folded inlined CBU graphs
-    else
-  Graphs = &getAnalysis<EquivBUDataStructures>();   // folded inlined CBU graphs
+    Graphs = &getAnalysis<EQTDDataStructures>();    
+  else
+    Graphs = &getAnalysis<EquivBUDataStructures>();
 
   CurHeuristic = Heuristic::create();
   CurHeuristic->Initialize(M, Graphs->getGlobalsGraph(), *this);
@@ -446,6 +451,7 @@
     for (std::map<const Value*, Value*>::iterator I = FI.ValueMap.begin(),
            E = FI.ValueMap.end(); I != E; ++I)
       ValueMap.insert(std::make_pair(I->first, I->second));
+
   for (Function::arg_iterator I = F.arg_begin();
        NI != New->arg_end(); ++I, ++NI) {
     ValueMap[I] = NI;