Home
last modified time | relevance | path

Searched refs:ParentSCCs (Results 1 – 2 of 2) sorted by relevance

/external/llvm/lib/Analysis/
DLazyCallGraph.cpp173 for (const SCC *ParentC : AncestorC->ParentSCCs) in isDescendantOf()
202 CalleeC.ParentSCCs.insert(this); in insertOutgoingEdge()
294 for (SCC *ParentC : C->ParentSCCs) in insertIncomingEdge()
296 ParentSCCs.insert(ParentC); in insertIncomingEdge()
297 C->ParentSCCs.clear(); in insertIncomingEdge()
303 ChildC.ParentSCCs.erase(C); in insertIncomingEdge()
314 ChildC.ParentSCCs.insert(this); in insertIncomingEdge()
359 bool Removed = CalleeC.ParentSCCs.erase(this); in removeInterSCCEdge()
366 if (CalleeC.ParentSCCs.empty()) in removeInterSCCEdge()
407 ChildSCC->ParentSCCs.erase(this); in internalDFS()
[all …]
/external/llvm/include/llvm/Analysis/
DLazyCallGraph.h215 SmallPtrSet<SCC *, 1> ParentSCCs; variable
234 parent_iterator parent_begin() const { return ParentSCCs.begin(); } in parent_begin()
235 parent_iterator parent_end() const { return ParentSCCs.end(); } in parent_end()
249 return ParentSCCs.count(const_cast<SCC *>(&C)); in isChildOf()