Home
last modified time | relevance | path

Searched refs:dst_input (Results 1 – 25 of 74) sorted by relevance

123

/external/tensorflow/tensorflow/compiler/tf2xla/
Drearrange_function_argument.cc120 int dst_input = e->dst_input(); in ReorderInputEdges() local
121 int new_dst_input = index_mapping.at(dst_input); in ReorderInputEdges()
146 int dst_input = e->dst_input(); in ReorderOutputEdges() local
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()
239 int dst_input = e->dst_input(); in RearrangeOutputEdges() local
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()
410 if (e->IsControlEdge() || e->dst_input() == 0) { in MaybeRewriteIfNode()
418 int dst_input = e->dst_input(); in MaybeRewriteIfNode() local
[all …]
Dfunctionalize_while.cc105 output->AddEdge(src_copy, src_output, dst_copy, e->dst_input()); in CopySubgraph()
255 int dst_input = edges[i]->dst_input(); in FunctionalizeLoop() local
257 graph->AddEdge(new_arg.enter, 0, dst, dst_input); in FunctionalizeLoop()
279 edge->dst_input() == 1) { in FunctionalizeLoop()
334 TF_RETURN_IF_ERROR(arg.merge->input_node(1 - enter_merge->dst_input(), in FunctionalizeLoop()
346 if (edge->dst_input() == 0 && IsSwitch(edge->dst()) && in FunctionalizeLoop()
483 int dst_input = edge->dst_input(); in FunctionalizeLoop() local
486 if (dst_input == Graph::kControlSlot) { in FunctionalizeLoop()
489 graph->AddEdge(while_node, i, dst, dst_input); in FunctionalizeLoop()
Dtf2xla_util.cc136 int dst_node_id, dst_input; in ReplaceArgUsageWithConstNode() member
143 usages.push_back({e->dst()->id(), e->dst_input()}); in ReplaceArgUsageWithConstNode()
150 *replace_def.mutable_input(usages[i].dst_input) = const_node->name(); in ReplaceArgUsageWithConstNode()
155 replace_node->input_edge(usages[i].dst_input, &usage_edge)); in ReplaceArgUsageWithConstNode()
157 g->AddEdge(const_node, 0, replace_node, usages[i].dst_input); in ReplaceArgUsageWithConstNode()
648 edge->dst_input()); in RewriteAssociatedFunction()
652 edge->dst_input()); in RewriteAssociatedFunction()
726 {edge->dst(), edge->src_output(), edge->dst_input()}); in ReplaceNode()
735 in_edge->dst_input()); in ReplaceNode()
738 g->AddEdge(new_node, out_edge.src_output, out_edge.dst, out_edge.dst_input); in ReplaceNode()
[all …]
Dfunctionalize_cond.cc469 int dst_input = IsMerge(e->dst()) ? 0 : e->dst_input(); in BuildArgumentNodes() local
470 bodies_[branch_index]->AddEdge(src_copy, 0, dst_copy, dst_input); in BuildArgumentNodes()
523 int dst_input = edge->dst_input(); in AddSwitchNodeAlongEdge() local
525 graph->AddEdge(switch_node, static_cast<int>(branch), dst, dst_input); in AddSwitchNodeAlongEdge()
711 output->AddEdge(src_copy, src_output, dst_copy, e->dst_input()); in ExtractBodies()
893 int dst_input = edge->dst_input(); in AddOutputEdges() local
905 graph->AddEdge(if_node_, i, dst, dst_input); in AddOutputEdges()
1241 int dst_port = oe->dst_input(); in RemoveRedundantMerge()
1294 int dst_input = e->dst_input(); in RemoveRedundantSwitch() local
1317 dst_node, dst_input); in RemoveRedundantSwitch()
/external/tensorflow/tensorflow/compiler/jit/
Dencapsulate_util.cc119 int dst_input, dst_node_id; in PreprocessDataEdgesBetweenOutsideCompilations() member
134 edges.push_back(EdgeInfo{e->dst_input(), e->dst()->id()}); in PreprocessDataEdgesBetweenOutsideCompilations()
145 TF_RETURN_IF_ERROR(dst->input_edge(edges[i].dst_input, &e)); in PreprocessDataEdgesBetweenOutsideCompilations()
147 int src_output = e->src_output(), dst_input = e->dst_input(); in PreprocessDataEdgesBetweenOutsideCompilations() local
178 g->AddEdge(placeholder_node, 0, dst, dst_input); in PreprocessDataEdgesBetweenOutsideCompilations()
182 *new_def.mutable_input(dst_input) = placeholder_node->name(); in PreprocessDataEdgesBetweenOutsideCompilations()
234 data_edges.push_back({e->dst(), e->src_output(), e->dst_input()}); in PostprocessDataEdgesBetweenOutsideCompilations()
244 int dst_input = data_edges[i].dst_input; in PostprocessDataEdgesBetweenOutsideCompilations() local
245 *new_def.mutable_input(dst_input) = in PostprocessDataEdgesBetweenOutsideCompilations()
250 TF_RETURN_IF_ERROR(replace_node->input_edge(dst_input, &edge_to_replace)); in PostprocessDataEdgesBetweenOutsideCompilations()
[all …]
Dclone_constants_for_better_clustering.cc49 g->AddEdge(e->src(), e->src_output(), new_in, e->dst_input()); in CloneNode()
124 int dst_input = e->dst_input(); in CloneSmallHostConstantInputs() local
130 g->AddEdge(input_cloned, 0, n, dst_input); in CloneSmallHostConstantInputs()
Dshape_inference_helpers.cc36 BackEdge{e, e->src(), e->src_output(), e->dst(), e->dst_input()}); in Remove()
61 graph_->AddEdge(be.src, be.src_output, be.dst, be.dst_input); in Replace()
Dpartially_decluster_pass.cc98 dst_input_mtypes[e->dst_input()] == HOST_MEMORY; in FindNodesToDecluster()
148 in_edge->dst_input()); in PartiallyDeclusterNode()
153 out_edge_to_clone->dst(), out_edge_to_clone->dst_input()); in PartiallyDeclusterNode()
Dextract_outside_compilation_pass.cc151 {edge->dst(), edge->src_output(), edge->dst_input()}); in ReplaceArgNodesWithRecvAtHostNode()
155 if (edge.dst_input == Graph::kControlSlot) { in ReplaceArgNodesWithRecvAtHostNode()
158 g->AddEdge(recv_at_host_node, index, edge.dst, edge.dst_input); in ReplaceArgNodesWithRecvAtHostNode()
165 if (edge.dst_input == Graph::kControlSlot) { in ReplaceArgNodesWithRecvAtHostNode()
171 *new_def.mutable_input(edge.dst_input) = in ReplaceArgNodesWithRecvAtHostNode()
299 results[e->dst_input()] = shape; in GetInferredInputShapes()
366 if (e->dst_input() < 0 || e->dst_input() >= input_dtypes_size) { in BuildXlaHostComputeNodeDef()
367 return errors::Internal("Invalid dst_input: ", e->dst_input()); in BuildXlaHostComputeNodeDef()
369 inputs[e->dst_input()] = NodeDefBuilder::NodeOut{ in BuildXlaHostComputeNodeDef()
370 e->src()->name(), e->src_output(), input_dtypes[e->dst_input()]}; in BuildXlaHostComputeNodeDef()
[all …]
Dencapsulate_subgraphs_pass.cc438 return args_by_dst_.at(InputTensor(edge->dst(), edge->dst_input())); in GetArgIndexForEdge()
483 DataType dtype = edge->dst()->input_type(edge->dst_input()); in RecordArg()
497 int dst_slot = edge->dst_input(); in RecordArg()
725 g->AddEdge(src_image, edge->src_output(), dst_image, edge->dst_input()); in CopySubgraphEdges()
756 DataType dtype = edge->dst()->input_type(edge->dst_input()); in CopySubgraphEdges()
907 return edge->dst_input(); in FindOutputSlotOfEdgeDst()
940 int dst_input = FindOutputSlotOfEdgeDst(src_func_id, dst_func_id, edge); in CopyEdgeToOutputGraph() local
945 InputTensor(dst_image, dst_input)) in CopyEdgeToOutputGraph()
947 graph_out->AddEdge(src_image, src_output, dst_image, dst_input); in CopyEdgeToOutputGraph()
1063 out_edge->dst_input()); in MakePrunedGraphCopyAndInline()
Dbuild_xla_ops_pass.cc72 g->AddEdge(new_node, edge->src_output(), edge->dst(), edge->dst_input()); in MoveOutgoingEdges()
166 int dst_idx = e->dst_input(); in MergeOutgoingDataEdges()
308 args[e->dst_input()] = Output(e->src(), e->src_output()); in ReplaceFunctionCallWithPartitionedCall()
334 e->dst_input()); in ReplaceFunctionCallWithPartitionedCall()
440 int32_inputs_input_idxs.push_back(e->dst_input()); in PredicateInt32Inputs()
Dshape_inference.cc157 int dst_input = e->dst_input(); in PropagateShapes() local
159 graph->AddEdge(const_node, 0, dst, dst_input); in PropagateShapes()
/external/tensorflow/tensorflow/core/common_runtime/
Dshape_refiner.cc208 if (e->dst_input() < 0) { in AddNodeInternal()
210 "Index ", e->dst_input(), " is negative but not a control edge."); in AddNodeInternal()
218 ic->SetInput(e->dst_input(), ic->UnknownShape()); in AddNodeInternal()
223 ic->SetInput(e->dst_input(), input_ic->output(e->src_output())); in AddNodeInternal()
230 ic->set_input_handle_shapes_and_types(e->dst_input(), in AddNodeInternal()
307 int dst_input = e->dst_input(); in UpdateNode() local
314 "Input ", dst_input, " ('", input->name(), "') for '", node->name(), in UpdateNode()
319 DCHECK_GE(dst_input, 0); in UpdateNode()
320 ShapeHandle existing_input = node_context->input(dst_input); in UpdateNode()
322 if (node_context->MergeInput(dst_input, c->output(src_output))) { in UpdateNode()
[all …]
Dmkl_tfconversion_pass.cc154 DataType dst_datatype = dst->input_type(e->dst_input()); in InsertConversionNodeOnEdge()
161 ":" + std::to_string(e->dst_input()) + in InsertConversionNodeOnEdge()
199 CHECK_NOTNULL((*g)->AddEdge(conversion_node, 0, dst, e->dst_input())); in InsertConversionNodeOnEdge()
232 CHECK_EQ((edges[i]->dst_input() == i), true); in InsertInputConversionNode()
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()
Dfunction_utils.cc152 g->AddEdge(in->src(), in->src_output(), out->dst(), out->dst_input()); in RemoveIdentityNodes()
203 const int index = e->dst_input(); in RemoveListArrayConverter()
208 << e->dst_input(); in RemoveListArrayConverter()
242 g->AddEdge(id_node, 0, e->dst(), e->dst_input()); in RemoveListArrayConverter()
333 if (inputs[e->dst_input()] == nullptr) { in ToGraphDef()
334 inputs[e->dst_input()] = e; in ToGraphDef()
Dmemory_types.cc83 MemoryType dm = gtl::FindWithDefault(inp, {e->dst()->id(), e->dst_input()}, in ProcessMemoryTypes()
86 << e->dst()->id() << ":" << e->dst_input() << ": " << sm << " -> " in ProcessMemoryTypes()
102 e->dst_input(), " : from ", in ValidateMemoryTypes()
202 g->AddEdge(recv, 0, e->dst(), e->dst_input()); in EnsureMemoryTypes()
Dreplicate_per_replica_nodes.cc63 graph->AddEdge(src, edge->src_output(), dst, edge->dst_input()); in ReplicateFromRegularDeviceToCompositeDevice()
85 dst_replicated_nodes.at(i), edge->dst_input()); in ReplicateFromCompositeDeviceToCompositeDevice()
109 edge->dst_input()); in ReplicateFromCompositeDeviceToRegularDevice()
148 graph->AddEdge(pack_node, /*x=*/0, dst, edge->dst_input()); in ReplicateFromCompositeDeviceToRegularDevice()
Dplacer_inspection_required_ops_utils.cc248 int dst_input = edge->dst_input(); in AddOutputIdentities() local
255 << " -> " << dst->name() << ":" << dst_input << " \n" in AddOutputIdentities()
260 TF_RETURN_IF_ERROR(graph->UpdateEdge(identity_node, 0, dst, dst_input)); in AddOutputIdentities()
Dconstant_folding.cc77 DCHECK_GE(in->dst_input(), 0); in ReadPartialShapesFromShapeMap()
78 DCHECK_LT(in->dst_input(), input_shapes->size()); in ReadPartialShapesFromShapeMap()
79 (*input_shapes)[in->dst_input()] = known_shape[in->src_output()]; in ReadPartialShapesFromShapeMap()
399 in_edge->dst_input()); in AddNodeToConstantGraph()
406 in_edge->dst_input()); in AddNodeToConstantGraph()
572 graph->AddEdge(constant_node, 0, edge->dst(), edge->dst_input()); in ReplaceTensorWithConstant()
Dparallel_concat_optimizer.cc87 .Attr("loc", input_edge->dst_input()) in Run()
108 g->AddEdge(identity_node, 0, e->dst(), e->dst_input()); in Run()
Dlower_while_op.cc249 if (IsResource(edge->dst_input())) { in CreateEnterNodes()
253 enter_nodes_[edge->dst_input()] = enter_node; in CreateEnterNodes()
478 e->dst_input()); in UpdateConsumers()
488 e->dst_input()); in UpdateConsumers()
/external/tensorflow/tensorflow/core/tpu/graph_rewrite/
Dencapsulate_tpu_computations_pass.cc269 return edge->dst()->input_type(edge->dst_input()); in EdgeType()
319 int dst_input = e->dst_input(); in RemoveIdentityNodesForArgRetval() local
321 g->AddEdge(input_edge->src(), input_edge->src_output(), dst, dst_input); in RemoveIdentityNodesForArgRetval()
411 int dst_input = e->dst_input(); in MoveHeadOutsideCompilationToHost() local
413 xla_graph->AddEdge(const_copy, 0, dst, dst_input); in MoveHeadOutsideCompilationToHost()
492 copy_node, e->dst_input()); in MoveHeadOutsideCompilationToHost()
495 copy_node, e->dst_input()); in MoveHeadOutsideCompilationToHost()
675 int dst_input = original_edge->dst_input(); in MoveHeadOutsideCompilationToHost() local
677 xla_graph->AddEdge(arg_node, 0, dst, dst_input); in MoveHeadOutsideCompilationToHost()
861 int dst_input = i * num_new_per_replica_inputs + iter->second; in RemoveUnusedXlaInput() local
[all …]
Ddistributed_tpu_rewrite_pass.cc553 int dst_input = edge->dst_input(); in ReplaceCompilationResultNodeWithIdentity() local
558 graph->AddEdge(id_node, src_output, dst, dst_input); in ReplaceCompilationResultNodeWithIdentity()
945 int dst_input = 1; in CreateConcatNode() local
947 graph->AddEdge(i.node, i.index, concat_node, dst_input); in CreateConcatNode()
948 ++dst_input; in CreateConcatNode()
1864 if (index != call_edge->dst_input()) continue; in InferXlaShardingFromNeighbors()
2565 input_index = e->dst_input(); in ConnectHostComputeNodes()
2927 std::vector<Node*>& nodes = replicate_input_fan_in_nodes[e->dst_input()]; in BuildExecuteNodes()
2930 << " for replicate_input_fan_in_nodes[" << e->dst_input() << "]"; in BuildExecuteNodes()
2936 nodes[fe->dst_input()] = fe->src(); in BuildExecuteNodes()
[all …]
/external/tensorflow/tensorflow/core/graph/
Dgraph.cc261 if (edge->dst_input() == idx) { in input_edge()
277 if (edge->dst_input() < 0 || edge->dst_input() >= num_inputs()) { in input_edges()
278 return errors::Internal("Invalid edge input number ", edge->dst_input()); in input_edges()
280 if ((*input_edges)[edge->dst_input()] != nullptr) { in input_edges()
282 edge->dst_input()); in input_edges()
284 (*input_edges)[edge->dst_input()] = edge; in input_edges()
444 AddEdge(src_copy, e->src_output(), dst_copy, e->dst_input()); in Copy()
611 if (e->dst_input() == index) return e; in FindEdge()
717 DCHECK(edge->dst_input() < inputs.size()) in ToGraphDefSubRange()
721 CHECK(inputs[edge->dst_input()] == nullptr) in ToGraphDefSubRange()
[all …]
/external/tensorflow/tensorflow/cc/framework/
Dops.cc32 if (e->dst_input() == i) { in input()
58 inputs[e->dst_input()] = std::make_pair(e->src(), e->src_output()); in GetInputs()

123