36 void SchedulingGraph::AddDependency(SchedulingNode* node,  in AddDependency()
54 static bool MayHaveReorderingDependency(SideEffects node, SideEffects other) {  in MayHaveReorderingDependency()
81 bool SchedulingGraph::ArrayAccessMayAlias(HInstruction* node,  in ArrayAccessMayAlias()
163 bool SchedulingGraph::FieldAccessMayAlias(const HInstruction* node,  in FieldAccessMayAlias()
197 bool SchedulingGraph::HasMemoryDependency(HInstruction* node,  in HasMemoryDependency()
248 bool SchedulingGraph::HasExceptionDependency(const HInstruction* node,  in HasExceptionDependency()
267 bool SchedulingGraph::HasSideEffectDependency(HInstruction* node,  in HasSideEffectDependency()
391 bool SchedulingGraph::HasImmediateDataDependency(const SchedulingNode* node,  in HasImmediateDataDependency()
398   const SchedulingNode* node = GetNode(instruction);  in HasImmediateDataDependency()  local
410 bool SchedulingGraph::HasImmediateOtherDependency(const SchedulingNode* node,  in HasImmediateOtherDependency()
417   const SchedulingNode* node = GetNode(instruction);  in HasImmediateOtherDependency()  local
435 static void DumpAsDotNode(std::ostream& output, const SchedulingNode* node) {  in DumpAsDotNode()
480     SchedulingNode* node = entry.second.get();  in DumpAsDotGraph()  local
604     SchedulingNode* node = scheduling_graph.AddNode(instruction, IsSchedulingBarrier(instruction));  in Schedule()  local
636     SchedulingNode* node = selector_->PopHighestPriorityNode(&candidates, scheduling_graph);  in Schedule()  local