diff options
| author | Chris Lattner <sabre@nondot.org> | 2010-04-17 07:17:19 +0000 |
|---|---|---|
| committer | Chris Lattner <sabre@nondot.org> | 2010-04-17 07:17:19 +0000 |
| commit | 7c4f14bf903be829d6a5aa00c1d1f9d0fc63f6e7 (patch) | |
| tree | 1e8cf9987e66c4a0982b3bb2b27799c6e1edd34d /llvm/lib | |
| parent | 5fdb57cc100c89bb55cc706a749fcf1c361b99f9 (diff) | |
| download | bcm5719-llvm-7c4f14bf903be829d6a5aa00c1d1f9d0fc63f6e7.tar.gz bcm5719-llvm-7c4f14bf903be829d6a5aa00c1d1f9d0fc63f6e7.zip | |
reenable r101565, removing a problematic assertion.
CGSCC can delete nodes in regions of the callgraph that
have already been visited. If new CG nodes are allocated
to the same pointer, we shouldn't abort, just handle it
correctly by assigning a new number. This should restore
stability by removing invalidated pointers that *will* be
reused from the densemap in the iterator.
llvm-svn: 101628
Diffstat (limited to 'llvm/lib')
| -rw-r--r-- | llvm/lib/Analysis/IPA/CallGraphSCCPass.cpp | 2 |
1 files changed, 0 insertions, 2 deletions
diff --git a/llvm/lib/Analysis/IPA/CallGraphSCCPass.cpp b/llvm/lib/Analysis/IPA/CallGraphSCCPass.cpp index cf4c0d2549c..7b73c5dffce 100644 --- a/llvm/lib/Analysis/IPA/CallGraphSCCPass.cpp +++ b/llvm/lib/Analysis/IPA/CallGraphSCCPass.cpp @@ -420,10 +420,8 @@ void CallGraphSCC::ReplaceNode(CallGraphNode *Old, CallGraphNode *New) { // Update the active scc_iterator so that it doesn't contain dangling // pointers to the old CallGraphNode. -#if 0 scc_iterator<CallGraph*> *CGI = (scc_iterator<CallGraph*>*)Context; CGI->ReplaceNode(Old, New); -#endif } |
