Home
last modified time | relevance | path

Searched refs:in_edge (Results 1 – 16 of 16) sorted by relevance

/external/tensorflow/tensorflow/core/common_runtime/
Dforward_type_inference.cc73 for (const auto& in_edge : n.in_edges()) { in input_types() local
74 if (in_edge->IsControlEdge()) { in input_types()
79 for (const auto& in_edge : n.in_edges()) { in input_types() local
80 if (in_edge->IsControlEdge()) { in input_types()
83 VLOG(5) << " in edge: " << in_edge->DebugString(); in input_types()
84 NodeDef* ndef = in_edge->src()->mutable_def(); in input_types()
89 DCHECK(t.args_size() > in_edge->src_output()) << ndef->DebugString(); in input_types()
90 input_types.at(in_edge->dst_input()) = t.args(in_edge->src_output()); in input_types()
Daccumulate_n_optimizer.cc247 for (const Edge* in_edge : n->in_edges()) { in RewriteIntoAddN() local
248 if (in_edge->IsControlEdge()) { in RewriteIntoAddN()
249 control_inputs.push_back(in_edge->src()); in RewriteIntoAddN()
251 data_inputs.emplace_back(in_edge->src(), in_edge->src_output()); in RewriteIntoAddN()
Dconstant_folding.cc387 for (const Edge* in_edge : n->in_edges()) { in AddNodeToConstantGraph() local
389 if (!in_edge->IsControlEdge()) { in AddNodeToConstantGraph()
390 Node* in = in_edge->src(); in AddNodeToConstantGraph()
395 constant_graph->AddEdge(it->second[0], in_edge->src_output(), added[0], in AddNodeToConstantGraph()
396 in_edge->dst_input()); in AddNodeToConstantGraph()
402 constant_graph->AddEdge(it->second[in_edge->src_output()], 0, added[0], in AddNodeToConstantGraph()
403 in_edge->dst_input()); in AddNodeToConstantGraph()
Ddirect_session.cc1291 for (const Edge* in_edge : n->in_edges()) { in CheckFetch() local
1292 const Node* in_node = in_edge->src(); in CheckFetch()
1293 if (pending_feeds.count({in_node->name(), in_edge->src_output()}) > 0) { in CheckFetch()
1295 in_edge->src_output(), in CheckFetch()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_while.cc448 const Edge* in_edge; in FunctionalizeLoop() local
449 TF_RETURN_IF_ERROR(arg.enter->input_edge(0, &in_edge)); in FunctionalizeLoop()
450 if (in_edge->IsControlEdge()) { in FunctionalizeLoop()
451 builder.ControlInput(in_edge->src()->name()); in FunctionalizeLoop()
454 in_edge->src()->name(), in_edge->src_output(), arg_types[i])); in FunctionalizeLoop()
464 const Edge* in_edge; in FunctionalizeLoop() local
465 TF_RETURN_IF_ERROR(arg.enter->input_edge(0, &in_edge)); in FunctionalizeLoop()
466 if (in_edge->IsControlEdge()) { in FunctionalizeLoop()
467 graph->AddControlEdge(in_edge->src(), while_node); in FunctionalizeLoop()
469 graph->AddEdge(in_edge->src(), in_edge->src_output(), while_node, i); in FunctionalizeLoop()
Dtf2xla_util.cc641 for (const string& in_edge : map_entry.second->input()) { in PruneGraphDefInto() local
642 auto id = ParseTensorName(in_edge); in PruneGraphDefInto()
903 for (const Edge* in_edge : n->in_edges()) { in ReplaceNode() local
904 g->AddEdge(in_edge->src(), in_edge->src_output(), new_node, in ReplaceNode()
905 in_edge->dst_input()); in ReplaceNode()
Dfunctionalize_cond.cc779 const Edge* in_edge; in BuildIfNode() local
780 TF_RETURN_IF_ERROR(arg->input_edge(0, &in_edge)); in BuildIfNode()
781 if (in_edge->IsControlEdge()) { in BuildIfNode()
782 builder.ControlInput(in_edge->src()->name()); in BuildIfNode()
787 in_edge->src()->name(), in_edge->src_output(), dtype)); in BuildIfNode()
/external/tensorflow/tensorflow/core/graph/
Dalgorithm.cc166 for (const Edge* in_edge : n->in_edges()) { in ReverseDFSFromHelper() local
167 if (!edge_filter || edge_filter(*in_edge)) { in ReverseDFSFromHelper()
168 nodes_sorted.emplace_back(in_edge->src()); in ReverseDFSFromHelper()
176 for (const Edge* in_edge : n->in_edges()) { in ReverseDFSFromHelper() local
177 if (!edge_filter || edge_filter(*in_edge)) { in ReverseDFSFromHelper()
178 add_work(in_edge->src()); in ReverseDFSFromHelper()
Dgraph_partition.cc373 for (const Edge* in_edge : node->in_edges()) { in OptimizeControlFlowColocation() local
374 if (in_edge->dst_input() == 0) { in OptimizeControlFlowColocation()
377 in_edge->src()->assigned_device_name()); in OptimizeControlFlowColocation()
382 for (const Edge* in_edge : node->in_edges()) { in OptimizeControlFlowColocation() local
383 if (!in_edge->IsControlEdge()) { in OptimizeControlFlowColocation()
386 in_edge->src()->assigned_device_name()); in OptimizeControlFlowColocation()
/external/tensorflow/tensorflow/core/nccl/
Dnccl_rewrite.cc144 const Edge* in_edge = nullptr; in ReplaceBroadcast() local
145 TF_RETURN_IF_ERROR(node->input_edge(0, &in_edge)); in ReplaceBroadcast()
146 Node* in_node = in_edge->src(); in ReplaceBroadcast()
147 int in_index = in_edge->src_output(); in ReplaceBroadcast()
/external/tensorflow/tensorflow/compiler/jit/
Dpartially_decluster_pass.cc144 for (const Edge* in_edge : n->in_edges()) { in PartiallyDeclusterNode() local
145 graph->AddEdge(in_edge->src(), in_edge->src_output(), cloned_node, in PartiallyDeclusterNode()
146 in_edge->dst_input()); in PartiallyDeclusterNode()
Ddeadness_analysis.cc903 for (const Edge* in_edge : n->in_edges()) { in GetInputPreds() local
906 (in_edge->IsControlEdge() && edge_kind == EdgeKind::kControlOnly) || in GetInputPreds()
907 (!in_edge->IsControlEdge() && edge_kind == EdgeKind::kDataOnly); in GetInputPreds()
910 auto it = predicate_map_.find(InputEdgeToTensorId(in_edge)); in GetInputPreds()
918 return errors::Internal("Could not find input ", in_edge->DebugString(), in GetInputPreds()
/external/tensorflow/tensorflow/core/distributed_runtime/
Dscheduler.cc148 for (const Edge* in_edge : curr->in_edges()) { in ComputeAlap() local
151 const Node* src = in_edge->src(); in ComputeAlap()
152 if (!in_edge->IsControlEdge() && in ComputeAlap()
Dmaster_session.cc1077 for (const Edge* in_edge : n->in_edges()) { in CheckFetches() local
1078 const Node* in_node = in_edge->src(); in CheckFetches()
1079 if (pending_feeds.count({in_node->name(), in_edge->src_output()}) > 0) { in CheckFetches()
1081 in_edge->src_output(), in CheckFetches()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc590 for (const SimpleEdge* in_edge : in_edges) { in ContractEdge() local
591 if (in_edge->IsControlEdge()) { in ContractEdge()
592 if (in_edge->src() != src) { in ContractEdge()
593 SimpleEdge* e = const_cast<SimpleEdge*>(in_edge); in ContractEdge()
597 if (in_edge->src() != src) { in ContractEdge()
598 SimpleEdge* e = const_cast<SimpleEdge*>(in_edge); in ContractEdge()
629 for (const auto& in_edge : dst->in_edges()) { in ContractEdge() local
630 remove_edges->push_back(in_edge); in ContractEdge()
Dsegment_test.cc50 return [node_names](const Edge* in_edge) -> bool { in MakeInputEdgeCandidateFn() argument
51 return node_names.find(in_edge->dst()->name()) != node_names.end(); in MakeInputEdgeCandidateFn()