mirror of
https://github.com/RPCS3/llvm-mirror.git
synced 2025-04-17 15:10:07 +00:00
Complicate Chris's simplification, avoiding complaints
about singular iterators when building with expensive checks turned on. llvm-svn: 80757
This commit is contained in:
parent
3b7954c9bf
commit
b970a46d06
@ -178,7 +178,11 @@ void CGPassManager::RefreshCallGraph(std::vector<CallGraphNode*> &CurSCC,
|
||||
"CallGraphSCCPass did not update the CallGraph correctly!");
|
||||
|
||||
// Just remove the edge from the set of callees.
|
||||
bool wasLast = I + 1 == E;
|
||||
CGN->removeCallEdge(I);
|
||||
if (wasLast)
|
||||
// I is now a singular iterator, do not compare with E.
|
||||
break;
|
||||
E = CGN->end();
|
||||
continue;
|
||||
}
|
||||
|
Loading…
x
Reference in New Issue
Block a user