Searched refs:GetAliveSuccEdges (Results 1 – 4 of 4) sorted by relevance
498 if (!first_op->GetAliveSuccEdges().empty() && in SearchStrategyForMultiNodeFinalGraph()499 first_op->GetAliveSuccEdges()[0]->next_operator().get() == second_op.get()) { in SearchStrategyForMultiNodeFinalGraph()502 } else if (!second_op->GetAliveSuccEdges().empty() && in SearchStrategyForMultiNodeFinalGraph()503 second_op->GetAliveSuccEdges()[0]->next_operator().get() == first_op.get()) { in SearchStrategyForMultiNodeFinalGraph()507 …XCEPTION) << "The final graph is not the case of u --> v, " << first_op->GetAliveSuccEdges().size() in SearchStrategyForMultiNodeFinalGraph()508 << ", " << second_op->GetAliveSuccEdges().size() << "."; in SearchStrategyForMultiNodeFinalGraph()511 auto e = u->GetAliveSuccEdges()[0]; in SearchStrategyForMultiNodeFinalGraph()539 if (!first_op->GetAliveSuccEdges().empty() && in SearchStrategyForMultiNodeFinalGraph()540 first_op->GetAliveSuccEdges()[0]->next_operator().get() == second_op.get()) { in SearchStrategyForMultiNodeFinalGraph()543 } else if (!second_op->GetAliveSuccEdges().empty() && in SearchStrategyForMultiNodeFinalGraph()[all …]
40 auto r_edge = node->GetAliveSuccEdges()[0]; in GetStrategy()60 auto succ_edge = merge_node->GetAliveSuccEdges()[0]; in GetStrategy()86 auto left_edge = eliminated_node->GetAliveSuccEdges()[0]; in GetStrategy()87 auto right_edge = eliminated_node->GetAliveSuccEdges()[1]; in GetStrategy()
133 std::vector<std::shared_ptr<Edge>> GetAliveSuccEdges();
877 std::vector<std::shared_ptr<Edge>> OperatorInfo::GetAliveSuccEdges() { in GetAliveSuccEdges() function in mindspore::parallel::OperatorInfo