| /external/tensorflow/tensorflow/core/graph/ |
| D | algorithm_test.cc | 170 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()
218 visited.insert(graph.FindNodeId(graph.num_nodes() - 1)); in BM_PruneForReverseReachability()
|
| D | validate.cc | 70 const Node* n = graph.FindNodeId(i); in ValidateGraphHasNoCycle()
107 nodes_in_cycle.push_back(graph.FindNodeId(i)->name()); in ValidateGraphHasNoCycle()
|
| D | graph.h | 668 Node* FindNodeId(int id) const { return nodes_[id]; } in FindNodeId() function
685 Node* source_node() const { return FindNodeId(kSourceId); } in source_node()
686 Node* sink_node() const { return FindNodeId(kSinkId); } in sink_node()
937 if (id_ >= graph_->num_node_ids() || graph_->FindNodeId(id_) != nullptr) {
943 inline Node* NodeIter::operator*() const { return graph_->FindNodeId(id_); }
945 inline Node* NodeIter::operator->() const { return graph_->FindNodeId(id_); }
|
| D | algorithm.cc | 244 Node* n = g->FindNodeId(i); in PruneForReverseReachability()
|
| D | graph_test.cc | 317 Node* node = graph_.FindNodeId(id); in TEST_F()
|
| D | graph.cc | 766 const Node* node = FindNodeId(id); in ToGraphDefSubRange()
|
| D | graph_partition.cc | 650 Node* node = g->FindNodeId(i); in AddControlFlow()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | graph_execution_state.h | 162 return graph_->FindNodeId(iter->second); in get_node_by_name()
|
| D | lower_functional_ops.cc | 166 Node* n = g->FindNodeId(i); in Run()
|
| D | forward_type_inference.cc | 255 Node* n = g->FindNodeId(nid); in Run()
|
| D | graph_constructor_test.cc | 929 const string& source = graph_.FindNodeId(Graph::kSourceId)->name(); in TEST_F()
930 const string& sink = graph_.FindNodeId(Graph::kSinkId)->name(); in TEST_F()
2441 const string& source = graph_.FindNodeId(Graph::kSourceId)->name(); in TEST_F()
2442 const string& sink = graph_.FindNodeId(Graph::kSinkId)->name(); in TEST_F()
|
| D | constant_folding_test.cc | 184 Node* n1 = g1.FindNodeId(i); in TEST_F()
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | resource_operation_safety_analysis.cc | 295 << NodeToString(*g.FindNodeId(incoming_op.first), in ComputeIncompatibleResourceOperationPairs()
|
| D | mark_for_compilation_pass.cc | 222 Node* node = graph.FindNodeId(cycles_graph_node_id()); in DebugString()
374 graph_->FindNodeId(node_id) == nullptr) { in GetClusterForCyclesGraphNode()
537 Node* node = graph_->FindNodeId(cycles_graph_node_id); in DebugStringForCyclesGraphNode()
699 ? graph_->FindNodeId(cluster.GetIdOfOnlyNode()) in GetOnlyNodeIn()
|
| D | encapsulate_util.cc | 143 Node* dst = g->FindNodeId(edges[i].dst_node_id); in PreprocessDataEdgesBetweenOutsideCompilations()
|
| D | xla_cluster_util.cc | 63 auto* node = graph.FindNodeId(node_id); in DescribeCycle()
|
| D | encapsulate_xla_computations_pass_test.cc | 165 return graph->FindNodeId(node->id()); in TEST()
|
| /external/tensorflow/tensorflow/compiler/tf2tensorrt/convert/ |
| D | convert_graph.cc | 374 Node* input_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
431 Node* input_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
548 Node* output_node = graph->FindNodeId(conn.outside_id); in CreateTRTNode()
|
| D | convert_nodes.cc | 6031 auto outside_node = graph->FindNodeId(connection.outside_id); in ConvertSegmentToGraphDef()
6042 graph->FindNodeId(connection.outside_id), in ConvertSegmentToGraphDef()
6047 graph->FindNodeId(connection.outside_id), in ConvertSegmentToGraphDef()
|
| /external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/ |
| D | segment.cc | 133 SimpleNode* FindNodeId(int node_id) { in FindNodeId() function in tensorflow::tensorrt::segment::__anon591344890111::SimpleGraph
167 const auto n = g->FindNodeId(i); in SimpleGraph()
894 SimpleNode* node = graph->FindNodeId(i); in SegmentGraph()
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | function_optimizer.cc | 1152 g->AddControlEdge(g->FindNodeId(node->id()), caller, in AddStrictInputSemantics()
1182 Node* enter = g->FindNodeId(frame->id()); in AddFrameForwardingControlEdge()
1253 Node* n = graph->FindNodeId(i); in InlineFunctionCalls()
|
| /external/tensorflow/tensorflow/c/ |
| D | c_api.cc | 311 Node* const node = graph.FindNodeId(id); in ExtendSessionGraphHelper()
1596 Node* node = graph->graph.FindNodeId(*pos); in TF_GraphNextOperation()
1746 auto* node = graph->graph.FindNodeId(i); in GraphImportGraphDefLocked()
2069 Node* new_node = parent->graph.FindNodeId(i); in TF_FinishWhileHelper()
2159 Node* n = g->graph.FindNodeId(i); in TF_AddGradientsWithPrefix()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | functionalize_cond.cc | 1380 Node* s = graph_->FindNodeId(s_id); in DeleteReachableAndDeadNodes()
1428 Node* d = graph_->FindNodeId(d_id); in DeleteReachableAndDeadNodes()
|
| D | tf2xla_util.cc | 150 Node* usage_node = g->FindNodeId(usages[i].dst_node_id); in ReplaceSrcOutputUsageWithNode()
|
| /external/tensorflow/tensorflow/compiler/mlir/tensorflow/translate/ |
| D | import_model.cc | 2289 auto* node = graph_->FindNodeId(arg->id()); in InferLibFunctionType()
2304 auto* node = graph_->FindNodeId(arg->id()); in InferLibFunctionType()
2328 auto* node = graph_->FindNodeId(ret->id()); in InferLibFunctionType()
|