45 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN,  in insertEdgeInternal()
51 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
55 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) {  in removeEdgeInternal()
65 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
66                     DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,  in addEdge()
67                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()
72   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
75 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() {  in populateSlow()
111                       LazyCallGraph::Edge::Call);  in populateSlow()
125             LazyCallGraph::Edge::Ref);  in populateSlow()
133               LazyCallGraph::Edge::Ref);  in populateSlow()
138 void LazyCallGraph::Node::replaceFunction(Function &NewF) {  in replaceFunction()
144 LLVM_DUMP_METHOD void LazyCallGraph::Node::dump() const {  in dump()
159 LazyCallGraph::LazyCallGraph(  in LazyCallGraph()  function in LazyCallGraph
208             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
212 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)  in LazyCallGraph()  function in LazyCallGraph
220 bool LazyCallGraph::invalidate(Module &, const PreservedAnalyses &PA,  in invalidate()
228 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) {  in operator =()
240 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {  in dump()
246 void LazyCallGraph::SCC::verify() {  in verify()
282 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const {  in isParentOf()
295 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const {  in isAncestorOf()
299   LazyCallGraph &G = *OuterRefSCC->G;  in isAncestorOf()
329 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {}  in RefSCC()
332 LLVM_DUMP_METHOD void LazyCallGraph::RefSCC::dump() const {  in dump()
338 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()
586 LazyCallGraph::RefSCC::switchInternalEdgeToCall(  in switchInternalEdgeToCall()
733 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN,  in switchTrivialInternalEdgeToRef()
753 iterator_range<LazyCallGraph::RefSCC::iterator>
754 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToRef()
938 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,  in switchOutgoingEdgeToCall()
959 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,  in switchOutgoingEdgeToRef()
980 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,  in insertInternalRefEdge()
992 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()
1011 SmallVector<LazyCallGraph::RefSCC *, 1>
1012 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()
1153 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()
1170 SmallVector<LazyCallGraph::RefSCC *, 1>
1171 LazyCallGraph::RefSCC::removeInternalRefEdge(Node &SourceN,  in removeInternalRefEdge()
1407 void LazyCallGraph::RefSCC::insertTrivialCallEdge(Node &SourceN,  in insertTrivialCallEdge()
1436 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {  in insertTrivialRefEdge()
1459 void LazyCallGraph::RefSCC::replaceNodeFunction(Node &N, Function &NewF) {  in replaceNodeFunction()
1489 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1496 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) {  in removeEdge()
1505 void LazyCallGraph::removeDeadFunction(Function &F) {  in removeDeadFunction()
1560 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,  in getEdgeKind()
1575           return LazyCallGraph::Edge::Kind::Call;  in getEdgeKind()
1590   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()
1597   return LazyCallGraph::Edge::Kind::Ref;  in getEdgeKind()
1600 void LazyCallGraph::addSplitFunction(Function &OriginalFunction,  in addSplitFunction()
1679 void LazyCallGraph::addSplitRefRecursiveFunctions(  in addSplitRefRecursiveFunctions()
1763 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {  in insertInto()
1767 void LazyCallGraph::updateGraphPtrs() {  in updateGraphPtrs()
1777 LazyCallGraph::Node &LazyCallGraph::initNode(Function &F) {  in initNode()
1787 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin,  in buildGenericSCCs()
1881 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()
1915 void LazyCallGraph::buildRefSCCs() {  in buildRefSCCs()
1953 void LazyCallGraph::visitReferences(SmallVectorImpl<Constant *> &Worklist,  in visitReferences()
1980 static void printNode(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNode()
1982   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
1989 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &C) {  in printSCC()
1992   for (LazyCallGraph::Node &N : C)  in printSCC()
1996 static void printRefSCC(raw_ostream &OS, LazyCallGraph::RefSCC &C) {  in printRefSCC()
1999   for (LazyCallGraph::SCC &InnerC : C)  in printRefSCC()
2007   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()
2016   for (LazyCallGraph::RefSCC &C : G.postorder_ref_sccs())  in run()
2025 static void printNodeDOT(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNodeDOT()
2029   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()
2042   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()