Home
last modified time | relevance | path

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

1234

/external/swiftshader/third_party/llvm-7.0/llvm/unittests/ADT/
DBreadthFirstIteratorTest.cpp22 G.AddEdge(0, 1); in TEST()
23 G.AddEdge(0, 2); in TEST()
24 G.AddEdge(1, 3); in TEST()
47 G.AddEdge(0, 1); in TEST()
48 G.AddEdge(1, 0); in TEST()
49 G.AddEdge(1, 2); in TEST()
50 G.AddEdge(2, 1); in TEST()
51 G.AddEdge(2, 1); in TEST()
52 G.AddEdge(2, 3); in TEST()
53 G.AddEdge(3, 2); in TEST()
[all …]
DDepthFirstIteratorTest.cpp46 G.AddEdge(0, 1); in TEST()
47 G.AddEdge(0, 2); in TEST()
DSCCIteratorTest.cpp39 G.AddEdge(i, j); in TEST()
43 G.AddEdge(i, j); in TEST()
/external/tensorflow/tensorflow/compiler/jit/graphcycles/
Dgraphcycles_test.cc390 bool AddEdge(int x, int y) { return g_.InsertEdge(x, y); } in AddEdge() function in GraphCyclesTest
395 EXPECT_TRUE(AddEdge(x, 2 * x)) << x; in AddMultiples()
396 EXPECT_TRUE(AddEdge(x, 3 * x)) << x; in AddMultiples()
427 EXPECT_FALSE(AddEdge(8, 4)); in TEST_F()
434 EXPECT_TRUE(AddEdge(16, 9)); in TEST_F()
436 EXPECT_FALSE(AddEdge(9, 2)); in TEST_F()
442 ASSERT_TRUE(AddEdge(2, 4)); in TEST_F()
443 ASSERT_TRUE(AddEdge(4, 6)); in TEST_F()
444 ASSERT_TRUE(AddEdge(6, 8)); in TEST_F()
445 ASSERT_TRUE(AddEdge(8, 10)); in TEST_F()
[all …]
/external/tensorflow/tensorflow/lite/delegates/gpu/common/memory_management/
Dmin_cost_flow_assignment.cc51 AddEdge(source_, i, 1, 0); in Build()
52 AddEdge(RightPartTwin(i), sink_, 1, 0); in Build()
57 AddEdge(source_, RightPartTwin(i), 1, usage_records[i].tensor_size); in Build()
71 AddEdge(record_id, RightPartTwin(i), 1, cost); in Build()
152 void AddEdge(size_t src, size_t dst, int cap, int cost) { in AddEdge() function in tflite::gpu::__anon9a05df300111::MinCostFlowSolver
/external/tensorflow/tensorflow/core/graph/
Dgraph_test.cc190 graph_.AddEdge(a, 0, c, 0); in TEST_F()
220 graph_.AddEdge(a, 0, c, 0); in TEST_F()
235 graph_.AddEdge(a, 0, t, 0); in TEST_F()
237 graph_.AddEdge(t, 0, t, 1); in TEST_F()
271 graph_.AddEdge(a_new, 0, c, 0); in TEST_F()
276 graph_.AddEdge(b_new, 0, c, 0); in TEST_F()
301 graph_.AddEdge(a, 0, c, 0); in TEST_F()
394 graph_.AddEdge(a, 0, b, 0); in TEST_F()
401 graph_.AddEdge(a, 1, a, 0); in TEST_F()
549 graph_.AddEdge(a, 0, c, 0); in TEST_F()
[all …]
Dmkl_tfconversion_pass.cc198 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, dst, e->dst_input())); in InsertConversionNodeOnEdge()
283 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, n, edges[0]->dst_input())); in InsertInputConversionNode()
284 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 1, n, edges[1]->dst_input())); in InsertInputConversionNode()
285 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 2, n, edges[2]->dst_input())); in InsertInputConversionNode()
286 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 3, n, edges[3]->dst_input())); in InsertInputConversionNode()
Dgradients.cc77 g->AddEdge(input.node, input.index, read, 0); in AddZerosLike()
85 g->AddEdge(read, 0, ret, 0); in AddZerosLike()
96 g->AddEdge(input.node, input.index, ret, 0); in AddZerosLike()
330 graph_->AddEdge(nout.node, nout.index, add, i); in SumGradients()
386 graph_->AddEdge(e->src(), e->src_output(), grad, e->dst_input()); in Compute()
389 graph_->AddEdge(dy[i].node, dy[i].index, grad, num_x + i); in Compute()
/external/tensorflow/tensorflow/compiler/tf2xla/
Drearrange_function_argument.cc123 g->AddEdge(src, src_output, n, new_dst_input)->DebugString(); in ReorderInputEdges()
150 g->AddEdge(n, new_src_output, dst, dst_input); in ReorderOutputEdges()
154 g->AddEdge(input_edge->src(), input_edge->src_output(), dst, dst_input); in ReorderOutputEdges()
249 g->AddEdge(input_edge->src(), input_edge->src_output(), dst, dst_input); in RearrangeOutputEdges()
252 g->AddEdge(n, iter->second, dst, dst_input); in RearrangeOutputEdges()
419 g->AddEdge(src, src_output, n, new_dst_input)->DebugString(); in MaybeRewriteIfNode()
486 g->AddEdge(input_edge->src(), input_edge->src_output(), dst, dst_input); in MaybeRewriteIfNode()
489 g->AddEdge(n, iter->second, dst, dst_input); in MaybeRewriteIfNode()
Dfunctionalize_while.cc105 output->AddEdge(src_copy, src_output, dst_copy, e->dst_input()); in CopySubgraph()
184 output->AddEdge(arg_node, 0, retval_node, 0); in BuildLoopBody()
244 graph->AddEdge(e->src(), e->src_output(), new_arg.enter, in FunctionalizeLoop()
250 graph->AddEdge(new_arg.enter, 0, dst, dst_input); in FunctionalizeLoop()
472 graph->AddEdge(in_edge->src(), in_edge->src_output(), while_node, i); in FunctionalizeLoop()
488 graph->AddEdge(while_node, i, dst, dst_input); in FunctionalizeLoop()
Dtf2xla_util.cc157 g->AddEdge(const_node, 0, replace_node, usages[i].dst_input); in ReplaceArgUsageWithConstNode()
641 graph->AddEdge(edge->src(), edge->src_output(), new_node, in RewriteAssociatedFunction()
645 graph->AddEdge(new_node, edge->src_output(), edge->dst(), in RewriteAssociatedFunction()
728 g->AddEdge(in_edge->src(), in_edge->src_output(), new_node, in ReplaceNode()
732 g->AddEdge(new_node, out_edge.src_output, out_edge.dst, out_edge.dst_input); in ReplaceNode()
907 bwd_fbody->graph->AddEdge(const_node, 0, dst, dst_input); in RewriteTensorListWithConstElement()
/external/v8/src/heap/cppgc-js/
Dcpp-snapshot.cc379 void AddEdge(State& parent, const HeapObjectHeader& header) { in AddEdge() function in v8::internal::CppGraphBuilderImpl
392 graph_.AddEdge(parent.get_node(), current.get_node()); in AddEdge()
395 void AddEdge(State& parent, const TracedReferenceBase& ref) { in AddEdge() function in v8::internal::CppGraphBuilderImpl
403 graph_.AddEdge(parent.get_node(), v8_node); in AddEdge()
443 graph_.AddEdge(root.get_node(), child.get_node(), holder.get()); in AddRootEdge()
447 graph_.AddEdge(root.get_node(), child.get_node()); in AddRootEdge()
548 graph_builder_.AddEdge( in Visit()
562 graph_builder_.AddEdge(parent_scope_.ParentAsRegularState(), ref); in Visit()
/external/tensorflow/tensorflow/compiler/jit/
Dencapsulate_xla_computations_pass_test.cc67 scope.graph()->AddEdge(a.node(), 0, launch, 0); in MakeOuterGraph()
68 scope.graph()->AddEdge(b.node(), 0, launch, 1); in MakeOuterGraph()
69 scope.graph()->AddEdge(c.node(), 0, launch, 2); in MakeOuterGraph()
70 scope.graph()->AddEdge(d.node(), 0, launch, 3); in MakeOuterGraph()
71 scope.graph()->AddEdge(u.node(), 0, launch, 4); in MakeOuterGraph()
72 scope.graph()->AddEdge(v.node(), 0, launch, 5); in MakeOuterGraph()
73 scope.graph()->AddEdge(w.node(), 0, launch, 6); in MakeOuterGraph()
Dextract_outside_compilation_pass.cc158 g->AddEdge(recv_at_host_node, index, edge.dst, edge.dst_input); in ReplaceArgNodesWithRecvAtHostNode()
184 g->AddEdge(key_placeholder, 0, recv_at_host_node, 0); in ReplaceArgNodesWithRecvAtHostNode()
266 g->AddEdge(edge->src(), edge->src_output(), send_from_host_node, index); in ReplaceRetNodesWithSendFromHostNode()
271 g->AddEdge(key_placeholder, 0, send_from_host_node, in ReplaceRetNodesWithSendFromHostNode()
506 g->AddEdge(outside_compilation_node, 0, n, i + arg_to_input_edge_offset); in AddEdgesFromOutsideCompilationNodes()
540 function_body.graph->AddEdge(arg_node, 0, ret_node, 0); in AddMatchingRetvalNode()
560 function_body.graph->AddEdge(arg_node, 0, e->dst(), e->dst_input()); in ReplaceLiftedArgNodePlaceholderWithArg()
1035 ->AddEdge(node_map[e->src()], e->src_output(), copy, in ConstructHostGraph()
1145 main_graph->AddEdge(node_map[e->src()], e->src_output(), copy, in ExpandHostGraphIntoMainGraph()
1236 g->AddEdge(node_iter->second, e->src_output(), copy, in RewriteShapeInferenceGraph()
[all …]
Dclone_constants_for_better_clustering.cc49 g->AddEdge(e->src(), e->src_output(), new_in, e->dst_input()); in CloneNode()
130 g->AddEdge(input_cloned, 0, n, dst_input); in CloneSmallHostConstantInputs()
Dshape_inference_helpers.cc61 graph_->AddEdge(be.src, be.src_output, be.dst, be.dst_input); in Replace()
Dshape_inference_test.cc110 scope.graph()->AddEdge(next_iteration.node(), 0, merge.output.node(), 1); in TEST()
155 scope.graph()->AddEdge(next_iteration.node(), 0, merge.output.node(), 1); in TEST()
/external/tensorflow/tensorflow/core/nccl/
Dnccl_rewrite.cc98 graph->AddEdge(recv_node, 0, out_node.node, out_node.index); in ReplaceReduce()
154 graph->AddEdge(in_node, in_index, out_node.node, out_node.index); in ReplaceBroadcast()
195 graph->AddEdge(in_node.node, in_node.index, out_node.node, in ReplaceBroadcast()
235 graph->AddEdge(recv_node, 0, out_node.node, out_node.index); in ReplaceBroadcast()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc120 void AddEdge(SimpleNode* src, int out_port, SimpleNode* dst, int in_port);
182 void SimpleGraph::AddEdge(SimpleNode* src, int out_port, SimpleNode* dst, in AddEdge() function in tensorflow::tensorrt::segment::SimpleGraph
201 AddEdge(src, Graph::kControlSlot, dst, Graph::kControlSlot); in AddControlEdge()
367 graph->AddEdge(e->src(), e->src_output(), src, Graph::kControlSlot); in ContractEdge()
369 graph->AddEdge(e->src(), e->src_output(), src, 0 /* input index */); in ContractEdge()
386 graph->AddEdge(src, Graph::kControlSlot, e->dst(), e->dst_input()); in ContractEdge()
388 graph->AddEdge(src, 0 /* output index */, e->dst(), e->dst_input()); in ContractEdge()
/external/llvm/unittests/ADT/
DSCCIteratorTest.cpp113 void AddEdge(unsigned FromIdx, unsigned ToIdx) { in AddEdge() function in llvm::Graph
264 G.AddEdge(i, j); in TEST()
268 G.AddEdge(i, j); in TEST()
/external/chromium-trace/catapult/common/py_vulcanize/py_vulcanize/
Dproject.py170 g.AddEdge(m, dep.id)
205 g.AddEdge(out_dep, cur)
233 def AddEdge(self, mFrom, mTo): member in _Graph
/external/tensorflow/tensorflow/core/debug/
Ddebug_graph_utils.cc195 graph->AddEdge(src_node, src_output_slot, copy_node, 0); in InsertNodes()
207 graph->AddEdge(copy_node, 0, debug_node, 0); in InsertNodes()
232 graph->AddEdge(copy_node, 0, edge->dst(), edge->dst_input()); in InsertNodes()
240 graph->AddEdge(debug_node, Graph::kControlSlot, edge->dst(), in InsertNodes()
/external/angle/third_party/spirv-tools/src/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()
/external/deqp-deps/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()
/external/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()

1234