Searched refs:OutgoingEdges (Results 1 – 3 of 3) sorted by relevance
171 const unsigned Size = N.OutgoingEdges.size(); in pruneEdges()174 DependencyEdge &Edge = N.OutgoingEdges[I]; in pruneEdges()181 std::swap(Edge, N.OutgoingEdges[E - 1]); in pruneEdges()187 N.OutgoingEdges.resize(Size - NumPruned); in pruneEdges()195 if (N.NumPredecessors == 0 && !N.OutgoingEdges.empty()) in initializeRootSet()237 for (const DependencyEdge &DepEdge : N.OutgoingEdges) { in propagateThroughEdges()403 for (const DependencyEdge &DE : Node.OutgoingEdges) in dump()409 for (const DependencyEdge &DE : Node.OutgoingEdges) in dump()415 for (const DependencyEdge &DE : Node.OutgoingEdges) in dump()425 SmallVectorImpl<DependencyEdge> &Vec = NodeFrom.OutgoingEdges; in addDependency()
234 SmallVector<DependencyEdge, 0> OutgoingEdges; member
411 bool hasAnyOutgoingEdges() const { return OutgoingEdges.size(); } in hasAnyOutgoingEdges()413 return any_of(OutgoingEdges, [&](const auto *E) { return E->Kind == EK; }); in hasAnyOutgoingEdgesOfKind()421 return OutgoingEdges; in outgoing_edges()457 EdgesVec OutgoingEdges; member in llvm::__anon00e757230111::SplitGraph::Node644 (find(E->Src->OutgoingEdges, E) == E->Src->OutgoingEdges.end())) { in verifyGraph()650 for (const Edge *E : N->OutgoingEdges) { in verifyGraph()743 Src.OutgoingEdges.push_back(E); in createEdge()