Home
last modified time | relevance | path

Searched refs:prev_edges (Results 1 – 4 of 4) sorted by relevance

/third_party/mindspore/tests/ut/cpp/parallel/auto_parallel/
Dgraph_costmodel_test.cc380 ASSERT_EQ(new_edge.get(), matmul4->prev_edges()[0].get()); in TEST_F()
407 ASSERT_EQ(new_edge.get(), matmul5->prev_edges()[0].get()); in TEST_F()
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/auto_parallel/
Dgraph_costmodel.cc155 for (auto &edge : curr_op->prev_edges()) { in BFS()
223 for (auto &edge : current_op->prev_edges()) { in DFS()
1703 if (first_op->prev_edges().size() > 0) { in DetermineCriticalOps()
1706 << first_op->prev_edges() << "edges."; in DetermineCriticalOps()
1725 for (const auto &prev_edge : topo_order[finished]->prev_edges()) { in DetermineCriticalOps()
1729 for (const auto &prev_edge : topo_order[finished]->prev_edges()) { in DetermineCriticalOps()
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/ops_info/
Doperator_info.cc1452 for (auto &prev_edge : prev_edges()) { in ExactStrategiesAndRelatedEdges()
1470 const auto &prev_edges = this->GetAlivePrevEdges(); in ComputeOpAndPrevEdgeParameterInvolved() local
1471 for (auto &p_edge : prev_edges) { in ComputeOpAndPrevEdgeParameterInvolved()
1501 for (auto &p_edge : prev_edges) { in ComputeOpAndPrevEdgeParameterInvolved()
Doperator_info.h132 std::vector<std::shared_ptr<Edge>> prev_edges() const { return prev_edges_; } in prev_edges() function