Searched refs:edge_ptr (Results 1 – 4 of 4) sorted by relevance
| /third_party/mindspore/mindspore/ccsrc/minddata/dataset/engine/gnn/ |
| D | graph_loader.cc | 60 std::shared_ptr<Edge> edge_ptr = dq.front(); in GetNodesAndEdges() local
62 RETURN_IF_NOT_OK(edge_ptr->GetNode(&p)); in GetNodesAndEdges()
68 RETURN_IF_NOT_OK(edge_ptr->SetNode({src_itr->second, dst_itr->second})); in GetNodesAndEdges()
69 RETURN_IF_NOT_OK(src_itr->second->AddNeighbor(dst_itr->second, edge_ptr->weight())); in GetNodesAndEdges()
70 RETURN_IF_NOT_OK(src_itr->second->AddAdjacent(dst_itr->second, edge_ptr)); in GetNodesAndEdges()
72 e_id_map->insert({edge_ptr->id(), edge_ptr}); // add edge to edge_id_map_ in GetNodesAndEdges()
73 graph_impl_->edge_type_map_[edge_ptr->type()].push_back(edge_ptr->id()); in GetNodesAndEdges()
255 std::shared_ptr<Edge> edge_ptr; in WorkerEntry() local
256 RETURN_IF_NOT_OK(LoadEdge(col_blob, col_jsn, &edge_ptr, &(e_feature_maps_[worker_id]), in WorkerEntry()
258 e_deques_[worker_id].emplace_back(edge_ptr); in WorkerEntry()
|
| /third_party/mindspore/mindspore/ccsrc/frontend/parallel/ |
| D | step_auto_parallel.cc | 603 EdgePtr edge_ptr; in CreateEdgeBetweenTwoOps() local
617 edge_ptr = in CreateEdgeBetweenTwoOps()
620 …edge_ptr = std::make_shared<Edge>(edge_name, prev_op_info, node_op_info, output_index, input_index… in CreateEdgeBetweenTwoOps()
624 if (edge_ptr->InitEdgeCost() != SUCCESS) { in CreateEdgeBetweenTwoOps()
627 node_op_info->AddPrevEdge(edge_ptr); in CreateEdgeBetweenTwoOps()
628 prev_op_info->AddSuccEdge(edge_ptr); in CreateEdgeBetweenTwoOps()
629 entire_costgraph->AddEdge(prev_op_info, node_op_info, edge_ptr); in CreateEdgeBetweenTwoOps()
633 const auto cast_stra = edge_ptr->GetPrevOpStrategyByNextOpStrategyWithZeroComm(next_op_stra); in CreateEdgeBetweenTwoOps()
641 if (edge_ptr->InitEdgeCost() != SUCCESS) { in CreateEdgeBetweenTwoOps()
826 std::shared_ptr<Edge> edge_ptr = in AugmentCostGraph() local
[all …]
|
| /third_party/mindspore/tests/ut/cpp/parallel/ |
| D | step_auto_parallel_test.cc | 191 …std::shared_ptr<Edge> edge_ptr = std::make_shared<Edge>(edge_name, u_matmul_info, v_matmul_info, 0… in TEST_F() local
193 ASSERT_EQ(edge_ptr->edge_name(), expected_name); in TEST_F()
|
| /third_party/mindspore/mindspore/ccsrc/frontend/parallel/auto_parallel/ |
| D | graph_costmodel.cc | 1156 auto edge_ptr = op->GetAliveSuccEdges()[0]; in EliminationMerge() local
1158 MS_EXCEPTION_IF_NULL(edge_ptr); in EliminationMerge()
1172 auto edge_clist = edge_ptr->GetCostList(op_stra, tar_stra); in EliminationMerge()
1239 auto edge_ptr = op->GetAlivePrevEdges()[0]; in EliminationContract() local
1253 auto edge_clist = edge_ptr->GetCostList(tar_stra, op_stra); in EliminationContract()
1910 for (auto &edge_ptr : edges_vector) { in CheckApproximateCostGraphEdges() local
1911 MS_EXCEPTION_IF_NULL(edge_ptr); in CheckApproximateCostGraphEdges()
1912 if (edge_ptr->CheckStrategyCostPossibility()) { in CheckApproximateCostGraphEdges()
1915 MS_LOG(INFO) << "Checking StrategyCost for edge: " << edge_ptr->edge_name() in CheckApproximateCostGraphEdges()
1917 auto prev_op = edge_ptr->prev_operator(); in CheckApproximateCostGraphEdges()
[all …]
|