Searched refs:ready_nodes (Results 1 – 9 of 9) sorted by relevance
52 std::vector<int>* ready_nodes) { in ComputeTopologicalOrder() argument61 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()85 ready_nodes->push_back(fanout); in ComputeTopologicalOrder()105 std::vector<int> ready_nodes; in ComputeTopologicalOrder() local107 ComputeTopologicalOrder(graph, extra_dependencies, &ready_nodes)); in ComputeTopologicalOrder()109 topo_order->reserve(ready_nodes.size()); in ComputeTopologicalOrder()110 for (int ready_node_idx : ready_nodes) { in ComputeTopologicalOrder()123 std::vector<int> ready_nodes; in ReversedTopologicalSort() local[all …]
35 std::deque<const NodeDef*> ready_nodes; in InferFromGraphView() local40 ready_nodes.push_back(&node); in InferFromGraphView()49 while (!ready_nodes.empty()) { in InferFromGraphView()50 const NodeDef* ready_node = ready_nodes.front(); in InferFromGraphView()88 ready_nodes.push_back(fanout.node); in InferFromGraphView()115 ready_nodes.pop_front(); in InferFromGraphView()
64 std::deque<const NodeDef*> ready_nodes; in EstimateEarliestExecutionTimes() local68 ready_nodes.push_back(&node); in EstimateEarliestExecutionTimes()99 while (!ready_nodes.empty()) { in EstimateEarliestExecutionTimes()100 const NodeDef* node = ready_nodes.front(); in EstimateEarliestExecutionTimes()101 ready_nodes.pop_front(); in EstimateEarliestExecutionTimes()115 ready_nodes.push_back(fanout); in EstimateEarliestExecutionTimes()152 std::deque<const NodeDef*> ready_nodes; in EstimateRequiredTimes() local159 ready_nodes.push_back(&node); in EstimateRequiredTimes()167 while (!ready_nodes.empty()) { in EstimateRequiredTimes()168 const NodeDef* node = ready_nodes.front(); in EstimateRequiredTimes()[all …]
256 std::vector<Node*> ready_nodes; in BM_executor() local258 ready_nodes.push_back(test::graph::NoOp(g, {})); in BM_executor()262 std::random_shuffle(ready_nodes.begin(), ready_nodes.end()); in BM_executor()263 r = 1 + rand.Rand32() % (ready_nodes.size()); in BM_executor()266 control_inputs.push_back(ready_nodes.back()); in BM_executor()267 ready_nodes.pop_back(); in BM_executor()273 ready_nodes.push_back(test::graph::NoOp(g, {n})); in BM_executor()
425 std::vector<Node*> ready_nodes; in BM_executor() local427 ready_nodes.push_back(test::graph::NoOp(g, {})); in BM_executor()431 std::random_shuffle(ready_nodes.begin(), ready_nodes.end()); in BM_executor()432 r = 1 + rand.Rand32() % (ready_nodes.size()); in BM_executor()435 control_inputs.push_back(ready_nodes.back()); in BM_executor()436 ready_nodes.pop_back(); in BM_executor()442 ready_nodes.push_back(test::graph::NoOp(g, {n})); in BM_executor()
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()
60 std::vector<const Node*> ready_nodes; member
266 ReadyNodeManager* ready_nodes);
262 ReadyNodeManager* ready_nodes) in VirtualScheduler() argument263 : ready_nodes_(ready_nodes), in VirtualScheduler()