40 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN,  in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
50 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) {  in removeEdgeInternal()
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
61                     DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,  in addEdge()
62                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()
67   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
70 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() {  in populateSlow()
106                       LazyCallGraph::Edge::Call);  in populateSlow()
120             LazyCallGraph::Edge::Ref);  in populateSlow()
128               LazyCallGraph::Edge::Ref);  in populateSlow()
133 void LazyCallGraph::Node::replaceFunction(Function &NewF) {  in replaceFunction()
139 LLVM_DUMP_METHOD void LazyCallGraph::Node::dump() const {  in dump()
154 LazyCallGraph::LazyCallGraph(  in LazyCallGraph()  function in LazyCallGraph
203             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
207 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)  in LazyCallGraph()  function in LazyCallGraph
215 void LazyCallGraph::verify() {  in verify()
222 bool LazyCallGraph::invalidate(Module &, const PreservedAnalyses &PA,  in invalidate()
230 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) {  in operator =()
242 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {  in dump()
248 void LazyCallGraph::SCC::verify() {  in verify()
284 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const {  in isParentOf()
297 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const {  in isAncestorOf()
301   LazyCallGraph &G = *OuterRefSCC->G;  in isAncestorOf()
331 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {}  in RefSCC()
334 LLVM_DUMP_METHOD void LazyCallGraph::RefSCC::dump() const {  in dump()
340 void LazyCallGraph::RefSCC::verify() {  in verify()
408 bool LazyCallGraph::RefSCC::isParentOf(const RefSCC &RC) const {  in isParentOf()
422 bool LazyCallGraph::RefSCC::isAncestorOf(const RefSCC &RC) const {  in isAncestorOf()
584 bool LazyCallGraph::RefSCC::switchInternalEdgeToCall(  in switchInternalEdgeToCall()
731 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN,  in switchTrivialInternalEdgeToRef()
749 iterator_range<LazyCallGraph::RefSCC::iterator>
750 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToRef()
930 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,  in switchOutgoingEdgeToCall()
951 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,  in switchOutgoingEdgeToRef()
972 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,  in insertInternalRefEdge()
984 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()
1003 SmallVector<LazyCallGraph::RefSCC *, 1>
1004 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()
1145 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()
1162 SmallVector<LazyCallGraph::RefSCC *, 1>
1163 LazyCallGraph::RefSCC::removeInternalRefEdges(  in removeInternalRefEdges()
1393 void LazyCallGraph::RefSCC::insertTrivialCallEdge(Node &SourceN,  in insertTrivialCallEdge()
1422 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {  in insertTrivialRefEdge()
1446 void LazyCallGraph::RefSCC::replaceNodeFunction(Node &N, Function &NewF) {  in replaceNodeFunction()
1482 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1489 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) {  in removeEdge()
1498 void LazyCallGraph::markDeadFunction(Function &F) {  in markDeadFunction()
1521 void LazyCallGraph::removeDeadFunctions(ArrayRef<Function *> DeadFs) {  in removeDeadFunctions()
1580 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,  in getEdgeKind()
1595           return LazyCallGraph::Edge::Kind::Call;  in getEdgeKind()
1610   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()
1617   return LazyCallGraph::Edge::Kind::Ref;  in getEdgeKind()
1620 void LazyCallGraph::addSplitFunction(Function &OriginalFunction,  in addSplitFunction()
1699 void LazyCallGraph::addSplitRefRecursiveFunctions(  in addSplitRefRecursiveFunctions()
1783 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {  in insertInto()
1787 void LazyCallGraph::updateGraphPtrs() {  in updateGraphPtrs()
1797 LazyCallGraph::Node &LazyCallGraph::initNode(Function &F) {  in initNode()
1807 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin,  in buildGenericSCCs()
1899 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()
1933 void LazyCallGraph::buildRefSCCs() {  in buildRefSCCs()
1971 void LazyCallGraph::visitReferences(SmallVectorImpl<Constant *> &Worklist,  in visitReferences()
1998 static void printNode(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNode()
2000   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
2007 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &C) {  in printSCC()
2010   for (LazyCallGraph::Node &N : C)  in printSCC()
2014 static void printRefSCC(raw_ostream &OS, LazyCallGraph::RefSCC &C) {  in printRefSCC()
2017   for (LazyCallGraph::SCC &InnerC : C)  in printRefSCC()
2025   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()
2034   for (LazyCallGraph::RefSCC &C : G.postorder_ref_sccs())  in run()
2043 static void printNodeDOT(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNodeDOT()
2047   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()
2060   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()