Home
last modified time | relevance | path

Searched refs:isAncestorOf (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h496 bool isAncestorOf(const SCC &C) const;
508 bool isDescendantOf(const SCC &C) const { return C.isAncestorOf(*this); } in isDescendantOf()
634 bool isAncestorOf(const RefSCC &RC) const;
648 return RC.isAncestorOf(*this); in isDescendantOf()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleImpl.h139 bool isAncestorOf(const DFSInfo &Other) const { in isAncestorOf() function
234 if (CandidateInfo.isAncestorOf(PredDFSInfo)) in run()
258 if (CandidateInfo.isAncestorOf(PredDFSInfo)) { in run()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCGSCCPassManager.cpp969 RC->isAncestorOf(TargetRC)) && "New ref edge is not trivial!"); in updateCGAndAnalysisManagerForPass()
982 RC->isAncestorOf(TargetRC)) && "New call edge is not trivial!"); in updateCGAndAnalysisManagerForPass()
1047 assert(RC->isAncestorOf(TargetRC) && in updateCGAndAnalysisManagerForPass()
1083 assert(RC->isAncestorOf(TargetRC) && in updateCGAndAnalysisManagerForPass()
H A DLazyCallGraph.cpp297 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const { in isAncestorOf() function in LazyCallGraph::SCC
422 bool LazyCallGraph::RefSCC::isAncestorOf(const RefSCC &RC) const { in isAncestorOf() function in LazyCallGraph::RefSCC
1403 assert(SourceC.isAncestorOf(TargetC) && in insertTrivialCallEdge()
1430 assert(SourceRC.isAncestorOf(TargetRC) && in insertTrivialRefEdge()