git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@256480
91177308-0d34-0410-b5e6-
96231b3b80d8
assert(CalleeC.isDescendantOf(*this) &&
"Callee must be a descendant of the Caller.");
assert(CalleeC.isDescendantOf(*this) &&
"Callee must be a descendant of the Caller.");
- // The only change required is to add this SCC to the parent set of the callee.
+ // The only change required is to add this SCC to the parent set of the
+ // callee.
CalleeC.ParentSCCs.insert(this);
}
CalleeC.ParentSCCs.insert(this);
}
}
SmallVector<LazyCallGraph::SCC *, 1>
}
SmallVector<LazyCallGraph::SCC *, 1>
-LazyCallGraph::SCC::removeIntraSCCEdge(Node &CallerN,
- Node &CalleeN) {
+LazyCallGraph::SCC::removeIntraSCCEdge(Node &CallerN, Node &CalleeN) {
// First remove it from the node.
CallerN.removeEdgeInternal(CalleeN.getFunction());
// First remove it from the node.
CallerN.removeEdgeInternal(CalleeN.getFunction());
// the leaf SCC list.
if (!IsLeafSCC && !ResultSCCs.empty())
G->LeafSCCs.erase(std::remove(G->LeafSCCs.begin(), G->LeafSCCs.end(), this),
// the leaf SCC list.
if (!IsLeafSCC && !ResultSCCs.empty())
G->LeafSCCs.erase(std::remove(G->LeafSCCs.begin(), G->LeafSCCs.end(), this),
// Return the new list of SCCs.
return ResultSCCs;
// Return the new list of SCCs.
return ResultSCCs;