RPCS3/llvm-mirror
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm-mirror.git synced 2025-01-18 17:55:18 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Fix bug: Dominators/2003-05-12-UnreachableCode.ll

Browse Source 
llvm-svn: 6158
This commit is contained in:
Chris Lattner 2003-05-12 22:35:13 +00:00
parent 8f59261d07
commit 6a0cf6f937
1 changed files with 17 additions and 8 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

25
lib/VMCore/Dominators.cpp
View File

@ -51,16 +51,25 @@ void DominatorSet::calculateDominatorsFromBlock(BasicBlock *RootBB) {
if (PI != PEnd) { // Is there SOME predecessor?
// Loop until we get to a predecessor that has had it's dom set filled
// in at least once. We are guaranteed to have this because we are
// traversing the graph in DFO and have handled start nodes specially.
// traversing the graph in DFO and have handled start nodes specially,
// except when there are unreachable blocks.
//
while (Doms[*PI].empty()) ++PI;
WorkingSet = Doms[*PI];
while (PI != PEnd && Doms[*PI].empty()) ++PI;
if (PI != PEnd) { // Not unreachable code case?
WorkingSet = Doms[*PI];
for (++PI; PI != PEnd; ++PI) { // Intersect all of the predecessor sets
DomSetType &PredSet = Doms[*PI];
if (PredSet.size())
set_intersect(WorkingSet, PredSet);
}
// Intersect all of the predecessor sets
for (++PI; PI != PEnd; ++PI) {
DomSetType &PredSet = Doms[*PI];
if (PredSet.size())
set_intersect(WorkingSet, PredSet);
}
} else {
// Otherwise this block is unreachable. it doesn't really matter what
// we use for the dominator set for the node...
//
WorkingSet = Doms[Root];
}
} else if (BB != Root) {
// If this isn't the root basic block and it has no predecessors, it
// must be an unreachable block. Fib a bit by saying that the root node