Author: resistor Date: Fri Jul 6 13:12:36 2007 New Revision: 37949 URL: http://llvm.org/viewvc/llvm-project?rev=37949&view=rev Log: Achieve what the incorrect test was trying to do by simply requiring that all critical edges be split before we begin.
Modified: llvm/trunk/lib/Transforms/Scalar/GVNPRE.cpp Modified: llvm/trunk/lib/Transforms/Scalar/GVNPRE.cpp URL: http://llvm.org/viewvc/llvm-project/llvm/trunk/lib/Transforms/Scalar/GVNPRE.cpp?rev=37949&r1=37948&r2=37949&view=diff ============================================================================== --- llvm/trunk/lib/Transforms/Scalar/GVNPRE.cpp (original) +++ llvm/trunk/lib/Transforms/Scalar/GVNPRE.cpp Fri Jul 6 13:12:36 2007 @@ -568,6 +568,7 @@ // 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 @@ // 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 _______________________________________________ llvm-commits mailing list llvm-commits@cs.uiuc.edu http://lists.cs.uiuc.edu/mailman/listinfo/llvm-commits