From 707e37c6a6be7a87c953e45aa6a19ba35676b880 Mon Sep 17 00:00:00 2001 From: Owen Anderson Date: Tue, 29 May 2007 22:35:41 +0000 Subject: [PATCH] Add a place where I missed using the maximal set. Note that using the maximal set this way is _SLOW_. Somewhere down the line, I'll look at speeding it up. llvm-svn: 37345 --- lib/Transforms/Scalar/GVNPRE.cpp | 6 +++--- 1 file changed, 3 insertions(+), 3 deletions(-) diff --git a/lib/Transforms/Scalar/GVNPRE.cpp b/lib/Transforms/Scalar/GVNPRE.cpp index 41513a086a1..38fae0c3db0 100644 --- a/lib/Transforms/Scalar/GVNPRE.cpp +++ b/lib/Transforms/Scalar/GVNPRE.cpp @@ -390,7 +390,7 @@ bool GVNPRE::runOnFunction(Function &F) { std::set old (anticIn.begin(), anticIn.end()); if (BB->getTerminator()->getNumSuccessors() == 1) { - phi_translate(VN, anticIn, BB, anticOut); + phi_translate(VN, maximalSet, BB, anticOut); } else if (BB->getTerminator()->getNumSuccessors() > 1) { for (unsigned i = 0; i < BB->getTerminator()->getNumSuccessors(); ++i) { BasicBlock* currSucc = BB->getTerminator()->getSuccessor(i); @@ -439,7 +439,7 @@ bool GVNPRE::runOnFunction(Function &F) { iterations++; } - /* printf("Iterations: %d\n", iterations); + printf("Iterations: %d\n", iterations); for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I) { printf("Name: "); @@ -453,7 +453,7 @@ bool GVNPRE::runOnFunction(Function &F) { printf("\nANTIC_IN: \n"); dump(VN, anticipatedIn[I]); printf("\n"); - } */ + } return false; }