Home
last modified time | relevance | path

Searched refs:SchedulingGraph (Results 1 – 3 of 3) sorted by relevance

/art/compiler/optimizing/
Dscheduler.cc36 void SchedulingGraph::AddDependency(SchedulingNode* node, in AddDependency()
73 size_t SchedulingGraph::ArrayAccessHeapLocation(HInstruction* instruction) const { in ArrayAccessHeapLocation()
81 bool SchedulingGraph::ArrayAccessMayAlias(HInstruction* node, in ArrayAccessMayAlias()
151 size_t SchedulingGraph::FieldAccessHeapLocation(HInstruction* obj, const FieldInfo* field) const { in FieldAccessHeapLocation()
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()
300 void SchedulingGraph::AddDependencies(HInstruction* instruction, bool is_scheduling_barrier) { in AddDependencies()
391 bool SchedulingGraph::HasImmediateDataDependency(const SchedulingNode* node, in HasImmediateDataDependency()
[all …]
Dscheduler.h251 class SchedulingGraph : public ValueObject {
253 SchedulingGraph(const HScheduler* scheduler, in SchedulingGraph() function
374 const SchedulingGraph& graph) = 0;
394 const SchedulingGraph& graph) override { in PopHighestPriorityNode()
416 const SchedulingGraph& graph) override;
423 const SchedulingGraph& graph) const;
480 inline bool SchedulingGraph::IsSchedulingBarrier(const HInstruction* instruction) const { in IsSchedulingBarrier()
Dscheduler_test.cc149 SchedulingGraph scheduling_graph(scheduler, in TestBuildDependencyGraphAndSchedule()
286 SchedulingGraph scheduling_graph(scheduler, GetScopedAllocator(), &heap_location_collector); in TestDependencyGraphOnAliasingArrayAccesses()