Lines Matching defs:Edges

42   EdgeIndexMap.try_emplace(&TargetN, Edges.size());
43   Edges.emplace_back(TargetN, EK);
47   Edges[EdgeIndexMap.find(&TargetN)->second].setKind(EK);
55   Edges[IndexMapI->second] = Edge();
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,
63   if (!EdgeIndexMap.try_emplace(&N, Edges.size()).second)
67   Edges.emplace_back(LazyCallGraph::Edge(N, EK));
71   assert(!Edges && "Must not have already populated the edges for this node!");
76   Edges = EdgeSequence();
105               addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*Callee),
119     addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(F),
127       addEdge(Edges->Edges, Edges->EdgeIndexMap, G->get(*F),
130   return *Edges;
174     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);
186       addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);
202     addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F),
942   // Edges between RefSCCs are the same regardless of call or ref, so we can
963   // Edges between RefSCCs are the same regardless of call or ref, so we can
1164     ArrayRef<std::pair<Node *, Node *>> Edges) {
1182   for (auto [SourceN, TargetN] : Edges) {
1194   if (llvm::all_of(Edges, [&](std::pair<Node *, Node *> E) {
1409       SourceN->EdgeIndexMap.try_emplace(&TargetN, SourceN->Edges.size());
1412     Edge &E = SourceN->Edges[Iterator->second];
1418     SourceN->Edges.emplace_back(TargetN, Edge::Call);
1436       SourceN->EdgeIndexMap.try_emplace(&TargetN, SourceN->Edges.size());
1443   SourceN->Edges.emplace_back(TargetN, Edge::Ref);
1777              "Edges between new functions must be ref edges");
1999   OS << "  Edges in function: " << N.getFunction().getName() << "\n";