[llvm-commits] [llvm] r83789 - /llvm/trunk/lib/Transforms/Scalar/LICM.cpp

[Torok Edwin]

Author: edwin
Date: Sun Oct 11 14:58:35 2009
New Revision: 83789

URL: http://llvm.org/viewvc/llvm-project?rev=83789&view=rev
Log:
Remove CleanupDbgInfo, instcombine does this and its not worth duplicating it
here.

Modified:
    llvm/trunk/lib/Transforms/Scalar/LICM.cpp

Modified: llvm/trunk/lib/Transforms/Scalar/LICM.cpp
URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Scalar/LICM.cpp?rev=83789&r1=83788&r2=83789&view=diff

==============================================================================
--- llvm/trunk/lib/Transforms/Scalar/LICM.cpp (original)
+++ llvm/trunk/lib/Transforms/Scalar/LICM.cpp Sun Oct 11 14:58:35 2009
@@ -141,10 +141,6 @@
     ///
     void HoistRegion(DomTreeNode *N);
 
-    // Cleanup debug information (remove stoppoints with no coressponding
-    // instructions).
-    void CleanupDbgInfoRegion(DomTreeNode *N);
-
     /// inSubLoop - Little predicate that returns true if the specified basic
     /// block is in a subloop of the current one, not the current one itself.
     ///
@@ -292,7 +288,6 @@
   //
   SinkRegion(DT->getNode(L->getHeader()));
   HoistRegion(DT->getNode(L->getHeader()));
-  CleanupDbgInfoRegion(DT->getNode(L->getHeader()));
 
   // Now that all loop invariants have been removed from the loop, promote any
   // memory references to scalars that we can...
@@ -344,36 +339,6 @@
   }
 }
 
-void LICM::CleanupDbgInfoRegion(DomTreeNode *N) {
-  BasicBlock *BB = N->getBlock();
-
-  // If this subregion is not in the top level loop at all, exit.
-  if (!CurLoop->contains(BB)) return;
-
-  // We are processing blocks in reverse dfo, so process children first...
-  const std::vector<DomTreeNode*> &Children = N->getChildren();
-  for (unsigned i = 0, e = Children.size(); i != e; ++i)
-    CleanupDbgInfoRegion(Children[i]);
-
-  // Only need to process the contents of this block if it is not part of a
-  // subloop (which would already have been processed).
-  if (inSubLoop(BB)) return;
-
-  // We modify the basicblock, so don't cache end()
-  for (BasicBlock::iterator I=BB->begin(); I != BB->end();) {
-    Instruction *Last = 0;
-    // Remove consecutive dbgstoppoints, leave only last
-    do {
-      if (Last) {
-        Last->eraseFromParent();
-        Changed = true;
-      }
-      Last = I;
-      ++I;
-    } while (isa<DbgStopPointInst>(Last) && isa<DbgStopPointInst>(I));
-  }
-}
-
 /// HoistRegion - Walk the specified region of the CFG (defined by all blocks
 /// dominated by the specified block, and that are in the current loop) in depth
 /// first order w.r.t the DominatorTree.  This allows us to visit definitions