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()
154 LazyCallGraph::LazyCallGraph(Module &M, TargetLibraryInfo &TLI) {  in LazyCallGraph()  function in LazyCallGraph
189             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
193 LazyCallGraph::LazyCallGraph(LazyCallGraph &&G)  in LazyCallGraph()  function in LazyCallGraph
201 LazyCallGraph &LazyCallGraph::operator=(LazyCallGraph &&G) {  in operator =()
213 LLVM_DUMP_METHOD void LazyCallGraph::SCC::dump() const {  in dump()
219 void LazyCallGraph::SCC::verify() {  in verify()
237 bool LazyCallGraph::SCC::isParentOf(const SCC &C) const {  in isParentOf()
250 bool LazyCallGraph::SCC::isAncestorOf(const SCC &TargetC) const {  in isAncestorOf()
254   LazyCallGraph &G = *OuterRefSCC->G;  in isAncestorOf()
284 LazyCallGraph::RefSCC::RefSCC(LazyCallGraph &G) : G(&G) {}  in RefSCC()
287 LLVM_DUMP_METHOD void LazyCallGraph::RefSCC::dump() const {  in dump()
293 void LazyCallGraph::RefSCC::verify() {  in verify()
338 bool LazyCallGraph::RefSCC::isParentOf(const RefSCC &RC) const {  in isParentOf()
352 bool LazyCallGraph::RefSCC::isAncestorOf(const RefSCC &RC) const {  in isAncestorOf()
516 LazyCallGraph::RefSCC::switchInternalEdgeToCall(  in switchInternalEdgeToCall()
665 void LazyCallGraph::RefSCC::switchTrivialInternalEdgeToRef(Node &SourceN,  in switchTrivialInternalEdgeToRef()
687 iterator_range<LazyCallGraph::RefSCC::iterator>
688 LazyCallGraph::RefSCC::switchInternalEdgeToRef(Node &SourceN, Node &TargetN) {  in switchInternalEdgeToRef()
874 void LazyCallGraph::RefSCC::switchOutgoingEdgeToCall(Node &SourceN,  in switchOutgoingEdgeToCall()
896 void LazyCallGraph::RefSCC::switchOutgoingEdgeToRef(Node &SourceN,  in switchOutgoingEdgeToRef()
918 void LazyCallGraph::RefSCC::insertInternalRefEdge(Node &SourceN,  in insertInternalRefEdge()
931 void LazyCallGraph::RefSCC::insertOutgoingEdge(Node &SourceN, Node &TargetN,  in insertOutgoingEdge()
951 SmallVector<LazyCallGraph::RefSCC *, 1>
952 LazyCallGraph::RefSCC::insertIncomingRefEdge(Node &SourceN, Node &TargetN) {  in insertIncomingRefEdge()
1095 void LazyCallGraph::RefSCC::removeOutgoingEdge(Node &SourceN, Node &TargetN) {  in removeOutgoingEdge()
1114 SmallVector<LazyCallGraph::RefSCC *, 1>
1115 LazyCallGraph::RefSCC::removeInternalRefEdge(Node &SourceN,  in removeInternalRefEdge()
1351 void LazyCallGraph::RefSCC::handleTrivialEdgeInsertion(Node &SourceN,  in handleTrivialEdgeInsertion()
1368 void LazyCallGraph::RefSCC::insertTrivialCallEdge(Node &SourceN,  in insertTrivialCallEdge()
1403 void LazyCallGraph::RefSCC::insertTrivialRefEdge(Node &SourceN, Node &TargetN) {  in insertTrivialRefEdge()
1432 void LazyCallGraph::RefSCC::replaceNodeFunction(Node &N, Function &NewF) {  in replaceNodeFunction()
1463 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1470 void LazyCallGraph::removeEdge(Node &SourceN, Node &TargetN) {  in removeEdge()
1479 void LazyCallGraph::removeDeadFunction(Function &F) {  in removeDeadFunction()
1543 LazyCallGraph::Node &LazyCallGraph::insertInto(Function &F, Node *&MappedN) {  in insertInto()
1547 void LazyCallGraph::updateGraphPtrs() {  in updateGraphPtrs()
1559 void LazyCallGraph::buildGenericSCCs(RootsT &&Roots, GetBeginT &&GetBegin,  in buildGenericSCCs()
1653 void LazyCallGraph::buildSCCs(RefSCC &RC, node_stack_range Nodes) {  in buildSCCs()
1687 void LazyCallGraph::buildRefSCCs() {  in buildRefSCCs()
1732 static void printNode(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNode()
1734   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
1741 static void printSCC(raw_ostream &OS, LazyCallGraph::SCC &C) {  in printSCC()
1745   for (LazyCallGraph::Node &N : C)  in printSCC()
1749 static void printRefSCC(raw_ostream &OS, LazyCallGraph::RefSCC &C) {  in printRefSCC()
1753   for (LazyCallGraph::SCC &InnerC : C)  in printRefSCC()
1761   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()
1770   for (LazyCallGraph::RefSCC &C : G.postorder_ref_sccs())  in run()
1779 static void printNodeDOT(raw_ostream &OS, LazyCallGraph::Node &N) {  in printNodeDOT()
1782   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()
1795   LazyCallGraph &G = AM.getResult<LazyCallGraphAnalysis>(M);  in run()