Home
last modified time | relevance | path

Searched refs:scheduling_graph (Results 1 – 2 of 2) sorted by relevance

/art/compiler/optimizing/
Dscheduler_test.cc143 TestSchedulingGraph scheduling_graph(GetScopedAllocator()); in TestBuildDependencyGraphAndSchedule() local
146 scheduling_graph.AddNode(instr); in TestBuildDependencyGraphAndSchedule()
150 ASSERT_FALSE(scheduling_graph.HasImmediateDataDependency(add1, c1)); in TestBuildDependencyGraphAndSchedule()
151 ASSERT_FALSE(scheduling_graph.HasImmediateDataDependency(add2, c2)); in TestBuildDependencyGraphAndSchedule()
154 ASSERT_TRUE(scheduling_graph.HasImmediateDataDependency(add2, add1)); in TestBuildDependencyGraphAndSchedule()
155 ASSERT_FALSE(scheduling_graph.HasImmediateDataDependency(add1, add2)); in TestBuildDependencyGraphAndSchedule()
156 ASSERT_TRUE(scheduling_graph.HasImmediateDataDependency(div_check, add2)); in TestBuildDependencyGraphAndSchedule()
157 ASSERT_FALSE(scheduling_graph.HasImmediateDataDependency(div_check, add1)); in TestBuildDependencyGraphAndSchedule()
158 ASSERT_TRUE(scheduling_graph.HasImmediateDataDependency(div, div_check)); in TestBuildDependencyGraphAndSchedule()
159 ASSERT_TRUE(scheduling_graph.HasImmediateDataDependency(array_set1, add1)); in TestBuildDependencyGraphAndSchedule()
[all …]
Dscheduler.cc581 SchedulingGraph scheduling_graph(&allocator, heap_location_collector); in Schedule() local
588 SchedulingNode* node = scheduling_graph.AddNode(instruction, IsSchedulingBarrier(instruction)); in Schedule()
593 if (scheduling_graph.Size() <= 1) { in Schedule()
620 SchedulingNode* node = selector_->PopHighestPriorityNode(&candidates, scheduling_graph); in Schedule()
630 scheduling_graph.DumpAsDotGraph(description.str(), initial_candidates); in Schedule()