mirror of
https://github.com/RPCSX/llvm.git
synced 2024-11-26 05:00:26 +00:00
Graphs that are part of equivalence sets can be multi-function SCC's
themselves. Make sure to update DSInfo correctly. This fixes a testcase reduced from Prolangs-C++/objects git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@17439 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
caa35bc0b6
commit
f1de30acce
@ -214,10 +214,15 @@ void PA::EquivClassGraphs::buildIndirectFunctionSets(Module &M) {
|
||||
DSGraph &CBUGraph = CBU->getDSGraph(*F);
|
||||
if (!GraphsMerged.insert(&CBUGraph).second)
|
||||
continue;
|
||||
assert(FG == 0 && "Remerged a graph?");
|
||||
|
||||
// Record the "folded" graph for the function.
|
||||
FG = &MergedG;
|
||||
for (DSGraph::ReturnNodesTy::iterator
|
||||
I = CBUGraph.getReturnNodes().begin(),
|
||||
E = CBUGraph.getReturnNodes().end();
|
||||
I != E; ++I) {
|
||||
assert(DSInfo[I->first] == 0 && "Graph already exists for Fn!");
|
||||
DSInfo[I->first] = &MergedG;
|
||||
}
|
||||
|
||||
// Clone this member of the equivalence class into MergedG.
|
||||
DSGraph::NodeMapTy NodeMap;
|
||||
|
Loading…
Reference in New Issue
Block a user