summaryrefslogtreecommitdiff
path: root/lib/CodeGen/LatencyPriorityQueue.cpp
diff options
context:
space:
mode:
authorAndrew Trick <atrick@apple.com>2012-02-22 06:08:11 +0000
committerAndrew Trick <atrick@apple.com>2012-02-22 06:08:11 +0000
commitb4566a999970b514d7c6973d99e293a6625d3f70 (patch)
treee1dab12fabb7e460c56467210a23c15d87138e2f /lib/CodeGen/LatencyPriorityQueue.cpp
parent44d23825d61d530b8d562329ec8fc2d4f843bb8d (diff)
downloadllvm-b4566a999970b514d7c6973d99e293a6625d3f70.tar.gz
llvm-b4566a999970b514d7c6973d99e293a6625d3f70.tar.bz2
llvm-b4566a999970b514d7c6973d99e293a6625d3f70.tar.xz
Initialize SUnits before DAG building.
Affect on SD scheduling and postRA scheduling: Printing the DAG will display the nodes in top-down topological order. This matches the order within the MBB and makes my life much easier in general. Affect on misched: We don't need to track virtual register uses at all. This is awesome. I also intend to rely on the SUnit ID as a topo-sort index. So if A < B then we cannot have an edge B -> A. git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@151135 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/LatencyPriorityQueue.cpp')
-rw-r--r--lib/CodeGen/LatencyPriorityQueue.cpp2
1 files changed, 1 insertions, 1 deletions
diff --git a/lib/CodeGen/LatencyPriorityQueue.cpp b/lib/CodeGen/LatencyPriorityQueue.cpp
index 0eb009ddac..0578229432 100644
--- a/lib/CodeGen/LatencyPriorityQueue.cpp
+++ b/lib/CodeGen/LatencyPriorityQueue.cpp
@@ -46,7 +46,7 @@ bool latency_sort::operator()(const SUnit *LHS, const SUnit *RHS) const {
// Finally, just to provide a stable ordering, use the node number as a
// deciding factor.
- return LHSNum < RHSNum;
+ return RHSNum < LHSNum;
}