diff options
| author | Andrew Trick <atrick@apple.com> | 2013-01-24 02:09:57 +0000 |
|---|---|---|
| committer | Andrew Trick <atrick@apple.com> | 2013-01-24 02:09:57 +0000 |
| commit | 92da42406e8135e2b133a85e10483a993889779b (patch) | |
| tree | 350b6a041cc130da82466e1b06c652dac1486072 /llvm/lib/CodeGen/MachineScheduler.cpp | |
| parent | d3b8629a53ec5cc133e08b8e74a2b38988e78693 (diff) | |
| download | bcm5719-llvm-92da42406e8135e2b133a85e10483a993889779b.tar.gz bcm5719-llvm-92da42406e8135e2b133a85e10483a993889779b.zip | |
MachineScheduler: enable biasCriticalPath for all DAGs.
llvm-svn: 173318
Diffstat (limited to 'llvm/lib/CodeGen/MachineScheduler.cpp')
| -rw-r--r-- | llvm/lib/CodeGen/MachineScheduler.cpp | 4 |
1 files changed, 4 insertions, 0 deletions
diff --git a/llvm/lib/CodeGen/MachineScheduler.cpp b/llvm/lib/CodeGen/MachineScheduler.cpp index c949266b8b2..b9198e8fc6c 100644 --- a/llvm/lib/CodeGen/MachineScheduler.cpp +++ b/llvm/lib/CodeGen/MachineScheduler.cpp @@ -563,6 +563,10 @@ void ScheduleDAGMI::releaseRoots() { for (std::vector<SUnit>::iterator I = SUnits.begin(), E = SUnits.end(); I != E; ++I) { SUnit *SU = &(*I); + + // Order predecessors so DFSResult follows the critical path. + SU->biasCriticalPath(); + // A SUnit is ready to top schedule if it has no predecessors. if (!I->NumPredsLeft && SU != &EntrySU) SchedImpl->releaseTopNode(SU); |
