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()
252     for (Edge &E : **N)  in verify()
264       for (Edge &E : (*VisitingNode)->calls())  in verify()
281     for (Edge &E : N->calls())  in isParentOf()
303       for (Edge &E : N->calls()) {  in isAncestorOf()
361       for (Edge &E : *N) {  in verify()
388       for (Edge &E : **VisitingNode)  in verify()
407       for (Edge &E : *N)  in isParentOf()
429         for (Edge &E : *N) {  in isAncestorOf()
593     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
606     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
620         for (Edge &E : N->calls())  in switchInternalEdgeToCall()
649         for (Edge &E : *N) {  in switchInternalEdgeToCall()
682     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
717   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
738   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchTrivialInternalEdgeToRef()
759   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchInternalEdgeToRef()
936   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchOutgoingEdgeToCall()
957   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchOutgoingEdgeToRef()
969   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertInternalRefEdge()
977                                                Edge::Kind EK) {  in insertOutgoingEdge()
1029           for (Edge &E : *N)  in insertIncomingRefEdge()
1054           for (Edge &E : *N) {  in insertIncomingRefEdge()
1128   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertIncomingRefEdge()
1408     Edge &E = SourceN->Edges[Iterator->second];  in insertTrivialCallEdge()
1411     E.setKind(Edge::Call);  in insertTrivialCallEdge()
1414     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1439   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()
1478 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1569 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,  in getEdgeKind()
1584           return LazyCallGraph::Edge::Kind::Call;  in getEdgeKind()
1606   return LazyCallGraph::Edge::Kind::Ref;  in getEdgeKind()
1626   Edge::Kind EK = getEdgeKind(OriginalFunction, NewFunction);  in addSplitFunction()
1629   for (Edge &E : *NewN) {  in addSplitFunction()
1631     if (EK == Edge::Kind::Call && E.isCall() && lookupSCC(EN) == OriginalC) {  in addSplitFunction()
1642     for (Edge &E : *NewN) {  in addSplitFunction()
1658         int InsertIndex = EK == Edge::Kind::Call ? NewRC->SCCIndices[OriginalC]  in addSplitFunction()
1710     OriginalN->insertEdgeInternal(NewN, Edge::Kind::Ref);  in addSplitRefRecursiveFunctions()
1714     for (Edge &E : *NewN) {  in addSplitRefRecursiveFunctions()
1758     assert(getEdgeKind(OriginalFunction, *F1) == Edge::Kind::Ref &&  in addSplitRefRecursiveFunctions()
1930   for (Edge &E : *this)  in buildRefSCCs()
1989   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
2036   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()