Home
last modified time | relevance | path

Searched refs:in_edges (Results 1 – 25 of 75) sorted by relevance

123

/external/tensorflow/tensorflow/core/common_runtime/
Dquantize_training.cc109 for (const Edge* edge : node->in_edges()) { in FindType()
119 for (const Edge* edge : node->in_edges()) { in FindType()
138 std::vector<const Edge*>* in_edges, bool* found) { in FindSaveOp() argument
148 TF_RETURN_IF_ERROR(node->input_edges(in_edges)); in FindSaveOp()
184 const std::vector<const Edge*>& in_edges, in ConnectVariablesToSaveOp() argument
186 Node* tensor_names_op = in_edges[1]->src(); in ConnectVariablesToSaveOp()
187 Node* shape_and_slices_op = in_edges[2]->src(); in ConnectVariablesToSaveOp()
205 save_op_builder = save_op_builder.Input(in_edges[i]->src()); in ConnectVariablesToSaveOp()
210 for (int i = 3; i < in_edges.size(); i++) { in ConnectVariablesToSaveOp()
211 var_nodeouts.emplace_back(in_edges[i]->src()); in ConnectVariablesToSaveOp()
[all …]
Dgradients.cc113 for (const Edge* e : n->in_edges()) { in AddSymGrad()
272 for (const Edge* e : n->in_edges()) { in InitBackprop()
294 for (const Edge* e : y->in_edges()) { in InitBackprop()
374 for (const Edge* e : n->in_edges()) { in Compute()
385 for (const Edge* e : n->in_edges()) { in Compute()
394 for (const Edge* e : n->in_edges()) { in Compute()
Dinline_function_utils.cc123 std::vector<string> input_devices(caller.in_edges().size()); in InputDevices()
124 std::vector<string> input_tensors(caller.in_edges().size()); in InputDevices()
126 for (const Edge* edge : caller.in_edges()) { in InputDevices()
571 for (const Edge* e : caller->in_edges()) { in InlineFunctionBody()
657 (absl::c_none_of(n->in_edges(), is_input_edge) || // (a) in InlineFunctionBody()
659 absl::c_none_of(n->in_edges(), is_control_edge))) && // in InlineFunctionBody()
736 for (const Edge* e : ret->in_edges()) { in InlineFunctionBody()
749 for (const Edge* e : ret->in_edges()) { in InlineFunctionBody()
789 if (output_control_node && output_control_node->in_edges().empty()) { in InlineFunctionBody()
Dfunction_utils.cc136 if (!GetTheOnlyDataEdge(n->in_edges())) continue; in RemoveIdentityNodes()
147 const Edge* in = GetTheOnlyDataEdge(n->in_edges()); in RemoveIdentityNodes()
192 for (const Edge* e : n->in_edges()) { in RemoveListArrayConverter()
329 for (const Edge* e : n->in_edges()) { in ToGraphDef()
Dconstant_folding_test.cc436 ASSERT_EQ(2, p->in_edges().size()); in TEST_F()
437 for (const Edge* e : p->in_edges()) { in TEST_F()
506 ASSERT_EQ(3, cf0->in_edges().size()); in TEST_F()
507 for (const Edge* e : cf0->in_edges()) { in TEST_F()
513 ASSERT_EQ(2, cf1->in_edges().size()); in TEST_F()
514 for (const Edge* e : cf1->in_edges()) { in TEST_F()
519 ASSERT_EQ(2, cf2->in_edges().size()); in TEST_F()
520 for (const Edge* e : cf2->in_edges()) { in TEST_F()
627 ASSERT_EQ(1, cf0->in_edges().size()); in TEST_F()
628 for (const Edge* e : cf0->in_edges()) { in TEST_F()
Dimmutable_executor_state.cc48 const size_t num_in_edges = n->in_edges().size(); in GetMaxPendingCounts()
54 for (const Edge* edge : n->in_edges()) { in GetMaxPendingCounts()
208 if (n->in_edges().empty()) { in Initialize()
297 if (n->in_edges().empty()) { in BuildControlFlowInfo()
Daccumulate_n_optimizer.cc132 for (const Edge* input_edge : n->in_edges()) { in RewriteIntoTempVariable()
246 control_inputs.reserve(n->in_edges().size() - n->num_inputs()); in RewriteIntoAddN()
247 for (const Edge* in_edge : n->in_edges()) { in RewriteIntoAddN()
Dmkl_layout_pass.cc1193 for (const Edge* e : m->in_edges()) { in GetPadOrConv2D()
1243 for (const Edge* e : m->in_edges()) { in GetPadOrFusedConv2D()
1397 for (const Edge* e : node->in_edges()) { in CheckForTranspose()
1406 for (const Edge* e : node->in_edges()) { in CheckForTranspose()
1500 for (auto e : n->in_edges()) { in RewriteIfAtleastOneMklInput()
1614 for (const Edge* e : n->in_edges()) { in LrnGradRewrite()
1709 for (const Edge* e : n->in_edges()) { in MaxpoolGradRewrite()
1726 for (const Edge* e : n->in_edges()) { in Maxpool3DGradRewrite()
2079 for (const Edge* e : n->in_edges()) { in FillInputs()
2534 for (const Edge* e : orig_node->in_edges()) { in AddWorkSpaceEdgeIfNeeded()
[all …]
/external/tensorflow/tensorflow/compiler/jit/
Dclone_constants_for_better_clustering.cc45 for (const Edge* e : n->in_edges()) { in CloneNode()
111 std::vector<const Edge*> in_edges; in CloneSmallHostConstantInputs() local
112 absl::c_copy(n->in_edges(), std::back_inserter(in_edges)); in CloneSmallHostConstantInputs()
113 for (const Edge* e : in_edges) { in CloneSmallHostConstantInputs()
Dencapsulate_xla_computations_pass.cc85 for (const Edge* edge : node.in_edges()) { in AddControlInputs()
256 std::vector<const Edge*> in_edges; in BuildXlaLaunchOps() local
257 TF_RETURN_IF_ERROR(launch->input_edges(&in_edges)); in BuildXlaLaunchOps()
259 const int num_inputs = in_edges.size(); in BuildXlaLaunchOps()
264 << " input edges: " << in_edges.size() << " num_args: " << num_args in BuildXlaLaunchOps()
277 const Edge* edge = in_edges[i]; in BuildXlaLaunchOps()
285 const Edge* edge = in_edges[pos]; in BuildXlaLaunchOps()
Dbuild_xla_ops_pass.cc267 for (const Edge* e : from->in_edges()) { in CopyIncomingControlEdges()
278 absl::c_copy_if(n->in_edges(), std::back_inserter(incoming_ctrl_edges), in RemoveAllIncomingControlEdges()
303 n->in_edges(), [](const Edge* e) { return !e->IsControlEdge(); }); in ReplaceFunctionCallWithPartitionedCall()
306 for (const Edge* e : n->in_edges()) { in ReplaceFunctionCallWithPartitionedCall()
320 for (const Edge* e : n->in_edges()) { in ReplaceFunctionCallWithPartitionedCall()
430 for (const Edge* e : n->in_edges()) { in PredicateInt32Inputs()
Dpartially_decluster_pass.cc146 for (const Edge* in_edge : n->in_edges()) { in PartiallyDeclusterNode()
316 absl::c_all_of(n->in_edges(), [&](const Edge* e) { in PartiallyDeclusterGraph()
378 if (absl::c_any_of(n->in_edges(), input_belongs_to_same_cluster)) { in PartiallyDeclusterGraph()
/external/tensorflow/tensorflow/core/framework/
Dgraph_to_functiondef.cc166 std::vector<const Edge*> in_edges; in FillFunctionBody() local
187 in_edges.clear(); in FillFunctionBody()
188 in_edges.resize(node->num_inputs(), nullptr); in FillFunctionBody()
190 for (const Edge* edge : node->in_edges()) { in FillFunctionBody()
195 in_edges[edge->dst_input()] = edge; in FillFunctionBody()
204 for (size_t i = 0; i < in_edges.size(); ++i) { in FillFunctionBody()
205 const Edge* edge = in_edges[i]; in FillFunctionBody()
/external/tensorflow/tensorflow/core/graph/
Dvalidate.cc72 pending_count[i] = n->in_edges().size(); in ValidateGraphHasNoCycle()
76 for (const Edge* e : n->in_edges()) { in ValidateGraphHasNoCycle()
Dalgorithm.cc166 for (const Edge* in_edge : n->in_edges()) { in ReverseDFSFromHelper()
176 for (const Edge* in_edge : n->in_edges()) { in ReverseDFSFromHelper()
259 if (!n->IsSource() && n->in_edges().empty()) { in FixupSourceAndSinkEdges()
Dgraph.cc260 for (const Edge* edge : in_edges()) { in input_edge()
275 for (const Edge* edge : in_edges()) { in input_edges()
434 copy->in_edges_.reserve(n->in_edges().size()); in Copy()
567 for (const Edge* edge : dest->in_edges()) { in AddControlEdge()
610 for (const Edge* e : dst->in_edges()) { in FindEdge()
644 for (const Edge* edge : dst->in_edges()) { in AddWhileInputHack()
713 for (const Edge* edge : node->in_edges()) { in ToGraphDefSubRange()
/external/tensorflow/tensorflow/cc/framework/
Dops.cc30 for (const Edge* e : node_->in_edges()) { in input()
56 for (const Edge* e : node->in_edges()) { in GetInputs()
Dgradients.cc181 for (const Edge* e : n->in_edges()) { in GetReachableNodes()
430 for (const Edge* e : enter_node->in_edges()) { in ProcessWhileLoop()
468 for (const Edge* e : n->in_edges()) { in AddGradients()
496 for (const Edge* e : n->in_edges()) { in AddGradients()
525 for (const Edge* e : n->in_edges()) { in AddGradients()
/external/tensorflow/tensorflow/core/tpu/graph_rewrite/
Dencapsulate_tpu_computations_pass.cc274 for (const Edge* edge : node.in_edges()) { in AddControlInputs()
369 for (const Edge* e : n->in_edges()) { in MoveHeadOutsideCompilationToHost()
477 for (const Edge* e : n->in_edges()) { in MoveHeadOutsideCompilationToHost()
1042 for (const Edge* e : n->in_edges()) { in MoveTailOutsideCompilationToHost()
1211 if (n->IsRetval() && n->in_edges().empty()) { in MoveTailOutsideCompilationToHost()
1593 for (const auto& e_in : n->in_edges()) { in RemoveUnusedTPUReplicatedInputs()
2563 for (const Edge* e : n->in_edges()) { in BuildTPUReplicateOps()
2620 std::vector<const Edge*> in_edges; in BuildTPUReplicateOps() local
2621 TF_RETURN_IF_ERROR(replicate->input_edges(&in_edges)); in BuildTPUReplicateOps()
2627 while (pos < in_edges.size() && in BuildTPUReplicateOps()
[all …]
Dvariable_merger_pass.cc149 if (m->type_string() == "VarHandleOp" && m->in_edges().size() == 1) { in Run()
154 if (n->type_string() == "ReadVariableOp" && n->in_edges().size() <= 2) { in Run()
181 for (const Edge* e : n->in_edges()) { in Run()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc87 const std::vector<SimpleEdge*>& in_edges() const { return in_edges_; } in in_edges() function in tensorflow::tensorrt::segment::__anon3618f86b0111::SimpleNode
150 in_edges_.reserve(node_->in_edges().size()); in SimpleNode()
583 std::vector<const SimpleEdge*> in_edges(dst->in_edges().begin(), in ContractEdge() local
584 dst->in_edges().end()); in ContractEdge()
585 for (const SimpleEdge* in_edge : in_edges) { in ContractEdge()
624 for (const auto& in_edge : dst->in_edges()) { in ContractEdge()
946 for (const Edge* edge : node->in_edges()) { in SegmentGraph()
/external/tensorflow/tensorflow/core/nccl/
Dnccl_rewrite.cc46 for (const auto& edge : node->in_edges()) { in ReplaceReduce()
60 for (const auto& edge : node->in_edges()) { in ReplaceReduce()
172 for (const auto& edge : node->in_edges()) { in ReplaceBroadcast()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_cond.cc482 for (auto e : node_maps_[static_cast<int>(branch)][m->id()]->in_edges()) { in BuildArgumentNodes()
547 for (auto e : m->in_edges()) { in ExtractBodies()
615 std::vector<const Edge*> in_edges(n->in_edges().begin(), in ExtractBodies() local
616 n->in_edges().end()); in ExtractBodies()
619 in_edges.begin(), in_edges.end(), [](const Edge* a, const Edge* b) { in ExtractBodies()
625 for (const Edge* e : in_edges) { in ExtractBodies()
731 for (auto e : m->in_edges()) { in ExtractBodies()
1173 for (auto e : dst->in_edges()) { in DetermineCondStateMerge()
1198 for (auto e : dst->in_edges()) { in DetermineCondStateNonMerge()
1220 for (auto e : node->in_edges()) { in RemoveRedundantMerge()
[all …]
/external/tensorflow/tensorflow/core/distributed_runtime/
Dscheduler.cc38 for (const Edge* edge : node->in_edges()) { in InitializePending()
45 num_in_edges = node->in_edges().size(); in InitializePending()
148 for (const Edge* in_edge : curr->in_edges()) { in ComputeAlap()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/convert/
Dconvert_graph.cc166 std::vector<const Edge*> in_edges(node->in_edges().begin(), in GetEngineInfo() local
167 node->in_edges().end()); in GetEngineInfo()
168 std::sort(in_edges.begin(), in_edges.end(), EdgePtrCompare()); in GetEngineInfo()
169 for (const auto edge : in_edges) { in GetEngineInfo()

123