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()
173     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
189             LazyCallGraph::Edge::Ref);  in LazyCallGraph()
231     for (Edge &E : **N)  in verify()
242     for (Edge &E : N->calls())  in isParentOf()
264       for (Edge &E : N->calls()) {  in isAncestorOf()
324       for (Edge &E : *N) {  in verify()
345       for (Edge &E : *N)  in isParentOf()
367         for (Edge &E : *N) {  in isAncestorOf()
535     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
548     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
562         for (Edge &E : N->calls())  in switchInternalEdgeToCall()
591         for (Edge &E : *N) {  in switchInternalEdgeToCall()
624     SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
659   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchInternalEdgeToCall()
684   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchTrivialInternalEdgeToRef()
709   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchInternalEdgeToRef()
888   SourceN->setEdgeKind(TargetN, Edge::Call);  in switchOutgoingEdgeToCall()
910   SourceN->setEdgeKind(TargetN, Edge::Ref);  in switchOutgoingEdgeToRef()
923   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertInternalRefEdge()
932                                                Edge::Kind EK) {  in insertOutgoingEdge()
987           for (Edge &E : *N)  in insertIncomingRefEdge()
1012           for (Edge &E : *N) {  in insertIncomingRefEdge()
1086   SourceN->insertEdgeInternal(TargetN, Edge::Ref);  in insertIncomingRefEdge()
1390     Edge &E = SourceN->Edges[InsertResult.first->second];  in insertTrivialCallEdge()
1393     E.setKind(Edge::Call);  in insertTrivialCallEdge()
1396     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1426   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()
1463 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {  in insertEdge()
1695   for (Edge &E : *this)  in buildRefSCCs()
1734   for (LazyCallGraph::Edge &E : N.populate())  in printNode()
1782   for (LazyCallGraph::Edge &E : N.populate()) {  in printNodeDOT()