42 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN,  in insertEdgeInternal()
48 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
52 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) {  in removeEdgeInternal()
62 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
63                     DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,  in addEdge()
64                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()
69   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
72 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() {  in populateSlow()
108                       LazyCallGraph::Edge::Call);  in populateSlow()
122             LazyCallGraph::Edge::Ref);  in populateSlow()
130               LazyCallGraph::Edge::Ref);  in populateSlow()
135 void LazyCallGraph::Node::replaceFunction(Function &NewF) {  in replaceFunction()
141 LLVM_DUMP_METHOD void LazyCallGraph::Node::dump() const {  in dump()
156 LazyCallGraph::LazyCallGraph(  in LazyCallGraph()  function in LazyCallGraph
205             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
209 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)  in LazyCallGraph()  function in LazyCallGraph
217 bool LazyCallGraph::invalidate(Module &, const PreservedAnalyses &PA,  in invalidate()
226 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) {  in operator =()
238 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {  in dump()
244 void LazyCallGraph::SCC::verify() {  in verify()
262 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const {  in isParentOf()
275 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const {  in isAncestorOf()
279   LazyCallGraph &G = *OuterRefSCC->G;  in isAncestorOf()
309 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {}  in RefSCC()
312 LLVM_DUMP_METHOD void LazyCallGraph::RefSCC::dump() const {  in dump()
318 void LazyCallGraph::RefSCC::verify() {  in verify()
363 bool LazyCallGraph::RefSCC::isParentOf(const RefSCC &RC) const {  in isParentOf()
377 bool LazyCallGraph::RefSCC::isAncestorOf(const RefSCC &RC) const {  in isAncestorOf()
541 LazyCallGraph::RefSCC::switchInternalEdgeToCall(  in switchInternalEdgeToCall()
690 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN,  in switchTrivialInternalEdgeToRef()
712 iterator_range<LazyCallGraph::RefSCC::iterator>
713 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToRef()
899 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,  in switchOutgoingEdgeToCall()
921 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,  in switchOutgoingEdgeToRef()
943 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,  in insertInternalRefEdge()
956 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()
976 SmallVector<LazyCallGraph::RefSCC *, 1>
977 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()
1120 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()
1139 SmallVector<LazyCallGraph::RefSCC *, 1>
1140 LazyCallGraph::RefSCC::removeInternalRefEdge(Node &SourceN,  in removeInternalRefEdge()
1376 void LazyCallGraph::RefSCC::handleTrivialEdgeInsertion(Node &SourceN,  in handleTrivialEdgeInsertion()
1393 void LazyCallGraph::RefSCC::insertTrivialCallEdge(Node &SourceN,  in insertTrivialCallEdge()
1428 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {  in insertTrivialRefEdge()
1457 void LazyCallGraph::RefSCC::replaceNodeFunction(Node &N, Function &NewF) {  in replaceNodeFunction()
1488 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1495 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) {  in removeEdge()
1504 void LazyCallGraph::removeDeadFunction(Function &F) {  in removeDeadFunction()
1568 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {  in insertInto()
1572 void LazyCallGraph::updateGraphPtrs() {  in updateGraphPtrs()
1582 LazyCallGraph::Node &LazyCallGraph::initNode(Node &N, LazyCallGraph::SCC &C) {  in initNode()
1593 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin,  in buildGenericSCCs()
1687 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()
1721 void LazyCallGraph::buildRefSCCs() {  in buildRefSCCs()
1763 static void printNode(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNode()
1765   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
1772 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &C) {  in printSCC()
1775   for (LazyCallGraph::Node &N : C)  in printSCC()
1779 static void printRefSCC(raw_ostream &OS, LazyCallGraph::RefSCC &C) {  in printRefSCC()
1782   for (LazyCallGraph::SCC &InnerC : C)  in printRefSCC()
1790   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()
1799   for (LazyCallGraph::RefSCC &C : G.postorder_ref_sccs())  in run()
1808 static void printNodeDOT(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNodeDOT()
1812   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()
1825   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()