RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-01-15 22:37:59 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

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

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@184130 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andrew Trick 2013-06-17 21:45:07 +00:00
parent e52d502f04
commit 07023fef3a
1 changed files with 0 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
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.