Lines Matching refs:Edge

43                                                      Edge::Kind EK) {
48 void LazyCallGraph::EdgeSequence::setEdgeKind(Node &TargetN, Edge::Kind EK) {
57 Edges[IndexMapI->second] = Edge();
62 static void addEdge(SmallVectorImpl<LazyCallGraph::Edge> &Edges,
64 LazyCallGraph::Node &N, LazyCallGraph::Edge::Kind EK) {
69 Edges.emplace_back(LazyCallGraph::Edge(N, EK));
108 LazyCallGraph::Edge::Call);
122 LazyCallGraph::Edge::Ref);
130 LazyCallGraph::Edge::Ref);
173 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(F), Edge::Ref);
185 addEdge(EntryEdges.Edges, EntryEdges.EdgeIndexMap, get(*F), Edge::Ref);
202 LazyCallGraph::Edge::Ref);
244 for (Edge &E : **N)
255 for (Edge &E : N->calls())
277 for (Edge &E : N->calls()) {
337 for (Edge &E : *N) {
343 "Edge between SCCs violates post-order relationship.");
358 for (Edge &E : *N)
380 for (Edge &E : *N) {
548 SourceN->setEdgeKind(TargetN, Edge::Call);
561 SourceN->setEdgeKind(TargetN, Edge::Call);
575 for (Edge &E : N->calls())
604 for (Edge &E : *N) {
637 SourceN->setEdgeKind(TargetN, Edge::Call);
672 SourceN->setEdgeKind(TargetN, Edge::Call);
697 SourceN->setEdgeKind(TargetN, Edge::Ref);
722 SourceN->setEdgeKind(TargetN, Edge::Ref);
901 SourceN->setEdgeKind(TargetN, Edge::Call);
923 SourceN->setEdgeKind(TargetN, Edge::Ref);
936 SourceN->insertEdgeInternal(TargetN, Edge::Ref);
945 Edge::Kind EK) {
1000 for (Edge &E : *N)
1025 for (Edge &E : *N) {
1099 SourceN->insertEdgeInternal(TargetN, Edge::Ref);
1403 Edge &E = SourceN->Edges[InsertResult.first->second];
1406 E.setKind(Edge::Call);
1409 SourceN->Edges.emplace_back(TargetN, Edge::Call);
1439 SourceN->Edges.emplace_back(TargetN, Edge::Ref);
1476 void LazyCallGraph::insertEdge(Node &SourceN, Node &TargetN, Edge::Kind EK) {
1708 for (Edge &E : *this)
1747 for (LazyCallGraph::Edge &E : N.populate())
1793 for (LazyCallGraph::Edge &E : N.populate()) {