6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-03-15 07:33:18 +00:00
Code Issues Projects Releases Wiki Activity

Remove redundant 'else's. No functionality change.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@61891 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2009-01-07 22:30:55 +00:00
parent 00ffd505d3
commit 25fd4037a7
1 changed files with 6 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

13
lib/CodeGen/SelectionDAG/ScheduleDAGRRList.cpp
View File

@ -971,27 +971,26 @@ namespace {
// allocation choices. But if it is a livein then perhaps we want it // allocation choices. But if it is a livein then perhaps we want it
// closer to its uses so it can be coalesced. // closer to its uses so it can be coalesced.
return 0xffff; return 0xffff;
else if (Opc == ISD::TokenFactor || Opc == ISD::CopyToReg) if (Opc == ISD::TokenFactor || Opc == ISD::CopyToReg)
// CopyToReg should be close to its uses to facilitate coalescing and // CopyToReg should be close to its uses to facilitate coalescing and
// avoid spilling. // avoid spilling.
return 0; return 0;
else if (Opc == TargetInstrInfo::EXTRACT_SUBREG || if (Opc == TargetInstrInfo::EXTRACT_SUBREG ||
Opc == TargetInstrInfo::INSERT_SUBREG) Opc == TargetInstrInfo::INSERT_SUBREG)
// EXTRACT_SUBREG / INSERT_SUBREG should be close to its use to // EXTRACT_SUBREG / INSERT_SUBREG should be close to its use to
// facilitate coalescing. // facilitate coalescing.
return 0; return 0;
else if (SU->NumSuccs == 0) if (SU->NumSuccs == 0)
// If SU does not have a use, i.e. it doesn't produce a value that would // If SU does not have a use, i.e. it doesn't produce a value that would
// be consumed (e.g. store), then it terminates a chain of computation. // be consumed (e.g. store), then it terminates a chain of computation.
// Give it a large SethiUllman number so it will be scheduled right // Give it a large SethiUllman number so it will be scheduled right
// before its predecessors that it doesn't lengthen their live ranges. // before its predecessors that it doesn't lengthen their live ranges.
return 0xffff; return 0xffff;
else if (SU->NumPreds == 0) if (SU->NumPreds == 0)
// If SU does not have a def, schedule it close to its uses because it // If SU does not have a def, schedule it close to its uses because it
// does not lengthen any live ranges. // does not lengthen any live ranges.
return 0; return 0;
else return SethiUllmanNumbers[SU->NodeNum];
return SethiUllmanNumbers[SU->NodeNum];
} }
unsigned size() const { return Queue.size(); } unsigned size() const { return Queue.size(); }