44                                                      Edge::Kind EK) {  in insertEdgeInternal()
49 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {  in setEdgeKind()
58   Edges[IndexMapI->second] = Edge();  in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()
65                     LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {  in addEdge()
70   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
109                       LazyCallGraph::Edge::Call);  in populateSlow()
123             LazyCallGraph::Edge::Ref);  in populateSlow()
131               LazyCallGraph::Edge::Ref);  in populateSlow()
177     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
189       addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);  in LazyCallGraph()
206             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
257     for (Edge &E : **N)  in verify()
269       for (Edge &E : (*VisitingNode)->calls())  in verify()
286     for (Edge &E : N->calls())  in isParentOf()
308       for (Edge &E : N->calls()) {  in isAncestorOf()
368       for (Edge &E : *N) {  in verify()
395       for (Edge &E : **VisitingNode)  in verify()
414       for (Edge &E : *N)  in isParentOf()
436         for (Edge &E : *N) {  in isAncestorOf()
602     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
615     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
629         for (Edge &E : N->calls())  in switchInternalEdgeToCall()
658         for (Edge &E : *N) {  in switchInternalEdgeToCall()
691     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
726   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
749   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchTrivialInternalEdgeToRef()
772   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchInternalEdgeToRef()
951   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchOutgoingEdgeToCall()
972   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchOutgoingEdgeToRef()
984   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertInternalRefEdge()
992                                                Edge::Kind EK) {  in insertOutgoingEdge()
1044           for (Edge &E : *N)  in insertIncomingRefEdge()
1069           for (Edge &E : *N) {  in insertIncomingRefEdge()
1143   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertIncomingRefEdge()
1425     Edge &E = SourceN->Edges[InsertResult.first->second];  in insertTrivialCallEdge()
1428     E.setKind(Edge::Call);  in insertTrivialCallEdge()
1431     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1455   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()
1488 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1572 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,  in getEdgeKind()
1587           return LazyCallGraph::Edge::Kind::Call;  in getEdgeKind()
1609   return LazyCallGraph::Edge::Kind::Ref;  in getEdgeKind()
1629   Edge::Kind EK = getEdgeKind(OriginalFunction, NewFunction);  in addSplitFunction()
1632   for (Edge &E : *NewN) {  in addSplitFunction()
1634     if (EK == Edge::Kind::Call && E.isCall() && lookupSCC(EN) == OriginalC) {  in addSplitFunction()
1645     for (Edge &E : *NewN) {  in addSplitFunction()
1661         int InsertIndex = EK == Edge::Kind::Call ? NewRC->SCCIndices[OriginalC]  in addSplitFunction()
1713     OriginalN->insertEdgeInternal(NewN, Edge::Kind::Ref);  in addSplitRefRecursiveFunctions()
1717     for (Edge &E : *NewN) {  in addSplitRefRecursiveFunctions()
1761     assert(getEdgeKind(OriginalFunction, *F1) == Edge::Kind::Ref &&  in addSplitRefRecursiveFunctions()
1935   for (Edge &E : *this)  in buildRefSCCs()
1971   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
2018   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()