Home
last modified time | relevance | path

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

12345

/external/tensorflow/tensorflow/compiler/mlir/hlo/lib/utils/
Dcycle_detector_test.cc24 bool AddEdge(int x, int y) { return g_.InsertEdge(x, y); } in AddEdge() function in GraphCyclesTest
29 EXPECT_TRUE(AddEdge(x, 2 * x)) << x; in AddMultiples()
30 EXPECT_TRUE(AddEdge(x, 3 * x)) << x; in AddMultiples()
41 EXPECT_FALSE(AddEdge(8, 4)); in TEST_F()
46 EXPECT_TRUE(AddEdge(16, 9)); in TEST_F()
47 EXPECT_FALSE(AddEdge(9, 2)); in TEST_F()
51 EXPECT_TRUE(AddEdge(1, 2)); in TEST_F()
52 EXPECT_TRUE(AddEdge(2, 3)); in TEST_F()
53 EXPECT_TRUE(AddEdge(3, 4)); in TEST_F()
54 EXPECT_TRUE(AddEdge(4, 5)); in TEST_F()
[all …]
/external/llvm-project/llvm/unittests/ADT/
DBreadthFirstIteratorTest.cpp21 G.AddEdge(0, 1); in TEST()
22 G.AddEdge(0, 2); in TEST()
23 G.AddEdge(1, 3); in TEST()
46 G.AddEdge(0, 1); in TEST()
47 G.AddEdge(1, 0); in TEST()
48 G.AddEdge(1, 2); in TEST()
49 G.AddEdge(2, 1); in TEST()
50 G.AddEdge(2, 1); in TEST()
51 G.AddEdge(2, 3); in TEST()
52 G.AddEdge(3, 2); in TEST()
[all …]
DDepthFirstIteratorTest.cpp45 G.AddEdge(0, 1); in TEST()
46 G.AddEdge(0, 2); in TEST()
DSCCIteratorTest.cpp38 G.AddEdge(i, j); in TEST()
42 G.AddEdge(i, j); in TEST()
/external/tensorflow/tensorflow/compiler/xla/service/graphcycles/
Dgraphcycles_test.cc391 bool AddEdge(int x, int y) { return g_.InsertEdge(x, y); } in AddEdge() function in GraphCyclesTest
396 EXPECT_TRUE(AddEdge(x, 2 * x)) << x; in AddMultiples()
397 EXPECT_TRUE(AddEdge(x, 3 * x)) << x; in AddMultiples()
428 EXPECT_FALSE(AddEdge(8, 4)); in TEST_F()
435 EXPECT_TRUE(AddEdge(16, 9)); in TEST_F()
437 EXPECT_FALSE(AddEdge(9, 2)); in TEST_F()
443 ASSERT_TRUE(AddEdge(2, 4)); in TEST_F()
444 ASSERT_TRUE(AddEdge(4, 6)); in TEST_F()
445 ASSERT_TRUE(AddEdge(6, 8)); in TEST_F()
446 ASSERT_TRUE(AddEdge(8, 10)); in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/tpu/graph_rewrite/
Dcond_builder.cc40 graph_->AddEdge(pred(), 0, switch_pred, 0); in CondBuilder()
41 graph_->AddEdge(pred(), 0, switch_pred, 1); in CondBuilder()
50 graph_->AddEdge(switch_pred, kElseBranch, switch_f_, 0); in CondBuilder()
51 graph_->AddEdge(switch_pred, kThenBranch, switch_t_, 0); in CondBuilder()
57 graph_->AddEdge(switch_f_, 0, merge_pred, kElseBranch); in CondBuilder()
58 graph_->AddEdge(switch_t_, 0, merge_pred, kThenBranch); in CondBuilder()
79 graph_->AddEdge(pred(), 0, *input, 1); in AddInput()
Ddistributed_tpu_configuration_rewrite_pass.cc95 graph->AddEdge(configuration_node, 0, *host_configuration_node, 0); in AddHostConfigNode()
122 graph->AddEdge(host_configuration_nodes[i], 0, *wait_node, i); in AddWaitNode()
141 graph->AddEdge(wait_node, 0, *global_tpu_array_node, 0); in AddGlobalTPUArrayNode()
169 graph->AddEdge(wait_node, 0, sync_node, 0); in AddSynchronizationNode()
176 graph->AddEdge(sync_node, dep.src_output, dep.dst, dep.dst_input); in AddSynchronizationNode()
235 graph->AddEdge(host_disconnect_node, 0, post_disconnect_node, output_index); in AddHostDisconnectNode()
Dhost_training_loop_optimization_util.cc340 graph->AddEdge(loop_switch_node, 1, at_loop_iteration_node, 0); in GetOrCreateBeforeEachIterationNode()
380 graph->AddEdge(loop_switch_node, 0, after_last_iteration_node, 0); in AddNoOpAfterLastIteration()
551 graph->AddEdge(variable_edge->src(), variable_edge->src_output(), in AddReshardOp()
559 graph->AddEdge(compile_node, compilation_key_edge->src_output(), in AddReshardOp()
583 graph->AddEdge(var_handle_node, 0, reshard_op_node, format_state_input); in AddReshardOp()
608 graph->AddEdge(enter_node, 0, unshard_op_node, i); in AddReshardOp()
615 graph->AddEdge(default_sharding_node, 0, unshard_op_node, new_key_input); in AddReshardOp()
618 graph->AddEdge(var_handle_node, 0, unshard_op_node, format_state_input); in AddReshardOp()
Ddistributed_tpu_rewrite_pass.cc558 graph->AddEdge(id_node, src_output, dst, dst_input); in ReplaceCompilationResultNodeWithIdentity()
704 graph->AddEdge(split_node, split_index, pad_node, 0); in CreatePadNode()
705 graph->AddEdge(paddings_node, 0, pad_node, 1); in CreatePadNode()
766 graph->AddEdge(split_dim_node, 0, split_node, 0); in CreateSplitNode()
767 graph->AddEdge(to_split_node, to_split_index, split_node, 1); in CreateSplitNode()
941 graph->AddEdge(concat_dim_node, 0, concat_node, 0); in CreateConcatNode()
947 graph->AddEdge(i.node, i.index, concat_node, dst_input); in CreateConcatNode()
1010 graph->AddEdge(concat_node, concat_out_index, slice_node, 0); in CreateSliceNode()
1011 graph->AddEdge(begin_node, 0, slice_node, 1); in CreateSliceNode()
1012 graph->AddEdge(size_node, 0, slice_node, 2); in CreateSliceNode()
[all …]
Dencapsulate_tpu_computations_pass.cc321 g->AddEdge(input_edge->src(), input_edge->src_output(), dst, dst_input); in RemoveIdentityNodesForArgRetval()
413 xla_graph->AddEdge(const_copy, 0, dst, dst_input); in MoveHeadOutsideCompilationToHost()
491 g->AddEdge(original_edge->src(), original_edge->src_output(), in MoveHeadOutsideCompilationToHost()
494 g->AddEdge(node_images[e->src()][replica_id], e->src_output(), in MoveHeadOutsideCompilationToHost()
603 g->AddEdge(src, src_output, xla_node, input_index); in MoveHeadOutsideCompilationToHost()
629 g->AddEdge(src, src_output, xla_node, in MoveHeadOutsideCompilationToHost()
642 g->AddEdge(src, original_src_output, xla_node, in MoveHeadOutsideCompilationToHost()
677 xla_graph->AddEdge(arg_node, 0, dst, dst_input); in MoveHeadOutsideCompilationToHost()
739 g->AddEdge(input_edge->src(), input_edge->src_output(), id_node, i); in MoveHeadOutsideCompilationToHost()
864 g->AddEdge(src, src_output, xla_node, dst_input); in RemoveUnusedXlaInput()
[all …]
/external/openscreen/third_party/abseil/src/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 …]
/external/libtextclassifier/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 …]
/external/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 …]
/external/webrtc/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 …]
/external/rust/crates/grpcio-sys/grpc/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 …]
/external/angle/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 …]
/external/tensorflow/tensorflow/lite/delegates/gpu/common/memory_management/
Dmin_cost_flow_assignment.cc55 AddEdge(source_, i, 1, 0); in Build()
56 AddEdge(RightPartTwin(i), sink_, 1, 0); in Build()
61 AddEdge(source_, RightPartTwin(i), 1, usage_records[i].tensor_size); in Build()
75 AddEdge(record_id, RightPartTwin(i), 1, cost); in Build()
156 void AddEdge(size_t src, size_t dst, int cap, int cost) { in AddEdge() function in tflite::gpu::__anon59e2908c0111::MinCostFlowSolver
/external/tensorflow/tensorflow/core/graph/
Dgraph_test.cc191 graph_.AddEdge(a, 0, c, 0); in TEST_F()
221 graph_.AddEdge(a, 0, c, 0); in TEST_F()
236 graph_.AddEdge(a, 0, t, 0); in TEST_F()
238 graph_.AddEdge(t, 0, t, 1); in TEST_F()
272 graph_.AddEdge(a_new, 0, c, 0); in TEST_F()
277 graph_.AddEdge(b_new, 0, c, 0); in TEST_F()
302 graph_.AddEdge(a, 0, c, 0); in TEST_F()
395 graph_.AddEdge(a, 0, b, 0); in TEST_F()
402 graph_.AddEdge(a, 1, a, 0); in TEST_F()
550 graph_.AddEdge(a, 0, c, 0); in TEST_F()
[all …]
/external/tensorflow/tensorflow/core/common_runtime/
Dreplicate_per_replica_nodes.cc63 graph->AddEdge(src, edge->src_output(), dst, edge->dst_input()); in ReplicateFromRegularDeviceToCompositeDevice()
84 graph->AddEdge(src_replicated_nodes.at(i), edge->src_output(), in ReplicateFromCompositeDeviceToCompositeDevice()
108 graph->AddEdge(replicated_node, edge->src_output(), dst, in ReplicateFromCompositeDeviceToRegularDevice()
145 graph->AddEdge(src_replicated_nodes[i], edge->src_output(), in ReplicateFromCompositeDeviceToRegularDevice()
148 graph->AddEdge(pack_node, /*x=*/0, dst, edge->dst_input()); in ReplicateFromCompositeDeviceToRegularDevice()
Dmkl_tfconversion_pass.cc199 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, dst, e->dst_input())); in InsertConversionNodeOnEdge()
284 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, n, edges[0]->dst_input())); in InsertInputConversionNode()
285 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 1, n, edges[1]->dst_input())); in InsertInputConversionNode()
286 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 2, n, edges[2]->dst_input())); in InsertInputConversionNode()
287 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 3, n, edges[3]->dst_input())); in InsertInputConversionNode()
Dgradients.cc78 g->AddEdge(input.node, input.index, read, 0); in AddZerosLike()
86 g->AddEdge(read, 0, ret, 0); in AddZerosLike()
97 g->AddEdge(input.node, input.index, ret, 0); in AddZerosLike()
331 graph_->AddEdge(nout.node, nout.index, add, i); in SumGradients()
387 graph_->AddEdge(e->src(), e->src_output(), grad, e->dst_input()); in Compute()
390 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()
421 g->AddEdge(src, src_output, n, new_dst_input)->DebugString(); in MaybeRewriteIfNode()
492 g->AddEdge(input_edge->src(), input_edge->src_output(), dst, dst_input); in MaybeRewriteIfNode()
495 g->AddEdge(n, iter->second, dst, dst_input); in MaybeRewriteIfNode()
/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()
/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/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()

12345