Lines Matching refs:SCCMap
137 SCCMap(std::move(G.SCCMap)), LeafSCCs(std::move(G.LeafSCCs)),
150 SCCMap = std::move(G.SCCMap);
162 G->SCCMap[&N] = this;
184 assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC.");
185 assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC.");
194 assert(G->SCCMap.lookup(&CallerN) == this && "Caller must be in this SCC.");
196 SCC &CalleeC = *G->SCCMap.lookup(&CalleeN);
210 assert(G->SCCMap.lookup(&CalleeN) == this && "Callee must be in this SCC.");
212 SCC &CallerC = *G->SCCMap.lookup(&CallerN);
301 SCC &ChildC = *G->SCCMap.lookup(&ChildN);
305 G->SCCMap[N] = this;
312 SCC &ChildC = *G->SCCMap.lookup(&ChildN);
328 assert(G->SCCMap.lookup(&CallerN) == this &&
331 SCC &CalleeC = *G->SCCMap.lookup(&CalleeN);
343 SCC &OtherCalleeC = *G->SCCMap.lookup(&OtherCalleeN);
392 if (SCC *ChildSCC = G->SCCMap.lookup(&ChildN)) {
476 G->SCCMap.erase(N);
505 SCC &ChildSCC = *G->SCCMap.lookup(&ChildN);
532 assert(SCCMap.empty() && DFSStack.empty() &&
539 assert(SCCMap.empty() && DFSStack.empty() &&
600 SCC &ChildSCC = *SCCMap.lookup(&SCCChildN);
648 assert(!SCCMap.count(&ChildN) &&
