maxjhandsome
/
llvm-project
forked from OSchip/llvm-project
1
0
Fork 0
Code Issues Pull Requests Packages Releases Wiki Activity

Never insert duplicate edges. 

llvm-svn: 41169
This commit is contained in:
Nick Lewycky 2007-08-18 23:18:03 +00:00
parent a0d49dac26
commit 5b5b1ab9e0
1 changed files with 16 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

28
llvm/lib/Transforms/Scalar/PredicateSimplifier.cpp
View File

@ -711,23 +711,27 @@ namespace {
++J;
}
if (J != E && J->To == n && J->Subtree->dominates(Subtree)) {
if (J != E && J->To == n) {
assert(J->Subtree->dominates(Subtree));
edge.LV = static_cast<LatticeVal>(J->LV & R);
assert(validPredicate(edge.LV) && "Invalid union of lattice values.");
if (edge.LV != J->LV) {
// We have to tighten any edge beneath our update.
for (iterator K = I; K->To == n; --K) {
if (K->Subtree->DominatedBy(Subtree)) {
LatticeVal LV = static_cast<LatticeVal>(K->LV & edge.LV);
assert(validPredicate(LV) && "Invalid union of lattice values");
K->LV = LV;
}
if (K == B) break;
if (edge.LV == J->LV)
return; // This update adds nothing new.
}
if (I != B) {
// We also have to tighten any edge beneath our update.
for (iterator K = I - 1; K->To == n; --K) {
if (K->Subtree->DominatedBy(Subtree)) {
LatticeVal LV = static_cast<LatticeVal>(K->LV & edge.LV);
assert(validPredicate(LV) && "Invalid union of lattice values");
K->LV = LV;
}
if (K == B) break;
}
}
}
// Insert new edge at Subtree if it isn't already there.
if (I == E || I->To != n || Subtree != I->Subtree)