6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-10-04 00:54:53 +00:00
Code Issues Projects Releases Wiki Activity

mi-sched: smooth out the cyclicpath heuristic.

Browse Source 
Arnold's idea.

I generally try to avoid stateful heuristics because it can make
debugging harder. However, we need a way to prevent the latency
priority from dominating, and it somewhat makes sense to schedule
aggressively for latency only within an issue group.

Swift in particular likes this, and it doesn't hurt anyone else:
| Benchmarks/MiBench/consumer-lame              |  10.39% |
| Benchmarks/Misc/himenobmtxpa                  |   9.63% |

git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@190360 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andrew Trick 2013-09-09 22:28:08 +00:00
parent 3af4d25067
commit ee50a46026
1 changed files with 4 additions and 1 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

5
lib/CodeGen/MachineScheduler.cpp
View File

@ -2492,7 +2492,10 @@ void ConvergingScheduler::tryCandidate(SchedCandidate &Cand,
return;
// For loops that are acyclic path limited, aggressively schedule for latency.
if (Rem.IsAcyclicLatencyLimited && tryLatency(TryCand, Cand, Zone))
// This can result in very long dependence chains scheduled in sequence, so
// once every cycle (when CurrMOps == 0), switch to normal heuristics.
if (Rem.IsAcyclicLatencyLimited && !Zone.CurrMOps
&& tryLatency(TryCand, Cand, Zone))
return;
// Keep clustered nodes together to encourage downstream peephole