mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-17 21:29:20 +00:00
Fix bug: test/Regression/Other/2002-08-02-DomSetProblem.ll
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@3213 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
caa27e2814
commit
a915ef0fc0
@ -60,7 +60,7 @@ bool DominatorSet::runOnFunction(Function &F) {
|
||||
// in at least once. We are guaranteed to have this because we are
|
||||
// traversing the graph in DFO and have handled start nodes specially.
|
||||
//
|
||||
while (Doms[*PI].size() == 0) ++PI;
|
||||
while (Doms[*PI].empty()) ++PI;
|
||||
WorkingSet = Doms[*PI];
|
||||
|
||||
for (++PI; PI != PEnd; ++PI) { // Intersect all of the predecessor sets
|
||||
@ -79,6 +79,17 @@ bool DominatorSet::runOnFunction(Function &F) {
|
||||
WorkingSet.clear(); // Clear out the set for next iteration
|
||||
}
|
||||
} while (Changed);
|
||||
|
||||
// Every basic block in the function should at least dominate themselves, and
|
||||
// thus every basic block should have an entry in Doms. The one case where we
|
||||
// miss this is when a basic block is unreachable. To get these we now do an
|
||||
// extra pass adding self dominance info to the DomSet if the block doesn't
|
||||
// already have an entry.
|
||||
//
|
||||
for (Function::iterator I = F.begin(), E = F.end(); I != E; ++I)
|
||||
if (!Doms.count(I))
|
||||
Doms[I].insert(I);
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
|
Loading…
Reference in New Issue
Block a user