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
diff --git a/llvm/lib/Transforms/Scalar/GVNPRE.cpp b/llvm/lib/Transforms/Scalar/GVNPRE.cpp
index 41513a0..38fae0c 100644
--- a/llvm/lib/Transforms/Scalar/GVNPRE.cpp
+++ b/llvm/lib/Transforms/Scalar/GVNPRE.cpp
@@ -390,7 +390,7 @@
std::set<Expression> 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 @@
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 @@
printf("\nANTIC_IN: \n");
dump(VN, anticipatedIn[I]);
printf("\n");
- } */
+ }
return false;
}