Home
last modified time | relevance | path

Searched refs:num_node_ids (Results 1 – 25 of 40) sorted by relevance

12

/external/tensorflow/tensorflow/core/distributed_runtime/
Dscheduler.cc31 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/
Dcostmodel.cc464 const int num_node_ids = g.num_node_ids(); in InitFromGraph() local
465 slot_bytes_.reserve(num_node_ids); in InitFromGraph()
466 count_.reserve(num_node_ids); in InitFromGraph()
467 time_.reserve(num_node_ids); in InitFromGraph()
468 max_mem_usage_.reserve(num_node_ids); in InitFromGraph()
469 max_exec_time_.reserve(num_node_ids); in InitFromGraph()
470 output_port_alloc_ids_.reserve(num_node_ids); in InitFromGraph()
Dvalidate.cc67 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()
Dgraph.h581 int num_node_ids() const { return nodes_.size(); } in num_node_ids() function
815 DCHECK_LE(id_, graph_->num_node_ids());
817 if (id_ >= graph_->num_node_ids() || graph_->FindNodeId(id_) != nullptr) {
859 return gtl::make_range(NodeIter(this, 0), NodeIter(this, num_node_ids())); in nodes()
870 NodeIter end(this, num_node_ids()); in op_nodes()
Dcontrol_flow.cc89 info->resize(g->num_node_ids()); in BuildControlFlowInfo()
92 parent_nodes.resize(g->num_node_ids()); in BuildControlFlowInfo()
Dgraph_test.cc163 EXPECT_EQ(2, graph_.num_node_ids()); in TEST_F()
172 EXPECT_EQ(5, graph_.num_node_ids()); in TEST_F()
174 EXPECT_EQ(5, graph_.num_node_ids()); in TEST_F()
177 EXPECT_EQ(6, graph_.num_node_ids()); in TEST_F()
212 EXPECT_EQ(6, graph_.num_node_ids()); in TEST_F()
315 for (int id = 0; id < graph_.num_node_ids(); ++id) { in TEST_F()
719 sum += graph.num_node_ids(); in BM_GraphCreation()
Dalgorithm.cc42 std::vector<bool> visited(g.num_node_ids(), false); in DFSFromHelper()
136 std::vector<bool> visited(g.num_node_ids(), false); in ReverseDFSFromHelper()
Dmkl_tfconversion_pass_test.cc286 int N = graph->num_node_ids(); in BM_RunMklToTfConversionPass()
Dgraph_partition.cc553 info->device_types.resize(g.num_node_ids(), DEVICE_CPU); in BuildMemoryDeviceInfo()
622 int num_node_ids = g->num_node_ids(); in AddControlFlow() local
623 for (int i = 0; i < num_node_ids; ++i) { in AddControlFlow()
Doptimizer_cse_test.cc364 int N = graph->num_node_ids(); in BM_CSE()
/external/tensorflow/tensorflow/compiler/jit/
Dxla_fusion_optimizer.cc236 std::vector<UnionFind<Cluster>> clusters(graph.num_node_ids()); in Optimize()
261 if (to >= graph.num_node_ids()) { in Optimize()
304 std::vector<int> effective_cluster_sizes(graph.num_node_ids()); in Optimize()
Dxla_cluster_util.cc47 int32 max_path_size = graph.num_node_ids() + 1; in DescribeCycle()
55 if (!FastBoundsCheck(node_id, graph.num_node_ids())) { in DescribeCycle()
116 for (int i = 0; i < graph->num_node_ids(); ++i) { in CreateCycleDetectionGraph()
Dmark_for_compilation_pass.cc458 std::vector<bool> compile_time_const_nodes(graph.num_node_ids(), false); in FindCompilationCandidates()
1111 std::vector<UnionFind<Cluster>> clusters(graph->num_node_ids()); in RunImpl()
1166 if (to >= graph->num_node_ids()) { in RunImpl()
1227 if (in_id >= graph->num_node_ids()) continue; in RunImpl()
1265 std::vector<int> effective_cluster_sizes(graph->num_node_ids()); in RunImpl()
1269 std::vector<bool> has_functional_control_flow(graph->num_node_ids()); in RunImpl()
Dresource_operation_safety_analysis.cc279 absl::make_unique<ResourceOpSet[]>(g.num_node_ids()); in ComputeIncompatibleResourceOperationPairs()
/external/tensorflow/tensorflow/compiler/tf2xla/
Dfunctionalize_while.cc101 std::vector<bool> visited(graph.num_node_ids(), false); in CopySubgraph()
152 std::vector<Node*> node_map(graph.num_node_ids(), nullptr); in BuildLoopCondition()
153 std::vector<bool> squash_src_outputs(graph.num_node_ids(), false); in BuildLoopCondition()
189 std::vector<Node*> node_map(graph.num_node_ids(), nullptr); in BuildLoopBody()
190 std::vector<bool> squash_src_outputs(graph.num_node_ids(), false); in BuildLoopBody()
673 CheckNodeNotInCycle(node, graph->num_node_ids()), in FunctionalizeWhileLoop()
Dconst_analysis.cc46 CHECK_EQ(compile_time_const_nodes->size(), g.num_node_ids()); in BackwardsConstAnalysis()
48 compile_time_const_nodes_impl.resize(g.num_node_ids()); in BackwardsConstAnalysis()
Dfunctionalize_cond.cc158 node_to_condid_map_.resize(graph->num_node_ids()); in StateMap()
159 node_to_ancestorid_map_.resize(graph->num_node_ids()); in StateMap()
556 std::vector<bool> visited(graph->num_node_ids(), false); in ExtractBodies()
557 node_maps_[branch_index].resize(graph->num_node_ids(), nullptr); in ExtractBodies()
907 CheckNodeNotInCycle(if_node_, graph->num_node_ids()), in BuildAndReplace()
1331 std::vector<bool> deleted(graph_->num_node_ids(), false); in DeleteReachableAndDeadNodes()
Dconst_analysis_test.cc46 std::vector<bool> const_nodes(root.graph()->num_node_ids(), false); in TEST()
/external/tensorflow/tensorflow/compiler/tf2tensorrt/segment/
Dsegment.cc128 int num_node_ids() const { return nodes_.size(); } in num_node_ids() function in tensorflow::tensorrt::segment::SimpleGraph
149 int n_nodes = g_->num_node_ids(); in SimpleGraph()
262 std::vector<bool> visited(g.num_node_ids(), false); in StableDFS()
426 for (int i = 0; i < graph->num_node_ids(); ++i) { in SegmentGraph()
474 order.reserve(graph->num_node_ids()); in SegmentGraph()
/external/tensorflow/tensorflow/core/common_runtime/
Dlower_if_while.cc72 for (int i = 2; i < g->num_node_ids(); ++i) { in Run()
Dconstant_folding.cc604 VLOG(1) << "Constant foldable " << constant_graph->num_node_ids() << " : " in ConstantFold()
605 << graph->num_node_ids(); in ConstantFold()
/external/tensorflow/tensorflow/core/common_runtime/sycl/
Dsycl_device.cc81 device_context_map->resize(graph->num_node_ids()); in FillContextMap()
/external/tensorflow/tensorflow/cc/client/
Dclient_session.cc95 int num_nodes = graph_->num_node_ids(); in MaybeExtendGraph()
/external/tensorflow/tensorflow/cc/framework/
Dgradients.cc168 std::vector<bool> reachable_nodes(scope_.graph()->num_node_ids(), false); in GetReachableNodes()
283 pending_.resize(scope_.graph()->num_node_ids(), 0); in Initialize()
/external/tensorflow/tensorflow/c/
Dc_api.cc773 const auto num_nodes = graph.num_node_ids(); in ExtendSessionGraphHelper()
1977 while (*pos < static_cast<size_t>(graph->graph.num_node_ids())) { in TF_GraphNextOperation()
2120 const int last_node_id = graph->graph.num_node_ids(); in GraphImportGraphDefLocked()
2127 for (int i = last_node_id; i < graph->graph.num_node_ids(); ++i) { in GraphImportGraphDefLocked()
2439 const int first_new_node_id = parent->graph.num_node_ids(); in TF_FinishWhileHelper()
2450 for (int i = first_new_node_id; i < parent->graph.num_node_ids(); ++i) { in TF_FinishWhileHelper()
2505 const int first_new_node_id = g->graph.num_node_ids(); in TF_AddGradientsWithPrefix()
2541 for (int i = first_new_node_id; i < g->graph.num_node_ids(); ++i) { in TF_AddGradientsWithPrefix()
2656 session->last_num_graph_nodes = graph->graph.num_node_ids(); in TF_LoadSessionFromSavedModel()

12