RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-02-04 17:47:58 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Remove some code that doesn't make sense

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26572 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng 2006-03-06 07:31:44 +00:00
parent 78df5c3121
commit adc5e5c85f
1 changed files with 5 additions and 12 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

17
lib/CodeGen/SelectionDAG/ScheduleDAGList.cpp
View File

@ -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;
}