42   EdgeIndexMap.try_emplace(&TargetN, Edges.size());  in insertEdgeInternal()
43   Edges.emplace_back(TargetN, EK);  in insertEdgeInternal()
47   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);  in setEdgeKind()
55   Edges[IndexMapI->second] = Edge();  in removeEdgeInternal()
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()  argument
63   if (!EdgeIndexMap.try_emplace(&N, Edges.size()).second)  in addEdge()
67   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
71   assert(!Edges && "Must not have already populated the edges for this node!");  in populateSlow()
76   Edges = EdgeSequence();  in populateSlow()
105               addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee),  in populateSlow()
119     addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F),  in populateSlow()
127       addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F),  in populateSlow()
130   return *Edges;  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()
202     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F),  in LazyCallGraph()
1164     ArrayRef<std::pair<Node *, Node *>> Edges) {  in removeInternalRefEdges()  argument
1182   for (auto [SourceN, TargetN] : Edges) {  in removeInternalRefEdges()
1194   if (llvm::all_of(Edges, [&](std::pair<Node *, Node *> E) {  in removeInternalRefEdges()
1409       SourceN->EdgeIndexMap.try_emplace(&TargetN, SourceN->Edges.size());  in insertTrivialCallEdge()
1412     Edge &E = SourceN->Edges[Iterator->second];  in insertTrivialCallEdge()
1418     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1436       SourceN->EdgeIndexMap.try_emplace(&TargetN, SourceN->Edges.size());  in insertTrivialRefEdge()
1443   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()