45   EdgeIndexMap.insert({&TargetN, Edges.size()});  in insertEdgeInternal()
46   Edges.emplace_back(TargetN, EK);  in insertEdgeInternal()
50   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);  in setEdgeKind()
58   Edges[IndexMapI->second] = Edge();  in removeEdgeInternal()
63 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()  argument
66   if (!EdgeIndexMap.insert({&N, Edges.size()}).second)  in addEdge()
70   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
74   assert(!Edges && "Must not have already populated the edges for this node!");  in populateSlow()
79   Edges = EdgeSequence();  in populateSlow()
108               addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee),  in populateSlow()
122     addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F),  in populateSlow()
130       addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F),  in populateSlow()
133   return *Edges;  in populateSlow()
173     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
188     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F),  in LazyCallGraph()
1387       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialCallEdge()
1390     Edge &E = SourceN->Edges[InsertResult.first->second];  in insertTrivialCallEdge()
1396     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1420       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialRefEdge()
1426   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()