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.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@37345 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Owen Anderson 2007-05-29 22:35:41 +00:00
parent c8ed9badfa
commit b502bdb604

View File

@ -390,7 +390,7 @@ bool GVNPRE::runOnFunction(Function &F) {
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 @@ 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;
}