Home
last modified time | relevance | path

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

/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DLazyCallGraph.cpp416 if (G->lookupRefSCC(E.getNode()) == &RC) in isParentOf()
438 auto *ChildRC = G->lookupRefSCC(E.getNode()); in isAncestorOf()
740 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchTrivialInternalEdgeToRef()
741 assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC."); in switchTrivialInternalEdgeToRef()
758 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchInternalEdgeToRef()
759 assert(G->lookupRefSCC(TargetN) == this && "Target must be in this RefSCC."); in switchInternalEdgeToRef()
934 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToCall()
935 assert(G->lookupRefSCC(TargetN) != this && in switchOutgoingEdgeToCall()
938 assert(G->lookupRefSCC(TargetN)->isDescendantOf(*this) && in switchOutgoingEdgeToCall()
955 assert(G->lookupRefSCC(SourceN) == this && "Source must be in this RefSCC."); in switchOutgoingEdgeToRef()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DLazyCallGraph.h990 RefSCC *lookupRefSCC(Node &N) const { in lookupRefSCC() function