Home
last modified time | relevance | path

Searched refs:AddEdge (Results 1 – 25 of 57) sorted by relevance

123

/third_party/mindspore/tests/ut/cpp/parallel/auto_parallel/
Ddp_algo_test.cc277 cost_graph->AddEdge(matmul7, matmul8, edge_m7_m8); in ConstructTwoLargeMatMul()
419 cost_graph->AddEdge(tmp_identity_ptr, mm3_ptr, edge_i0_m3); in ConstructBatmanGraph()
423 cost_graph->AddEdge(tmp_identity_ptr, mm6_ptr, edge_i0_m6); in ConstructBatmanGraph()
427 cost_graph->AddEdge(tmp_identity_ptr1, mm2_ptr, edge_i1_m2); in ConstructBatmanGraph()
431 cost_graph->AddEdge(tmp_identity_ptr1, mm4_ptr, edge_i1_m4); in ConstructBatmanGraph()
435 cost_graph->AddEdge(tmp_identity_ptr2, mm5_ptr, edge_i2_m5); in ConstructBatmanGraph()
439 cost_graph->AddEdge(tmp_identity_ptr2, mm7_ptr, edge_i2_m7); in ConstructBatmanGraph()
443 cost_graph->AddEdge(mm1_ptr, mm2_ptr, edge_m1_m2); in ConstructBatmanGraph()
447 cost_graph->AddEdge(mm1_ptr, mm5_ptr, edge_m1_m5); in ConstructBatmanGraph()
451 cost_graph->AddEdge(mm2_ptr, mm3_ptr, edge_m2_m3); in ConstructBatmanGraph()
[all …]
Dgraph_costmodel_test.cc147 cost_graph.AddEdge(matmul1, matmul2, edge_m1_m2); in ConstructStarGraph2()
150 cost_graph.AddEdge(matmul0, matmul2, edge_m0_m2); in ConstructStarGraph2()
153 cost_graph.AddEdge(matmul1, matmul3, edge_m1_m3); in ConstructStarGraph2()
196 cost_graph.AddEdge(matmul1, matmul2, edge_m1_m2); in ConstructLinearGraph()
199 cost_graph.AddEdge(matmul2, matmul4, edge_m2_m4); in ConstructLinearGraph()
222 cost_graph.AddEdge(matmul1, matmul2, edge_m1_m2); in ConstructStarGraph()
225 cost_graph.AddEdge(matmul2, matmul4, edge_m2_m4); in ConstructStarGraph()
228 cost_graph.AddEdge(matmul3, matmul4, edge_m3_m4); in ConstructStarGraph()
271 entire_cost_graph.AddEdge(matmul1, matmul2, edge_m1_m2); in TEST_F()
293 entire_cost_graph.AddEdge(matmul1, matmul2, edge_m1_m2); in TEST_F()
[all …]
/third_party/skia/third_party/externals/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc375 bool AddEdge(int x, int y) { in AddEdge() function in absl::synchronization_internal::GraphCyclesTest
382 EXPECT_TRUE(AddEdge(x, 2*x)) << x; in AddMultiples()
383 EXPECT_TRUE(AddEdge(x, 3*x)) << x; in AddMultiples()
413 EXPECT_FALSE(AddEdge(8, 4)); in TEST_F()
420 EXPECT_TRUE(AddEdge(16, 9)); in TEST_F()
422 EXPECT_FALSE(AddEdge(9, 2)); in TEST_F()
428 ASSERT_TRUE(AddEdge(2, 4)); in TEST_F()
429 ASSERT_TRUE(AddEdge(4, 6)); in TEST_F()
430 ASSERT_TRUE(AddEdge(6, 8)); in TEST_F()
431 ASSERT_TRUE(AddEdge(8, 10)); in TEST_F()
[all …]
/third_party/abseil-cpp/absl/synchronization/internal/
Dgraphcycles_test.cc375 bool AddEdge(int x, int y) { in AddEdge() function in absl::synchronization_internal::GraphCyclesTest
382 EXPECT_TRUE(AddEdge(x, 2*x)) << x; in AddMultiples()
383 EXPECT_TRUE(AddEdge(x, 3*x)) << x; in AddMultiples()
413 EXPECT_FALSE(AddEdge(8, 4)); in TEST_F()
420 EXPECT_TRUE(AddEdge(16, 9)); in TEST_F()
422 EXPECT_FALSE(AddEdge(9, 2)); in TEST_F()
428 ASSERT_TRUE(AddEdge(2, 4)); in TEST_F()
429 ASSERT_TRUE(AddEdge(4, 6)); in TEST_F()
430 ASSERT_TRUE(AddEdge(6, 8)); in TEST_F()
431 ASSERT_TRUE(AddEdge(8, 10)); in TEST_F()
[all …]
/third_party/node/src/
Dmemory_tracker-inl.h104 graph_->AddEdge(CurrentNode(), it->second, edge_name); in TrackField()
226 graph_->AddEdge(CurrentNode(), graph_->V8Node(value), edge_name); in TrackField()
279 graph_->AddEdge(CurrentNode(), it->second, edge_name); in Track()
312 if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name); in AddNode()
315 graph_->AddEdge(n, n->JSWrapperNode(), "wrapped"); in AddNode()
316 graph_->AddEdge(n->JSWrapperNode(), n, "wrapper"); in AddNode()
328 if (CurrentNode() != nullptr) graph_->AddEdge(CurrentNode(), n, edge_name); in AddNode()
/third_party/mindspore/mindspore/ccsrc/backend/optimizer/graph_kernel/
Dtransform_op_optimizer.cc50 void AddEdge(size_t from, size_t to, size_t capacity, size_t inv_capacity) { in AddEdge() function in mindspore::opt::__anona36fc2fb0111::MinCut
116 AddEdge(source_id_, original_nodes[i].first, INF, 0); in BuildGraph()
118 AddEdge(original_nodes[i].first, sink_id_, INF, 0); in BuildGraph()
122 AddEdge(original_nodes[i].first, original_nodes[i].first + origin_nodes_num_, 1, 1); in BuildGraph()
126 AddEdge(from + origin_nodes_num_, to, 1, 1); in BuildGraph()
/third_party/ninja/src/
Dstate_test.cc34 Edge* edge = state.AddEdge(rule); in TEST()
Dstate.h95 Edge* AddEdge(const Rule* rule);
/third_party/mindspore/mindspore/core/api/ir/
Dfunc_graph_manager.h47 virtual void AddEdge(const AnfNodePtr &node, const AnfNodePtr &value) = 0;
/third_party/skia/third_party/externals/swiftshader/third_party/SPIRV-Tools/source/opt/
Dloop_fusion.cpp653 cfg->AddEdge(last_block_of_0->id(), first_block_of_1->id()); in Fuse()
655 cfg->AddEdge(last_block_of_1->id(), loop_0_->GetContinueBlock()->id()); in Fuse()
657 cfg->AddEdge(loop_0_->GetContinueBlock()->id(), in Fuse()
660 cfg->AddEdge(condition_block_of_0->id(), loop_1_->GetMergeBlock()->id()); in Fuse()
Dcfg.h117 void AddEdge(uint32_t pred_blk_id, uint32_t succ_blk_id) { in AddEdge() function
Dloop_unswitch_pass.cpp204 cfg.AddEdge(pid, loop_merge_block->id()); in PerformUnswitch()
253 cfg.AddEdge(if_block->id(), loop_pre_header->id()); in PerformUnswitch()
/third_party/spirv-tools/source/opt/
Dloop_fusion.cpp653 cfg->AddEdge(last_block_of_0->id(), first_block_of_1->id()); in Fuse()
655 cfg->AddEdge(last_block_of_1->id(), loop_0_->GetContinueBlock()->id()); in Fuse()
657 cfg->AddEdge(loop_0_->GetContinueBlock()->id(), in Fuse()
660 cfg->AddEdge(condition_block_of_0->id(), loop_1_->GetMergeBlock()->id()); in Fuse()
Dcfg.h117 void AddEdge(uint32_t pred_blk_id, uint32_t succ_blk_id) { in AddEdge() function
/third_party/skia/third_party/externals/spirv-tools/source/opt/
Dloop_fusion.cpp653 cfg->AddEdge(last_block_of_0->id(), first_block_of_1->id()); in Fuse()
655 cfg->AddEdge(last_block_of_1->id(), loop_0_->GetContinueBlock()->id()); in Fuse()
657 cfg->AddEdge(loop_0_->GetContinueBlock()->id(), in Fuse()
660 cfg->AddEdge(condition_block_of_0->id(), loop_1_->GetMergeBlock()->id()); in Fuse()
Dcfg.h117 void AddEdge(uint32_t pred_blk_id, uint32_t succ_blk_id) { in AddEdge() function
Dloop_unswitch_pass.cpp204 cfg.AddEdge(pid, loop_merge_block->id()); in PerformUnswitch()
253 cfg.AddEdge(if_block->id(), loop_pre_header->id()); in PerformUnswitch()
/third_party/mindspore/mindspore/ccsrc/frontend/parallel/allreduce_fusion/
Dallreduce_graph.h46 Status AddEdge(const CNodePtr &from, const CNodePtr &to, double dist);
/third_party/mindspore/mindspore/core/ir/
Dmanager.cc94 class AddEdge : public Change { class
96 AddEdge(const CNodePtr &cnode, const AnfNodePtr &input) : cnode_{cnode}, input_{input} {} in AddEdge() function in mindspore::change::AddEdge
97 ~AddEdge() override = default;
645 void FuncGraphManager::AddEdge(const AnfNodePtr &node, const AnfNodePtr &value) { in AddEdge() function in mindspore::FuncGraphManager
647 tr.AddEdge(node, value); in AddEdge()
814 void FuncGraphTransaction::AddEdge(const AnfNodePtr &src_node, const AnfNodePtr &v) { in AddEdge() function in mindspore::FuncGraphTransaction
820 (void)changes_.emplace_back(std::make_unique<change::AddEdge>(cnode, v)); in AddEdge()
Dmanager.h302 void AddEdge(const AnfNodePtr &node, const AnfNodePtr &value) final;
400 void AddEdge(const AnfNodePtr &src_node, const AnfNodePtr &v);
/third_party/mindspore/mindspore/lite/tools/optimizer/fusion/
Dmatmul_add_fusion.cc81 manager->AddEdge(matmul_cnode, bias_node); in Run()
/third_party/mindspore/mindspore/ccsrc/runtime/device/ascend/executor/tiling/
Dop_tiling_adapter.h53 …void AddEdge(const ge::NodePtr &ge_node, const std::vector<std::tuple<std::size_t, ge::NodePtr>> &…
Dop_tiling_adapter.cc220 void OpTilingCalculateAdapter::AddEdge(const ge::NodePtr &ge_node, in AddEdge() function in mindspore::device::tiling::OpTilingCalculateAdapter
288 AddEdge(ge_node, constant_ops); in AnfNodeToGeNodeAdapter()
/third_party/mindspore/mindspore/lite/tools/converter/parser/
Dinputs_adjust.cc94 tr.AddEdge(cnode, param_node); in AddAttrToInput()
/third_party/mindspore/tests/ut/cpp/ir/
Dmanager_test.cc652 mgr->AddEdge(u1, a); in TEST_F()
672 mgr->AddEdge(u2, a); in TEST_F()
704 mgr->AddEdge(u1, new_add); in TEST_F()

123