6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-05-02 20:38:34 +00:00
Code Issues Projects Releases Wiki Activity

Reduce indentation.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@99214 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng 2010-03-22 21:24:33 +00:00
parent 93dc92e412
commit a69ec09364
1 changed files with 34 additions and 35 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
lib/CodeGen/ScheduleDAGInstrs.cpp
View File

@ -248,15 +248,15 @@ void ScheduleDAGInstrs::BuildSchedGraph(AliasAnalysis *AA) {
unsigned DataLatency = SU->Latency; unsigned DataLatency = SU->Latency;
for (unsigned i = 0, e = UseList.size(); i != e; ++i) { for (unsigned i = 0, e = UseList.size(); i != e; ++i) {
SUnit *UseSU = UseList[i]; SUnit *UseSU = UseList[i];
if (UseSU != SU) { if (UseSU == SU)
continue;
unsigned LDataLatency = DataLatency; unsigned LDataLatency = DataLatency;
// Optionally add in a special extra latency for nodes that // Optionally add in a special extra latency for nodes that
// feed addresses. // feed addresses.
// TODO: Do this for register aliases too. // TODO: Do this for register aliases too.
// TODO: Perhaps we should get rid of // TODO: Perhaps we should get rid of
// SpecialAddressLatency and just move this into // SpecialAddressLatency and just move this into
// adjustSchedDependency for the targets that care about // adjustSchedDependency for the targets that care about it.
// it.
if (SpecialAddressLatency != 0 && !UnitLatencies) { if (SpecialAddressLatency != 0 && !UnitLatencies) {
MachineInstr *UseMI = UseSU->getInstr(); MachineInstr *UseMI = UseSU->getInstr();
const TargetInstrDesc &UseTID = UseMI->getDesc(); const TargetInstrDesc &UseTID = UseMI->getDesc();
@ -277,12 +277,12 @@ void ScheduleDAGInstrs::BuildSchedGraph(AliasAnalysis *AA) {
} }
UseSU->addPred(dep); UseSU->addPred(dep);
} }
}
for (const unsigned *Alias = TRI->getAliasSet(Reg); *Alias; ++Alias) { for (const unsigned *Alias = TRI->getAliasSet(Reg); *Alias; ++Alias) {
std::vector<SUnit *> &UseList = Uses[*Alias]; std::vector<SUnit *> &UseList = Uses[*Alias];
for (unsigned i = 0, e = UseList.size(); i != e; ++i) { for (unsigned i = 0, e = UseList.size(); i != e; ++i) {
SUnit *UseSU = UseList[i]; SUnit *UseSU = UseList[i];
if (UseSU != SU) { if (UseSU == SU)
continue;
const SDep& dep = SDep(SU, SDep::Data, DataLatency, *Alias); const SDep& dep = SDep(SU, SDep::Data, DataLatency, *Alias);
if (!UnitLatencies) { if (!UnitLatencies) {
ComputeOperandLatency(SU, UseSU, (SDep &)dep); ComputeOperandLatency(SU, UseSU, (SDep &)dep);
@ -291,7 +291,6 @@ void ScheduleDAGInstrs::BuildSchedGraph(AliasAnalysis *AA) {
UseSU->addPred(dep); UseSU->addPred(dep);
} }
} }
}
// If a def is going to wrap back around to the top of the loop, // If a def is going to wrap back around to the top of the loop,
// backschedule it. // backschedule it.