| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| D | scheduler.cc | 31 pending->resize(graph->num_node_ids()); in InitializePending()
78 asap_times->resize(graph_->num_node_ids()); in ComputeAsap()
80 std::vector<int> pending_count(graph_->num_node_ids()); in ComputeAsap()
120 alap_times->resize(graph_->num_node_ids()); in ComputeAlap()
123 pending_count.resize(graph_->num_node_ids()); in ComputeAlap()
180 slacks->resize(graph_->num_node_ids()); in ComputeSlack()
214 std::vector<int> pending_count(graph_->num_node_ids()); in ComputeSchedule()
|
| /external/tensorflow/tensorflow/core/graph/ |
| D | costmodel.cc | 466 const int num_node_ids = g.num_node_ids(); in InitFromGraph() local
467 slot_bytes_.reserve(num_node_ids); in InitFromGraph()
468 count_.reserve(num_node_ids); in InitFromGraph()
469 time_.reserve(num_node_ids); in InitFromGraph()
470 max_mem_usage_.reserve(num_node_ids); in InitFromGraph()
471 max_exec_time_.reserve(num_node_ids); in InitFromGraph()
472 output_port_alloc_ids_.reserve(num_node_ids); in InitFromGraph()
|
| D | validate.cc | 67 std::vector<int> pending_count(graph.num_node_ids(), 0); in ValidateGraphHasNoCycle()
69 for (int i = 0; i < graph.num_node_ids(); ++i) { in ValidateGraphHasNoCycle()
|
| D | control_flow.cc | 89 info->resize(g->num_node_ids()); in BuildControlFlowInfo()
92 parent_nodes.resize(g->num_node_ids()); in BuildControlFlowInfo()
|
| D | algorithm.cc | 42 std::vector<bool> visited(g.num_node_ids(), false); in DFSFromHelper()
139 std::vector<bool> visited(g.num_node_ids(), false); in ReverseDFSFromHelper()
223 std::vector<bool> visited(g->num_node_ids()); in PruneForReverseReachability()
|
| D | graph.h | 632 int num_node_ids() const { return nodes_.size(); } in num_node_ids() function
898 DCHECK_LE(id_, graph_->num_node_ids());
900 if (id_ >= graph_->num_node_ids() || graph_->FindNodeId(id_) != nullptr) {
942 return gtl::make_range(NodeIter(this, 0), NodeIter(this, num_node_ids())); in nodes()
953 NodeIter end(this, num_node_ids()); in op_nodes()
|
| D | graph_test.cc | 164 EXPECT_EQ(2, graph_.num_node_ids()); in TEST_F()
173 EXPECT_EQ(5, graph_.num_node_ids()); in TEST_F()
175 EXPECT_EQ(5, graph_.num_node_ids()); in TEST_F()
178 EXPECT_EQ(6, graph_.num_node_ids()); in TEST_F()
213 EXPECT_EQ(6, graph_.num_node_ids()); in TEST_F()
316 for (int id = 0; id < graph_.num_node_ids(); ++id) { in TEST_F()
718 sum += graph.num_node_ids(); in BM_GraphCreation()
|
| D | optimizer_cse_test.cc | 370 int N = graph->num_node_ids(); in BM_CSE()
|
| D | graph_partition.cc | 580 info->device_types.resize(g.num_node_ids(), DEVICE_CPU); in BuildMemoryDeviceInfo()
649 int num_node_ids = g->num_node_ids(); in AddControlFlow() local
650 for (int i = 0; i < num_node_ids; ++i) { in AddControlFlow()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/ |
| D | functionalize_while.cc | 66 std::vector<bool> visited(graph.num_node_ids(), false); in CopySubgraph()
129 std::vector<Node*> node_map(graph.num_node_ids(), nullptr); in BuildLoopCondition()
130 std::vector<bool> squash_src_outputs(graph.num_node_ids(), false); in BuildLoopCondition()
166 std::vector<Node*> node_map(graph.num_node_ids(), nullptr); in BuildLoopBody()
167 std::vector<bool> squash_src_outputs(graph.num_node_ids(), false); in BuildLoopBody()
566 CheckNodeNotInCycle(node, graph->num_node_ids()), in FunctionalizeWhileLoop()
|
| D | const_analysis.cc | 201 CHECK_EQ(compile_time_const_nodes->size(), g.num_node_ids()); in BackwardsConstAnalysis()
203 compile_time_const_nodes_impl.resize(g.num_node_ids()); in BackwardsConstAnalysis()
|
| D | functionalize_cond.cc | 162 node_to_condid_map_.resize(graph->num_node_ids()); in StateMap()
163 node_to_ancestorid_map_.resize(graph->num_node_ids()); in StateMap()
572 std::vector<bool> visited(graph->num_node_ids(), false); in ExtractBodies()
573 node_maps_[branch_index].resize(graph->num_node_ids(), nullptr); in ExtractBodies()
948 CheckNodeNotInCycle(if_node_, graph->num_node_ids()), in BuildAndReplace()
1378 std::vector<bool> deleted(graph_->num_node_ids(), false); in DeleteReachableAndDeadNodes()
|
| D | const_analysis_test.cc | 50 std::vector<bool> const_nodes(root.graph()->num_node_ids(), false); in TEST()
|
| /external/tensorflow/tensorflow/compiler/jit/ |
| D | xla_cluster_util.cc | 49 int32 max_path_size = graph.num_node_ids() + 1; in DescribeCycle()
57 if (!FastBoundsCheck(node_id, graph.num_node_ids())) { in DescribeCycle()
109 for (int i = 0; i < graph->num_node_ids(); ++i) { in CreateCycleDetectionGraph()
498 callee_has_ref_nodes_cache.resize(graph.num_node_ids()); in GetNodesRelatedToRefVariablesInDirection()
|
| D | resource_operation_safety_analysis.cc | 262 absl::make_unique<ResourceOpSet[]>(g.num_node_ids()); in ComputeIncompatibleResourceOperationPairs()
|
| D | mark_for_compilation_pass.cc | 352 if (node_id >= graph_->num_node_ids() || in GetClusterForCyclesGraphNode()
509 if (cycles_graph_node_id >= graph_->num_node_ids()) { in DebugStringForCyclesGraphNode()
1003 cluster_for_node_.resize(graph_->num_node_ids()); in BuildInitialClusterSet()
1135 std::vector<bool> compile_time_const_nodes(graph_->num_node_ids(), false); in FindCompilationCandidates()
|
| D | partially_decluster_pass.cc | 296 std::vector<bool> compile_time_const_nodes(graph->num_node_ids()); in PartiallyDeclusterGraph()
|
| /external/tensorflow/tensorflow/compiler/tf2xla/kernels/ |
| D | if_while_utils.cc | 76 must_be_const_nodes->resize((*body)->graph->num_node_ids(), false); in FindMustBeConstNodes()
|
| /external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/ |
| D | segment.cc | 135 int num_node_ids() const { return nodes_.size(); } in num_node_ids() function in tensorflow::tensorrt::segment::__anon3618f86b0111::SimpleGraph
156 int n_nodes = g_->num_node_ids(); in SimpleGraph()
261 std::vector<bool> visited(g.num_node_ids(), false); in StableDFS()
731 for (int i = 0; i < graph->num_node_ids(); ++i) { in SegmentGraph()
808 order.reserve(graph->num_node_ids()); in SegmentGraph()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | lower_functional_ops.cc | 143 for (int i = 2; i < g->num_node_ids(); ++i) { in Run()
|
| D | mkl_tfconversion_pass_test.cc | 290 int N = graph->num_node_ids(); in BM_RunMklToTfConversionPass()
|
| D | constant_folding.cc | 632 VLOG(1) << "Constant foldable " << constant_graph->num_node_ids() << " : " in ConstantFold()
633 << graph->num_node_ids(); in ConstantFold()
|
| /external/tensorflow/tensorflow/cc/client/ |
| D | client_session.cc | 95 int num_nodes = graph_->num_node_ids(); in MaybeExtendGraph()
|
| /external/tensorflow/tensorflow/cc/framework/ |
| D | gradients.cc | 169 std::vector<bool> reachable_nodes(scope_.graph()->num_node_ids(), false); in GetReachableNodes()
284 pending_.resize(scope_.graph()->num_node_ids(), 0); in Initialize()
|
| /external/tensorflow/tensorflow/c/ |
| D | c_api.cc | 330 const auto num_nodes = graph.num_node_ids(); in ExtendSessionGraphHelper()
1570 while (*pos < static_cast<size_t>(graph->graph.num_node_ids())) { in TF_GraphNextOperation()
1713 const int last_node_id = graph->graph.num_node_ids(); in GraphImportGraphDefLocked()
1720 for (int i = last_node_id; i < graph->graph.num_node_ids(); ++i) { in GraphImportGraphDefLocked()
2032 const int first_new_node_id = parent->graph.num_node_ids(); in TF_FinishWhileHelper()
2043 for (int i = first_new_node_id; i < parent->graph.num_node_ids(); ++i) { in TF_FinishWhileHelper()
2098 const int first_new_node_id = g->graph.num_node_ids(); in TF_AddGradientsWithPrefix()
2133 for (int i = first_new_node_id; i < g->graph.num_node_ids(); ++i) { in TF_AddGradientsWithPrefix()
2248 session->last_num_graph_nodes = graph->graph.num_node_ids(); in TF_LoadSessionFromSavedModel()
|