Home
last modified time | relevance | path

Searched refs:FindNodeId (Results 1 – 25 of 26) sorted by relevance

12

/external/tensorflow/tensorflow/core/graph/
Dalgorithm_test.cc167 g.AddEdge(g.FindNodeId(n3->id()), 0, g.FindNodeId(n1->id()), 1); in TEST()
175 g.sink_node(), g.FindNodeId(n3->id()), g.FindNodeId(n2->id()), in TEST()
176 g.FindNodeId(n1->id()), g.FindNodeId(n0->id()), g.source_node()}; in TEST()
Dgraph.h587 Node* FindNodeId(int id) const { return nodes_[id]; } in FindNodeId() function
604 Node* source_node() const { return FindNodeId(kSourceId); } in source_node()
605 Node* sink_node() const { return FindNodeId(kSinkId); } in sink_node()
817 if (id_ >= graph_->num_node_ids() || graph_->FindNodeId(id_) != nullptr) {
823 inline Node* NodeIter::operator*() { return graph_->FindNodeId(id_); }
825 inline Node* NodeIter::operator->() { return graph_->FindNodeId(id_); }
Dvalidate.cc70 const Node* n = graph.FindNodeId(i); in ValidateGraphHasNoCycle()
107 nodes_in_cycle.push_back(graph.FindNodeId(i)->name()); in ValidateGraphHasNoCycle()
Dgraph_constructor_test.cc900 const string& source = graph_.FindNodeId(Graph::kSourceId)->name(); in TEST_F()
901 const string& sink = graph_.FindNodeId(Graph::kSinkId)->name(); in TEST_F()
2437 const string& source = graph_.FindNodeId(Graph::kSourceId)->name(); in TEST_F()
2438 const string& sink = graph_.FindNodeId(Graph::kSinkId)->name(); in TEST_F()
Dgraph.cc644 const Node* node = FindNodeId(id); in ToGraphDefSubRange()
Dgraph_test.cc316 Node* node = graph_.FindNodeId(id); in TEST_F()
Dgraph_partition.cc624 Node* node = g->FindNodeId(i); in AddControlFlow()
/external/tensorflow/tensorflow/compiler/jit/
Dxla_fusion_optimizer.cc252 Node* node_from = graph.FindNodeId(from); in Optimize()
266 Node* node_to = graph.FindNodeId(to); in Optimize()
Dmark_for_compilation_pass.cc1150 Node* node_from = graph->FindNodeId(from); in RunImpl()
1173 Node* node_to = graph->FindNodeId(to); in RunImpl()
1229 Node* in = graph->FindNodeId(in_id); in RunImpl()
Dresource_operation_safety_analysis.cc312 << NodeToString(*g.FindNodeId(incoming_op.first), in ComputeIncompatibleResourceOperationPairs()
Dxla_cluster_util.cc58 auto* node = graph.FindNodeId(node_id); in DescribeCycle()
Dencapsulate_util.cc137 Node* dst = g->FindNodeId(edges[i].dst_node_id); in PreprocessDataEdgesBetweenOutsideCompilations()
Dencapsulate_xla_computations_pass_test.cc165 return graph->FindNodeId(node->id()); in TEST()
/external/tensorflow/tensorflow/core/common_runtime/
Dlower_if_while.cc73 Node* n = g->FindNodeId(i); in Run()
Dgraph_execution_state.h154 return graph_->FindNodeId(iter->second); in get_node_by_name()
Dconstant_folding_test.cc184 Node* n1 = g1.FindNodeId(i); in TEST_F()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc122 SimpleNode* FindNodeId(int node_id) { in FindNodeId() function in tensorflow::tensorrt::segment::SimpleGraph
156 const auto n = g->FindNodeId(i); in SimpleGraph()
427 SimpleNode* node = graph->FindNodeId(i); in SegmentGraph()
/external/tensorflow/tensorflow/core/common_runtime/gpu/
Dgpu_stream_util_test.cc132 Node* n = g.FindNodeId(it.first); in TEST_F()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/convert/
Dconvert_graph.cc425 Node* input_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
475 Node* input_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
608 Node* output_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
Dconvert_nodes.cc4179 auto outside_node = graph->FindNodeId(connection.outside_id); in ConvertSegmentToGraphDef()
4190 graph->FindNodeId(connection.outside_id), in ConvertSegmentToGraphDef()
4195 graph->FindNodeId(connection.outside_id), in ConvertSegmentToGraphDef()
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dvectorization_utils.cc405 map_defun_node_ = outer_scope_->FindNodeId(node_id); in Initialize()
/external/tensorflow/tensorflow/c/
Dc_api.cc789 Node* const node = graph.FindNodeId(id); in ExtendSessionGraphHelper()
1978 Node* node = graph->graph.FindNodeId(*pos); in TF_GraphNextOperation()
2128 auto* node = graph->graph.FindNodeId(i); in GraphImportGraphDefLocked()
2451 Node* new_node = parent->graph.FindNodeId(i); in TF_FinishWhileHelper()
2542 Node* n = g->graph.FindNodeId(i); in TF_AddGradientsWithPrefix()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_cond.cc1339 Node* s = graph_->FindNodeId(s_id); in DeleteReachableAndDeadNodes()
1376 Node* d = graph_->FindNodeId(d_id); in DeleteReachableAndDeadNodes()
Dtf2xla_util.cc148 Node* usage_node = g->FindNodeId(usages[i].dst_node_id); in ReplaceArgUsageWithConstNode()
/external/tensorflow/tensorflow/core/kernels/
Dremote_fused_graph_execute_utils.cc492 const Node* node = graph.FindNodeId(i); in BuildTensorShapeMapFromGraph()

12