Searched refs:ready_nodes (Results 1 – 8 of 8) sorted by relevance
| /external/tensorflow/tensorflow/core/grappler/utils/ |
| D | topological_sort.cc | 52 std::vector<int>* ready_nodes) { in ComputeTopologicalOrder() argument
61 ready_nodes->reserve(graph.node_size()); in ComputeTopologicalOrder()
68 ready_nodes->push_back(i); in ComputeTopologicalOrder()
81 int ready_node = (*ready_nodes)[front]; in ComputeTopologicalOrder()
86 ready_nodes->push_back(fanout); in ComputeTopologicalOrder()
117 std::vector<int> ready_nodes; in ComputeTopologicalOrder() local
119 ComputeTopologicalOrder(graph, extra_dependencies, &ready_nodes)); in ComputeTopologicalOrder()
121 topo_order->reserve(ready_nodes.size()); in ComputeTopologicalOrder()
122 for (int ready_node_idx : ready_nodes) { in ComputeTopologicalOrder()
135 std::vector<int> ready_nodes; in ReversedTopologicalSort() local
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | static_schedule.cc | 66 std::deque<const NodeDef*> ready_nodes; in EstimateEarliestExecutionTimes() local
70 ready_nodes.push_back(&node); in EstimateEarliestExecutionTimes()
104 while (!ready_nodes.empty()) { in EstimateEarliestExecutionTimes()
105 const NodeDef* node = ready_nodes.front(); in EstimateEarliestExecutionTimes()
106 ready_nodes.pop_front(); in EstimateEarliestExecutionTimes()
120 ready_nodes.push_back(fanout); in EstimateEarliestExecutionTimes()
157 std::deque<const NodeDef*> ready_nodes; in EstimateRequiredTimes() local
164 ready_nodes.push_back(&node); in EstimateRequiredTimes()
175 while (!ready_nodes.empty()) { in EstimateRequiredTimes()
176 const NodeDef* node = ready_nodes.front(); in EstimateRequiredTimes()
[all …]
|
| /external/tensorflow/tensorflow/core/kernels/data/ |
| D | single_threaded_executor_test.cc | 285 std::vector<Node*> ready_nodes; in BM_executor() local
287 ready_nodes.push_back(test::graph::NoOp(g, {})); in BM_executor()
293 std::shuffle(ready_nodes.begin(), ready_nodes.end(), rng); in BM_executor()
294 r = 1 + rand.Rand32() % (ready_nodes.size()); in BM_executor()
297 control_inputs.push_back(ready_nodes.back()); in BM_executor()
298 ready_nodes.pop_back(); in BM_executor()
304 ready_nodes.push_back(test::graph::NoOp(g, {n})); in BM_executor()
|
| /external/tensorflow/tensorflow/core/common_runtime/ |
| D | executor_test.cc | 445 std::vector<Node*> ready_nodes; in BM_executor() local
447 ready_nodes.push_back(test::graph::NoOp(g, {})); in BM_executor()
453 std::shuffle(ready_nodes.begin(), ready_nodes.end(), rng); in BM_executor()
454 r = 1 + rand.Rand32() % (ready_nodes.size()); in BM_executor()
457 control_inputs.push_back(ready_nodes.back()); in BM_executor()
458 ready_nodes.pop_back(); in BM_executor()
464 ready_nodes.push_back(test::graph::NoOp(g, {n})); in BM_executor()
|
| /external/tensorflow/tensorflow/core/distributed_runtime/ |
| D | scheduler.cc | 260 sim->ready_nodes.push_back(event.node); in ComputeSchedule()
266 !sim->ready_nodes.empty()) { in ComputeSchedule()
268 e.node = GetNodeWithHighestPriority(sim->ready_nodes); in ComputeSchedule()
|
| D | scheduler.h | 60 std::vector<const Node*> ready_nodes; member
|
| /external/tensorflow/tensorflow/core/grappler/costs/ |
| D | virtual_scheduler.h | 455 ReadyNodeManager* ready_nodes,
463 VirtualScheduler(ReadyNodeManager* ready_nodes,
|
| D | virtual_scheduler.cc | 1318 ReadyNodeManager* ready_nodes, in VirtualScheduler() argument
1323 ready_nodes_(ready_nodes) {} in VirtualScheduler()
1326 ReadyNodeManager* ready_nodes, in VirtualScheduler() argument
1328 : scheduler_state_(std::move(scheduler_state)), ready_nodes_(ready_nodes) {} in VirtualScheduler()
|