Home
last modified time | relevance | path

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

12

/external/tensorflow/tensorflow/core/graph/
Dalgorithm_test.cc170 g.AddEdge(g.FindNodeId(n3->id()), 0, g.FindNodeId(n1->id()), 1); in TEST()
178 g.sink_node(), g.FindNodeId(n3->id()), g.FindNodeId(n2->id()), in TEST()
179 g.FindNodeId(n1->id()), g.FindNodeId(n0->id()), g.source_node()}; in TEST()
217 visited.insert(graph.FindNodeId(graph.num_nodes() - 1)); in BM_PruneForReverseReachability()
Dgraph.h613 Node* FindNodeId(int id) const { return nodes_[id]; } in FindNodeId() function
630 Node* source_node() const { return FindNodeId(kSourceId); } in source_node()
631 Node* sink_node() const { return FindNodeId(kSinkId); } in sink_node()
851 if (id_ >= graph_->num_node_ids() || graph_->FindNodeId(id_) != nullptr) {
857 inline Node* NodeIter::operator*() const { return graph_->FindNodeId(id_); }
859 inline Node* NodeIter::operator->() const { 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()
Dalgorithm.cc235 Node* n = g->FindNodeId(i); in PruneForReverseReachability()
Dgraph_constructor_test.cc899 const string& source = graph_.FindNodeId(Graph::kSourceId)->name(); in TEST_F()
900 const string& sink = graph_.FindNodeId(Graph::kSinkId)->name(); in TEST_F()
2436 const string& source = graph_.FindNodeId(Graph::kSourceId)->name(); in TEST_F()
2437 const string& sink = graph_.FindNodeId(Graph::kSinkId)->name(); in TEST_F()
Dgraph.cc673 const Node* node = FindNodeId(id); in ToGraphDefSubRange()
Dgraph_test.cc316 Node* node = graph_.FindNodeId(id); in TEST_F()
Dgraph_partition.cc649 Node* node = g->FindNodeId(i); in AddControlFlow()
/external/tensorflow/tensorflow/core/common_runtime/
Dgraph_execution_state.h149 return graph_->FindNodeId(iter->second); in get_node_by_name()
Dlower_functional_ops.cc148 Node* n = g->FindNodeId(i); in Run()
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/jit/
Dresource_operation_safety_analysis.cc295 << NodeToString(*g.FindNodeId(incoming_op.first), in ComputeIncompatibleResourceOperationPairs()
Dmark_for_compilation_pass.cc205 Node* node = graph.FindNodeId(cycles_graph_node_id()); in DebugString()
348 graph_->FindNodeId(node_id) == nullptr) { in GetClusterForCyclesGraphNode()
504 Node* node = graph_->FindNodeId(cycles_graph_node_id); in DebugStringForCyclesGraphNode()
660 ? graph_->FindNodeId(cluster.GetIdOfOnlyNode()) in GetOnlyNodeIn()
Dencapsulate_util.cc143 Node* dst = g->FindNodeId(edges[i].dst_node_id); in PreprocessDataEdgesBetweenOutsideCompilations()
Dxla_cluster_util.cc60 auto* node = graph.FindNodeId(node_id); in DescribeCycle()
Dencapsulate_xla_computations_pass_test.cc165 return graph->FindNodeId(node->id()); in TEST()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/convert/
Dconvert_graph.cc348 Node* input_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
390 Node* input_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
507 Node* output_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
/external/tensorflow/tensorflow/core/grappler/optimizers/
Dfunction_optimizer.cc1118 g->AddControlEdge(g->FindNodeId(node->id()), caller, in AddStrictInputSemantics()
1147 Node* enter = g->FindNodeId(frame->id()); in AddFrameForwardingControlEdge()
1211 Node* n = graph->FindNodeId(i); in InlineFunctionCalls()
/external/tensorflow/tensorflow/c/
Dc_api.cc346 Node* const node = graph.FindNodeId(id); in ExtendSessionGraphHelper()
1568 Node* node = graph->graph.FindNodeId(*pos); in TF_GraphNextOperation()
1718 auto* node = graph->graph.FindNodeId(i); in GraphImportGraphDefLocked()
2041 Node* new_node = parent->graph.FindNodeId(i); in TF_FinishWhileHelper()
2131 Node* n = g->graph.FindNodeId(i); in TF_AddGradientsWithPrefix()
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dvectorization_utils.cc398 map_defun_node_ = outer_scope_->FindNodeId(node_id); in Initialize()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_cond.cc1374 Node* s = graph_->FindNodeId(s_id); in DeleteReachableAndDeadNodes()
1411 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/compiler/mlir/tensorflow/translate/
Dimport_model.cc1732 auto* node = graph_->FindNodeId(arg->id()); in InferLibFunctionType()
1742 auto* node = graph_->FindNodeId(ret->id()); in InferLibFunctionType()

12