| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| const_analysis.cc | 79 if (edge->dst_input() >= name_range->second.first &&
80 edge->dst_input() < name_range->second.second) {
|
| functionalize_control_flow.cc | 154 output->AddEdge(src_copy, src_output, dst_copy, e->dst_input());
320 int dst_input = edges[i]->dst_input(); local
322 graph->AddEdge(new_arg.enter, 0, dst, dst_input);
343 edge->dst_input() == 1) {
396 TF_RETURN_IF_ERROR(arg.merge->input_node(1 - enter_merge->dst_input(),
408 if (edge->dst_input() == 0 && IsSwitch(edge->dst()) &&
533 int dst_input = edge->dst_input(); local
536 if (dst_input == Graph::kControlSlot)
1299 int dst_input = edge->dst_input(); local
[all...] |
| graph_compiler.cc | 137 tensor_inputs_.at(e->dst_input()) = src_outputs.at(e->src_output());
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| build_xla_launch_ops_pass.cc | 96 edge->dst_input());
106 int dst_input = edge->dst_input(); local
112 graph->AddEdge(launch_node, src_output, dst, dst_input);
|
| graph_to_functiondef.cc | 171 // Edges, indexed by dst_input.
180 if (in_edges.size() <= edge->dst_input()) {
181 in_edges.resize(edge->dst_input() + 1);
183 in_edges[edge->dst_input()] = edge;
|
| encapsulate_subgraphs_pass.cc | 604 return args_by_dst_.at(NodeSlot(edge->dst(), edge->dst_input()));
632 .outputs_by_dst.at(NodeSlot(edge->dst(), edge->dst_input()));
666 DataType dtype = edge->dst()->input_type(edge->dst_input());
680 int dst_slot = edge->dst_input();
1545 int dst_input = local
[all...] |
| /external/tensorflow/tensorflow/core/common_runtime/ |
| shape_refiner.cc | 225 "Input ", e->dst_input(), " ('", input->name(), "') for '",
230 DCHECK_GE(e->dst_input(), 0);
231 input_nodes[e->dst_input()] = input;
232 input_shapes[e->dst_input()] = c->output(e->src_output());
238 input_handle_shapes_and_types[e->dst_input()].reset(
324 int dst_input = e->dst_input(); local
331 "Input ", dst_input, " ('", input->name(), "') for '", node->name(),
336 DCHECK_GE(dst_input, 0);
337 ShapeHandle existing_input = node_context->input(dst_input);
[all...] |
| memory_types.cc | 83 MemoryType dm = gtl::FindWithDefault(inp, {e->dst()->id(), e->dst_input()},
86 << e->dst()->id() << ":" << e->dst_input() << ": " << sm << " -> "
102 e->dst()->id(), ":", e->dst_input(), " : from ",
197 g->AddEdge(recv, 0, e->dst(), e->dst_input());
|
| parallel_concat_optimizer.cc | 114 g->AddEdge(identity_node, 0, e->dst(), e->dst_input());
|
| accumulate_n_optimizer.cc | 172 out_edge->dst_input());
|
| function.cc | [all...] |
| constant_folding.cc | 366 in_edge->dst_input());
373 in_edge->dst_input());
535 graph->AddEdge(constant_node, 0, edge->dst(), edge->dst_input());
|
| /external/tensorflow/tensorflow/core/graph/ |
| mkl_tfconversion_pass.cc | 193 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, dst, e->dst_input()));
226 CHECK_EQ((edges[i]->dst_input() == i), true);
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.cc | 212 if (edge->dst_input() == idx) {
228 if (edge->dst_input() < 0 || edge->dst_input() >= num_inputs()) {
229 return errors::Internal("Invalid edge input number ", edge->dst_input());
231 if ((*input_edges)[edge->dst_input()] != nullptr) {
233 edge->dst_input());
235 (*input_edges)[edge->dst_input()] = edge;
492 if (e->dst() == dst && e->dst_input() == index) {
560 CHECK(inputs[edge->dst_input()] == nullptr)
562 << edge->dst()->DebugString() << " with dst_input "
[all...] |
| optimizer_cse.cc | 76 (*in)[e->dst_input()] = std::make_pair(e->src(), e->src_output());
213 g_->AddEdge(*candidate, e->src_output(), e->dst(), e->dst_input());
|
| gradients.cc | 93 n_inputs[e->dst_input()] = {e->src(), e->src_output()};
350 graph_->AddEdge(e->src(), e->src_output(), grad, e->dst_input());
359 BackpropAlongEdge({grad, e->dst_input()}, {e->src(), e->src_output()});
|
| mkl_tfconversion_pass_test.cc | 83 EdgeId(e->dst(), e->dst_input())));
|
| graph_partition.cc | 116 return e->dst()->input_type(e->dst_input());
130 int dst_port = edge->dst_input();
142 // Return true iff (dst, dst_input) is specified on host memory.
145 int dst_port = edge->dst_input();
243 const int dst_port = edge->dst_input();
332 if (in_edge->dst_input() == 0) {
[all...] |
| mkl_layout_pass.cc | 756 fe->dst_input() == 0) {
[all...] |
| graph_test.cc | 125 e->dst_input() == Graph::kControlSlot) {
227 EXPECT_EQ(0, e->dst_input());
245 EXPECT_EQ(1, e->dst_input());
461 EXPECT_EQ(edge->dst_input(), Graph::kControlSlot);
|
| optimizer_cse_test.cc | 79 EdgeId(e->dst(), e->dst_input())));
|
| costmodel.cc | 495 inputs[e->dst_input()] = e;
516 alias_to_input = e->dst_input();
|
| /external/tensorflow/tensorflow/cc/framework/ |
| ops.cc | 32 if (e->dst_input() == i) {
58 inputs[e->dst_input()] = std::make_pair(e->src(), e->src_output());
|
| /external/tensorflow/tensorflow/contrib/tensorrt/segment/ |
| segment.cc | 100 e->dst_input());
102 graph->AddEdge(src, 0 /* output index */, e->dst(), e->dst_input());
|
| /external/tensorflow/tensorflow/contrib/nccl/kernels/ |
| nccl_rewrite.cc | 51 out_nodes.emplace_back(edge->dst(), edge->dst_input());
137 it->emplace_front(NodeBuilder::NodeOut(edge->dst(), edge->dst_input()));
|
