summaryrefslogtreecommitdiff
path: root/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
diff options
context:
space:
mode:
authorEvan Cheng <evan.cheng@apple.com>2006-03-06 07:31:44 +0000
committerEvan Cheng <evan.cheng@apple.com>2006-03-06 07:31:44 +0000
commitadc5e5c85fdf188166690084675a971aa5e9f188 (patch)
tree38fb9fc3d62ca7e9f4721bb3145a6cb03ab1a844 /lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
parent78df5c3121b2fa212354faaab32d81c8399bcbb4 (diff)
downloadllvm-adc5e5c85fdf188166690084675a971aa5e9f188.tar.gz
llvm-adc5e5c85fdf188166690084675a971aa5e9f188.tar.bz2
llvm-adc5e5c85fdf188166690084675a971aa5e9f188.tar.xz
Remove some code that doesn't make sense
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26572 91177308-0d34-0410-b5e6-96231b3b80d8
Diffstat (limited to 'lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp')
-rw-r--r--lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp17
1 files changed, 5 insertions, 12 deletions
diff --git a/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp b/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
index dfaf373b72..dfd46b7d01 100644
--- a/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
+++ b/lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
@@ -120,8 +120,6 @@ void SUnit::dump(const SelectionDAG *G, bool All) const {
/// Sorting functions for the Available queue.
struct ls_rr_sort : public std::binary_function<SUnit*, SUnit*, bool> {
bool operator()(const SUnit* left, const SUnit* right) const {
- bool LFloater = (left ->Preds.size() == 0);
- bool RFloater = (right->Preds.size() == 0);
int LBonus = (int)left ->isDefNUseOperand;
int RBonus = (int)right->isDefNUseOperand;
@@ -144,19 +142,14 @@ struct ls_rr_sort : public std::binary_function<SUnit*, SUnit*, bool> {
int LPriority2 = left ->SethiUllman + LBonus;
int RPriority2 = right->SethiUllman + RBonus;
- // Favor floaters (i.e. node with no non-passive predecessors):
- // e.g. MOV32ri.
- if (!LFloater && RFloater)
+ if (LPriority1 > RPriority1)
return true;
- else if (LFloater == RFloater)
- if (LPriority1 > RPriority1)
+ else if (LPriority1 == RPriority1)
+ if (LPriority2 < RPriority2)
return true;
- else if (LPriority1 == RPriority1)
- if (LPriority2 < RPriority2)
+ else if (LPriority2 == RPriority2)
+ if (left->CycleBound > right->CycleBound)
return true;
- else if (LPriority2 == RPriority2)
- if (left->CycleBound > right->CycleBound)
- return true;
return false;
}