46                                                      Edge::Kind EK) {  in insertEdgeInternal()
51 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
60   Edges[IndexMapI->second] = Edge();  in removeEdgeInternal()
65 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
67                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()
72   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
111                       LazyCallGraph::Edge::Call);  in populateSlow()
125             LazyCallGraph::Edge::Ref);  in populateSlow()
133               LazyCallGraph::Edge::Ref);  in populateSlow()
179     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
191       addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);  in LazyCallGraph()
208             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
258     for (Edge &E : **N)  in verify()
270       for (Edge &E : (*VisitingNode)->calls())  in verify()
287     for (Edge &E : N->calls())  in isParentOf()
309       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()
603     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
616     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
630         for (Edge &E : N->calls())  in switchInternalEdgeToCall()
659         for (Edge &E : *N) {  in switchInternalEdgeToCall()
692     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
727   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
750   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchTrivialInternalEdgeToRef()
773   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchInternalEdgeToRef()
952   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchOutgoingEdgeToCall()
973   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchOutgoingEdgeToRef()
985   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertInternalRefEdge()
993                                                Edge::Kind EK) {  in insertOutgoingEdge()
1045           for (Edge &E : *N)  in insertIncomingRefEdge()
1070           for (Edge &E : *N) {  in insertIncomingRefEdge()
1144   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertIncomingRefEdge()
1426     Edge &E = SourceN->Edges[InsertResult.first->second];  in insertTrivialCallEdge()
1429     E.setKind(Edge::Call);  in insertTrivialCallEdge()
1432     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1456   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()
1489 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1560 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,  in getEdgeKind()
1575           return LazyCallGraph::Edge::Kind::Call;  in getEdgeKind()
1597   return LazyCallGraph::Edge::Kind::Ref;  in getEdgeKind()
1617   Edge::Kind EK = getEdgeKind(OriginalFunction, NewFunction);  in addSplitFunction()
1620   for (Edge &E : *NewN) {  in addSplitFunction()
1622     if (EK == Edge::Kind::Call && E.isCall() && lookupSCC(EN) == OriginalC) {  in addSplitFunction()
1633     for (Edge &E : *NewN) {  in addSplitFunction()
1649         int InsertIndex = EK == Edge::Kind::Call ? NewRC->SCCIndices[OriginalC]  in addSplitFunction()
1701     OriginalN->insertEdgeInternal(NewN, Edge::Kind::Ref);  in addSplitRefRecursiveFunctions()
1705     for (Edge &E : *NewN) {  in addSplitRefRecursiveFunctions()
1749     assert(getEdgeKind(OriginalFunction, *F1) == Edge::Kind::Ref &&  in addSplitRefRecursiveFunctions()
1923   for (Edge &E : *this)  in buildRefSCCs()
1982   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
2029   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()