replica
/
hanchenye-llvm-project
2
0
Fork 0
Code Issues Pull Requests Projects Releases Wiki Activity

MI-Sched: Remove another heuristic that is sensitive to queue order. 

llvm-svn: 184130
This commit is contained in:
Andrew Trick 2013-06-17 21:45:07 +00:00
parent d40d0f2c1b
commit 7e63046ce9
1 changed files with 0 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
llvm/lib/CodeGen/MachineScheduler.cpp
View File

@ -2113,15 +2113,9 @@ void ConvergingScheduler::tryCandidate(SchedCandidate &Cand,
return;
// Weak edges are for clustering and other constraints.
//
// Deferring TryCand here does not change Cand's reason. This is good in the
// sense that a bad candidate shouldn't affect a previous candidate's
// goodness, but bad in that it is assymetric and depends on queue order.
CandReason OrigReason = Cand.Reason;
if (tryLess(getWeakLeft(TryCand.SU, Zone.isTop()),
getWeakLeft(Cand.SU, Zone.isTop()),
TryCand, Cand, Weak)) {
Cand.Reason = OrigReason;
return;
}
// Avoid critical resource consumption and balance the schedule.