mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-01-20 12:31:40 +00:00
Never insert duplicate edges.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41169 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
af5cbc82bb
commit
c721223f73
@ -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)
|
||||
|
Loading…
x
Reference in New Issue
Block a user