Achieve what the incorrect test was trying to do by simply requiring that all

critical edges be split before we begin.

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37949 91177308-0d34-0410-b5e6-96231b3b80d8

diff --git a/lib/Transforms/Scalar/GVNPRE.cpp b/lib/Transforms/Scalar/GVNPRE.cpp
index 5fe4f0a3eebecc196079f50a8ad28d489d296d74..bedfb5d2707085a91b4f2f0d2d23c91084b5ab1e 100644 (file)
--- a/lib/Transforms/Scalar/GVNPRE.cpp
+++ b/lib/Transforms/Scalar/GVNPRE.cpp
@@ -568,6 +568,7 @@ namespace {
     // This transformation requires dominator postdominator info
     virtual void getAnalysisUsage(AnalysisUsage &AU) const {
       AU.setPreservesCFG();
+      AU.addRequiredID(BreakCriticalEdgesID);
       AU.addRequired<UnifyFunctionExitNodes>();
       AU.addRequired<DominatorTree>();
     }
@@ -1761,12 +1762,6 @@ bool GVNPRE::runOnFunction(Function &F) {
   // This phase calculates the AVAIL_OUT and ANTIC_IN sets
   buildsets(F);
   
-  for (Function::iterator FI = F.begin(), FE = F.end(); FI != FE; ++FI) {
-    DOUT << "ANTIC_IN: " << FI->getName() << "\n";
-    dump(anticipatedIn[FI]);
-    DOUT << "\n\n";
-  }
-  
   // Phase 2: Insert
   // This phase inserts values to make partially redundant values
   // fully redundant