Lines Matching refs:SchedulingNode

36 void SchedulingGraph::AddDependency(SchedulingNode* node,  in AddDependency()
37 SchedulingNode* dependency, in AddDependency()
285 void SchedulingGraph::AddCrossIterationDependencies(SchedulingNode* node) { in AddCrossIterationDependencies()
298 SchedulingNode* def_node = GetNode(phi_input); in AddCrossIterationDependencies()
315 void SchedulingGraph::AddDependencies(SchedulingNode* instruction_node, in AddDependencies()
330 SchedulingNode* other_node = GetNode(other); in AddDependencies()
369 SchedulingNode* other_node = GetNode(other); in AddDependencies()
419 static void DumpAsDotNode(std::ostream& output, const SchedulingNode* node) { in DumpAsDotNode()
442 for (const SchedulingNode* predecessor : node->GetDataPredecessors()) { in DumpAsDotNode()
447 for (const SchedulingNode* predecessor : node->GetOtherPredecessors()) { in DumpAsDotNode()
455 const ScopedArenaVector<SchedulingNode*>& initial_candidates) { in DumpAsDotGraph()
464 SchedulingNode* node = entry.second.get(); in DumpAsDotGraph()
468 for (SchedulingNode* node : initial_candidates) { in DumpAsDotGraph()
478 SchedulingNode* CriticalPathSchedulingNodeSelector::SelectMaterializedCondition( in SelectMaterializedCondition()
479 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) const { in SelectMaterializedCondition()
504 SchedulingNode* condition_node = (condition != nullptr) ? graph.GetNode(condition) : nullptr; in SelectMaterializedCondition()
518 SchedulingNode* CriticalPathSchedulingNodeSelector::PopHighestPriorityNode( in PopHighestPriorityNode()
519 ScopedArenaVector<SchedulingNode*>* nodes, const SchedulingGraph& graph) { in PopHighestPriorityNode()
521 SchedulingNode* select_node = nullptr; in PopHighestPriorityNode()
531 SchedulingNode* check = (*nodes)[i]; in PopHighestPriorityNode()
532 SchedulingNode* candidate = (*nodes)[select]; in PopHighestPriorityNode()
545 SchedulingNode* CriticalPathSchedulingNodeSelector::GetHigherPrioritySchedulingNode( in GetHigherPrioritySchedulingNode()
546 SchedulingNode* candidate, SchedulingNode* check) const { in GetHigherPrioritySchedulingNode()
579 ScopedArenaVector<SchedulingNode*> scheduling_nodes(allocator.Adapter(kArenaAllocScheduler)); in Schedule()
589 SchedulingNode* node = scheduling_graph.AddNode(instruction, IsSchedulingBarrier(instruction)); in Schedule()
602 ScopedArenaVector<SchedulingNode*> candidates(allocator.Adapter(kArenaAllocScheduler)); in Schedule()
605 for (SchedulingNode* node : scheduling_nodes) { in Schedule()
612 ScopedArenaVector<SchedulingNode*> initial_candidates(allocator.Adapter(kArenaAllocScheduler)); in Schedule()
621 SchedulingNode* node = selector_->PopHighestPriorityNode(&candidates, scheduling_graph); in Schedule()
635 void HScheduler::Schedule(SchedulingNode* scheduling_node, in Schedule()
636 /*inout*/ ScopedArenaVector<SchedulingNode*>* candidates) { in Schedule()
640 for (SchedulingNode* predecessor : scheduling_node->GetDataPredecessors()) { in Schedule()
648 for (SchedulingNode* predecessor : scheduling_node->GetOtherPredecessors()) { in Schedule()