41                                                      Edge::Kind EK) {  in insertEdgeInternal()
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
55   Edges[IndexMapI->second] = Edge();  in removeEdgeInternal()
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
62                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()
67   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
106                       LazyCallGraph::Edge::Call);  in populateSlow()
120             LazyCallGraph::Edge::Ref);  in populateSlow()
128               LazyCallGraph::Edge::Ref);  in populateSlow()
174     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
186       addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);  in LazyCallGraph()
203             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
260     for (Edge &E : **N)  in verify()
272       for (Edge &E : (*VisitingNode)->calls())  in verify()
289     for (Edge &E : N->calls())  in isParentOf()
311       for (Edge &E : N->calls()) {  in isAncestorOf()
369       for (Edge &E : *N) {  in verify()
396       for (Edge &E : **VisitingNode)  in verify()
415       for (Edge &E : *N)  in isParentOf()
437         for (Edge &E : *N) {  in isAncestorOf()
601     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
614     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
628         for (Edge &E : N->calls())  in switchInternalEdgeToCall()
657         for (Edge &E : *N) {  in switchInternalEdgeToCall()
690     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
725   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
746   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchTrivialInternalEdgeToRef()
767   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchInternalEdgeToRef()
944   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchOutgoingEdgeToCall()
965   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchOutgoingEdgeToRef()
977   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertInternalRefEdge()
985                                                Edge::Kind EK) {  in insertOutgoingEdge()
1037           for (Edge &E : *N)  in insertIncomingRefEdge()
1062           for (Edge &E : *N) {  in insertIncomingRefEdge()
1136   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertIncomingRefEdge()
1412     Edge &E = SourceN->Edges[Iterator->second];  in insertTrivialCallEdge()
1415     E.setKind(Edge::Call);  in insertTrivialCallEdge()
1418     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1443   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()
1482 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1515   for (Edge E : *N) {  in markDeadFunction()
1517       N->setEdgeKind(E.getNode(), Edge::Ref);  in markDeadFunction()
1530     for (Edge &E : **N) {  in removeDeadFunctions()
1544       for (Edge &E : **DeadN) {  in removeDeadFunctions()
1580 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,  in getEdgeKind()
1595           return LazyCallGraph::Edge::Kind::Call;  in getEdgeKind()
1617   return LazyCallGraph::Edge::Kind::Ref;  in getEdgeKind()
1637   Edge::Kind EK = getEdgeKind(OriginalFunction, NewFunction);  in addSplitFunction()
1640   for (Edge &E : *NewN) {  in addSplitFunction()
1642     if (EK == Edge::Kind::Call && E.isCall() && lookupSCC(EN) == OriginalC) {  in addSplitFunction()
1653     for (Edge &E : *NewN) {  in addSplitFunction()
1669         int InsertIndex = EK == Edge::Kind::Call ? NewRC->SCCIndices[OriginalC]  in addSplitFunction()
1721     OriginalN->insertEdgeInternal(NewN, Edge::Kind::Ref);  in addSplitRefRecursiveFunctions()
1725     for (Edge &E : *NewN) {  in addSplitRefRecursiveFunctions()
1769     assert(getEdgeKind(OriginalFunction, *F1) == Edge::Kind::Ref &&  in addSplitRefRecursiveFunctions()
1941   for (Edge &E : *this)  in buildRefSCCs()
2000   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
2047   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()