Lines Matching refs:Edge
41 Edge::Kind EK) {
46 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {
55 Edges[IndexMapI->second] = Edge();
60 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,
62 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {
67 Edges.emplace_back(LazyCallGraph::Edge(N, EK));
106 LazyCallGraph::Edge::Call);
120 LazyCallGraph::Edge::Ref);
128 LazyCallGraph::Edge::Ref);
174 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);
186 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);
203 LazyCallGraph::Edge::Ref);
260 for (Edge &E : **N)
272 for (Edge &E : (*VisitingNode)->calls())
289 for (Edge &E : N->calls())
311 for (Edge &E : N->calls()) {
369 for (Edge &E : *N) {
375 "Edge between SCCs violates post-order relationship.");
396 for (Edge &E : **VisitingNode)
415 for (Edge &E : *N)
437 for (Edge &E : *N) {
601 SourceN->setEdgeKind(TargetN, Edge::Call);
614 SourceN->setEdgeKind(TargetN, Edge::Call);
628 for (Edge &E : N->calls())
657 for (Edge &E : *N) {
690 SourceN->setEdgeKind(TargetN, Edge::Call);
725 SourceN->setEdgeKind(TargetN, Edge::Call);
746 SourceN->setEdgeKind(TargetN, Edge::Ref);
767 SourceN->setEdgeKind(TargetN, Edge::Ref);
944 SourceN->setEdgeKind(TargetN, Edge::Call);
965 SourceN->setEdgeKind(TargetN, Edge::Ref);
977 SourceN->insertEdgeInternal(TargetN, Edge::Ref);
985 Edge::Kind EK) {
1037 for (Edge &E : *N)
1062 for (Edge &E : *N) {
1136 SourceN->insertEdgeInternal(TargetN, Edge::Ref);
1412 Edge &E = SourceN->Edges[Iterator->second];
1415 E.setKind(Edge::Call);
1418 SourceN->Edges.emplace_back(TargetN, Edge::Call);
1443 SourceN->Edges.emplace_back(TargetN, Edge::Ref);
1482 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {
1515 for (Edge E : *N) {
1517 N->setEdgeKind(E.getNode(), Edge::Ref);
1530 for (Edge &E : **N) {
1544 for (Edge &E : **DeadN) {
1576 // Gets the Edge::Kind from one function to another by looking at the function's
1580 static LazyCallGraph::Edge::Kind getEdgeKind(Function &OriginalFunction,
1595 return LazyCallGraph::Edge::Kind::Call;
1617 return LazyCallGraph::Edge::Kind::Ref;
1637 Edge::Kind EK = getEdgeKind(OriginalFunction, NewFunction);
1640 for (Edge &E : *NewN) {
1642 if (EK == Edge::Kind::Call && E.isCall() && lookupSCC(EN) == OriginalC) {
1653 for (Edge &E : *NewN) {
1669 int InsertIndex = EK == Edge::Kind::Call ? NewRC->SCCIndices[OriginalC]
1721 OriginalN->insertEdgeInternal(NewN, Edge::Kind::Ref);
1725 for (Edge &E : *NewN) {
1769 assert(getEdgeKind(OriginalFunction, *F1) == Edge::Kind::Ref &&
1941 for (Edge &E : *this)
2000 for (LazyCallGraph::Edge &E : N.populate())
2047 for (LazyCallGraph::Edge &E : N.populate()) {