SmallVector<std::pair<Node *, iterator>, 4> DFSStack;
/// \brief Set of entry nodes not-yet-processed into SCCs.
- SmallSetVector<Function *, 4> SCCEntryNodes;
+ SmallVector<Function *, 4> SCCEntryNodes;
/// \brief Stack of nodes the DFS has walked but not yet put into a SCC.
SmallVector<Node *, 4> PendingSCCStack;
for (auto &Entry : EntryNodes)
if (Function *F = Entry.dyn_cast<Function *>())
- SCCEntryNodes.insert(F);
+ SCCEntryNodes.push_back(F);
else
- SCCEntryNodes.insert(&Entry.get<Node *>()->getFunction());
+ SCCEntryNodes.push_back(&Entry.get<Node *>()->getFunction());
}
LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)
DFSStack.pop_back();
} else {
// If we've handled all candidate entry nodes to the SCC forest, we're done.
- if (SCCEntryNodes.empty())
- return nullptr;
+ do {
+ if (SCCEntryNodes.empty())
+ return nullptr;
- N = &get(*SCCEntryNodes.pop_back_val());
+ N = &get(*SCCEntryNodes.pop_back_val());
+ } while (N->DFSNumber != 0);
I = N->begin();
N->LowLink = N->DFSNumber = 1;
NextDFSNumber = 2;
assert(!SCCMap.count(&ChildN) &&
"Found a node with 0 DFS number but already in an SCC!");
ChildN.LowLink = ChildN.DFSNumber = NextDFSNumber++;
- SCCEntryNodes.remove(&ChildN.getFunction());
N = &ChildN;
I = ChildN.begin();
E = ChildN.end();