47   EdgeIndexMap.insert({&TargetN, Edges.size()});  in insertEdgeInternal()
48   Edges.emplace_back(TargetN, EK);  in insertEdgeInternal()
52   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);  in setEdgeKind()
60   Edges[IndexMapI->second] = Edge();  in removeEdgeInternal()
65 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,  in addEdge()  argument
68   if (!EdgeIndexMap.insert({&N, Edges.size()}).second)  in addEdge()
72   Edges.emplace_back(LazyCallGraph::Edge(N, EK));  in addEdge()
76   assert(!Edges && "Must not have already populated the edges for this node!");  in populateSlow()
81   Edges = EdgeSequence();  in populateSlow()
110               addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee),  in populateSlow()
124     addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F),  in populateSlow()
132       addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F),  in populateSlow()
135   return *Edges;  in populateSlow()
179     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);  in LazyCallGraph()
191       addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);  in LazyCallGraph()
207     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F),  in LazyCallGraph()
1423       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialCallEdge()
1426     Edge &E = SourceN->Edges[InsertResult.first->second];  in insertTrivialCallEdge()
1432     SourceN->Edges.emplace_back(TargetN, Edge::Call);  in insertTrivialCallEdge()
1450       SourceN->EdgeIndexMap.insert({&TargetN, SourceN->Edges.size()});  in insertTrivialRefEdge()
1456   SourceN->Edges.emplace_back(TargetN, Edge::Ref);  in insertTrivialRefEdge()