43 void LazyCallGraph::EdgeSequence::insertEdgeInternal(Node &TargetN,  in insertEdgeInternal()
49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
53 bool LazyCallGraph::EdgeSequence::removeEdgeInternal(Node &TargetN) {  in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
64                     DenseMap<LazyCallGraph::Node *, int> &EdgeIndexMap,  in addEdge()
65                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()
70   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
73 LazyCallGraph::EdgeSequence &LazyCallGraph::Node::populateSlow() {  in populateSlow()
109                       LazyCallGraph::Edge::Call);  in populateSlow()
123             LazyCallGraph::Edge::Ref);  in populateSlow()
131               LazyCallGraph::Edge::Ref);  in populateSlow()
136 void LazyCallGraph::Node::replaceFunction(Function &NewF) {  in replaceFunction()
142 LLVM_DUMP_METHOD void LazyCallGraph::Node::dump() const {  in dump()
157 LazyCallGraph::LazyCallGraph(  in LazyCallGraph()  function in LazyCallGraph
206             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
210 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)  in LazyCallGraph()  function in LazyCallGraph
218 bool LazyCallGraph::invalidate(Module &, const PreservedAnalyses &PA,  in invalidate()
227 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) {  in operator =()
239 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {  in dump()
245 void LazyCallGraph::SCC::verify() {  in verify()
281 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const {  in isParentOf()
294 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const {  in isAncestorOf()
298   LazyCallGraph &G = *OuterRefSCC->G;  in isAncestorOf()
328 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {}  in RefSCC()
331 LLVM_DUMP_METHOD void LazyCallGraph::RefSCC::dump() const {  in dump()
337 void LazyCallGraph::RefSCC::verify() {  in verify()
407 bool LazyCallGraph::RefSCC::isParentOf(const RefSCC &RC) const {  in isParentOf()
421 bool LazyCallGraph::RefSCC::isAncestorOf(const RefSCC &RC) const {  in isAncestorOf()
585 LazyCallGraph::RefSCC::switchInternalEdgeToCall(  in switchInternalEdgeToCall()
732 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN,  in switchTrivialInternalEdgeToRef()
752 iterator_range<LazyCallGraph::RefSCC::iterator>
753 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToRef()
937 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,  in switchOutgoingEdgeToCall()
958 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,  in switchOutgoingEdgeToRef()
979 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,  in insertInternalRefEdge()
991 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()
1010 SmallVector<LazyCallGraph::RefSCC *, 1>
1011 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()
1152 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()
1169 SmallVector<LazyCallGraph::RefSCC *, 1>
1170 LazyCallGraph::RefSCC::removeInternalRefEdge(Node &SourceN,  in removeInternalRefEdge()
1406 void LazyCallGraph::RefSCC::insertTrivialCallEdge(Node &SourceN,  in insertTrivialCallEdge()
1435 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {  in insertTrivialRefEdge()
1458 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()
1572 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,  in getEdgeKind()
1587           return LazyCallGraph::Edge::Kind::Call;  in getEdgeKind()
1602   LazyCallGraph::visitReferences(Worklist, Visited, [&](Function &F) {  in getEdgeKind()
1609   return LazyCallGraph::Edge::Kind::Ref;  in getEdgeKind()
1612 void LazyCallGraph::addSplitFunction(Function &OriginalFunction,  in addSplitFunction()
1691 void LazyCallGraph::addSplitRefRecursiveFunctions(  in addSplitRefRecursiveFunctions()
1775 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {  in insertInto()
1779 void LazyCallGraph::updateGraphPtrs() {  in updateGraphPtrs()
1789 LazyCallGraph::Node &LazyCallGraph::initNode(Function &F) {  in initNode()
1799 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin,  in buildGenericSCCs()
1893 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()
1927 void LazyCallGraph::buildRefSCCs() {  in buildRefSCCs()
1969 static void printNode(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNode()
1971   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
1978 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &C) {  in printSCC()
1981   for (LazyCallGraph::Node &N : C)  in printSCC()
1985 static void printRefSCC(raw_ostream &OS, LazyCallGraph::RefSCC &C) {  in printRefSCC()
1988   for (LazyCallGraph::SCC &InnerC : C)  in printRefSCC()
1996   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()
2005   for (LazyCallGraph::RefSCC &C : G.postorder_ref_sccs())  in run()
2014 static void printNodeDOT(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNodeDOT()
2018   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()
2031   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()