HomeSort by relevance Sort by last modified time
    Searched refs:AddEdge (Results 1 - 25 of 54) sorted by null

1 2 3

  /external/tensorflow/tensorflow/compiler/jit/graphcycles/
graphcycles_test.cc 390 bool AddEdge(int x, int y) { return g_.InsertEdge(x, y); }
395 EXPECT_TRUE(AddEdge(x, 2 * x)) << x;
396 EXPECT_TRUE(AddEdge(x, 3 * x)) << x;
427 EXPECT_FALSE(AddEdge(8, 4));
434 EXPECT_TRUE(AddEdge(16, 9));
436 EXPECT_FALSE(AddEdge(9, 2));
442 ASSERT_TRUE(AddEdge(2, 4));
443 ASSERT_TRUE(AddEdge(4, 6));
444 ASSERT_TRUE(AddEdge(6, 8));
445 ASSERT_TRUE(AddEdge(8, 10))
    [all...]
  /external/tensorflow/tensorflow/contrib/tensorrt/segment/
segment.cc 86 graph->AddEdge(e->src(), e->src_output(), src,
89 graph->AddEdge(e->src(), e->src_output(), src, 0 /* input index */);
99 graph->AddEdge(src, tensorflow::Graph::kControlSlot, e->dst(),
102 graph->AddEdge(src, 0 /* output index */, e->dst(), e->dst_input());
  /external/tensorflow/tensorflow/core/common_runtime/
function_testlib.cc 73 scope->graph()->AddEdge(inputs[i].node(), inputs[i].index(), n, i);
parallel_concat_optimizer.cc 114 g->AddEdge(identity_node, 0, e->dst(), e->dst_input());
accumulate_n_optimizer.cc 171 g->AddEdge(clean_up_accumulator, 0, out_edge->dst(),
constant_folding.cc 365 constant_graph->AddEdge(it->second[0], in_edge->src_output(), added[0],
372 constant_graph->AddEdge(it->second[in_edge->src_output()], 0, added[0],
535 graph->AddEdge(constant_node, 0, edge->dst(), edge->dst_input());
function.cc 108 g->AddEdge(input.node, input.index, ret, 0);
138 g->AddEdge(input.node, input.index, ret, 0);
    [all...]
memory_types.cc 197 g->AddEdge(recv, 0, e->dst(), e->dst_input());
  /external/tensorflow/tensorflow/core/graph/
mkl_tfconversion_pass.cc 193 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, dst, e->dst_input()));
273 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, n, edges[0]->dst_input()));
274 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 1, n, edges[1]->dst_input()));
275 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 2, n, edges[2]->dst_input()));
276 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 3, n, edges[3]->dst_input()));
graph_test.cc 188 graph_.AddEdge(a, 0, c, 0);
218 graph_.AddEdge(a, 0, c, 0);
233 graph_.AddEdge(a, 0, t, 0);
235 graph_.AddEdge(t, 0, t, 1);
269 graph_.AddEdge(a_new, 0, c, 0);
274 graph_.AddEdge(b_new, 0, c, 0);
299 graph_.AddEdge(a, 0, c, 0);
392 graph_.AddEdge(a, 0, b, 0);
399 graph_.AddEdge(a, 1, a, 0);
547 graph_.AddEdge(a, 0, c, 0)
    [all...]
gradients.cc 76 g->AddEdge(input.node, input.index, ret, 0);
294 graph_->AddEdge(nout.node, nout.index, add, i);
350 graph_->AddEdge(e->src(), e->src_output(), grad, e->dst_input());
353 graph_->AddEdge(dy[i].node, dy[i].index, grad, num_x + i);
node_builder.cc 120 graph->AddEdge(inputs_[i].node, inputs_[i].index, node, i);
optimizer_cse.cc 213 g_->AddEdge(*candidate, e->src_output(), e->dst(), e->dst_input());
graph_partition.cc 521 g->AddEdge(enter, 0, merge, 0);
522 g->AddEdge(next, 0, merge, 1);
666 g->AddEdge(const_node, 0, child_loop.enter, 0);
675 g->AddEdge(it->second.merge, 0, child_loop.enter, 0);
698 g->AddEdge(curr_loop.merge, 0, child_loop.enter, 0);
    [all...]
  /external/tensorflow/tensorflow/compiler/jit/
build_xla_launch_ops_pass.cc 95 graph->AddEdge(edge->src(), edge->src_output(), launch_node,
112 graph->AddEdge(launch_node, src_output, dst, dst_input);
encapsulate_subgraphs_pass.cc 682 graph_->AddEdge(args_[arg_index], 0, dst_image, dst_slot);
710 graph_->AddEdge(src_image, src_slot, ret, 0);
    [all...]
  /external/tensorflow/tensorflow/contrib/nccl/kernels/
nccl_rewrite.cc 96 graph->AddEdge(recv_node, 0, out_node.node, out_node.index);
152 graph->AddEdge(in_node, in_index, out_node.node, out_node.index);
193 graph->AddEdge(in_node.node, in_node.index, out_node.node,
233 graph->AddEdge(recv_node, 0, out_node.node, out_node.index);
  /external/llvm/unittests/ADT/
SCCIteratorTest.cpp 111 /// AddEdge - Add an edge from the node with index FromIdx to the node with
113 void AddEdge(unsigned FromIdx, unsigned ToIdx) {
264 G.AddEdge(i, j);
268 G.AddEdge(i, j);
  /external/swiftshader/third_party/LLVM/unittests/ADT/
SCCIteratorTest.cpp 113 /// AddEdge - Add an edge from the node with index FromIdx to the node with
115 void AddEdge(unsigned FromIdx, unsigned ToIdx) {
266 G.AddEdge(i, j);
270 G.AddEdge(i, j);
  /external/chromium-trace/catapult/common/py_vulcanize/py_vulcanize/
project.py 162 g.AddEdge(m, dep.id)
197 g.AddEdge(out_dep, cur)
225 def AddEdge(self, mFrom, mTo):
  /external/tensorflow/tensorflow/core/debug/
debug_graph_utils.cc 162 graph->AddEdge(src_node, src_output_slot, copy_node, 0);
174 graph->AddEdge(copy_node, 0, debug_node, 0);
199 graph->AddEdge(copy_node, 0, edge->dst(), edge->dst_input());
207 graph->AddEdge(debug_node, Graph::kControlSlot, edge->dst(),
  /external/tensorflow/tensorflow/compiler/tf2xla/
functionalize_control_flow.cc 154 output->AddEdge(src_copy, src_output, dst_copy, e->dst_input());
261 output->AddEdge(arg_node, 0, retval_node, 0);
316 graph->AddEdge(e->src(), e->src_output(), new_arg.enter,
322 graph->AddEdge(new_arg.enter, 0, dst, dst_input);
523 graph->AddEdge(in_edge->src(), in_edge->src_output(), while_node, i);
539 graph->AddEdge(while_node, i, dst, dst_input);
    [all...]
functionalize_control_flow_test.cc 225 scope.graph()->AddEdge(next_iteration.node(), 0, merge.output.node(), 1);
336 scope.graph()->AddEdge(next_iteration.node(), 0, merge.output.node(), 1);
474 scope.graph()->AddEdge(next_iteration_x.node(), 0, merge_x.output.node(),
476 scope.graph()->AddEdge(next_iteration_y.node(), 0, merge_y.output.node(),
705 scope.graph()->AddEdge(next_iteration_i.node(), 0, merge_i.output.node(),
707 scope.graph()->AddEdge(next_iteration_j.node(), 0, merge_j.output.node(),
709 scope.graph()->AddEdge(next_iteration_k.node(), 0, merge_k.output.node(),
    [all...]
  /external/tensorflow/tensorflow/cc/ops/
while_loop.cc 222 scope.graph()->AddEdge(next_outputs[i].node(), next_outputs[i].index(),
  /external/clang/lib/StaticAnalyzer/Frontend/
AnalysisConsumer.cpp 735 void AddEdge(ExplodedNode *Src, ExplodedNode *Dst) override;
751 void UbigraphViz::AddEdge(ExplodedNode *Src, ExplodedNode *Dst) {

Completed in 360 milliseconds

1 2 3