RPCSX/llvm
1
0
Fork 0
mirror of https://github.com/RPCSX/llvm.git synced 2024-12-11 21:57:55 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

simpler solution to iterator invalidation "problem" found

Browse Source 
by expensive checking.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@80695 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Chris Lattner 2009-09-01 18:13:40 +00:00
parent f41eaacee4
commit 17146b867f
1 changed files with 6 additions and 11 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

9
lib/Analysis/IPA/CallGraphSCCPass.cpp
View File

@ -145,12 +145,7 @@ void CGPassManager::RefreshCallGraph(std::vector<CallGraphNode*> &CurSCC,
// CGN with those actually in the function.
// Get the set of call sites currently in the function.
bool isLast = CGN->empty();
for (CallGraphNode::iterator I = CGN->begin(), E = CGN->end(), N; !isLast;){
// Take care not to use singular iterators.
N = I + 1;
isLast = N == E;
for (CallGraphNode::iterator I = CGN->begin(), E = CGN->end(); I != E; ){
// If this call site is null, then the function pass deleted the call
// entirely and the WeakVH nulled it out.
if (I->first == 0 ||
@ -172,7 +167,7 @@ void CGPassManager::RefreshCallGraph(std::vector<CallGraphNode*> &CurSCC,
assert(!CallSites.count(I->first) &&
"Call site occurs in node multiple times");
CallSites.insert(std::make_pair(I->first, I->second));
I = N;
++I;
}
// Loop over all of the instructions in the function, getting the callsites.