6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-11-23 16:19:52 +00:00
Code Issues Projects Releases Wiki Activity

Boogs.

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@42388 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Evan Cheng
2007-09-27 07:29:27 +00:00
parent a2ee2756f7
commit 2dc7a0e075
1 changed files with 10 additions and 10 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@@ -427,20 +427,20 @@ SUnit *ScheduleDAGRRList::CopyAndMoveSuccessors(SUnit *SU) {
// Only copy scheduled successors. Cut them from old node's successor // Only copy scheduled successors. Cut them from old node's successor
// list and move them over. // list and move them over.
SmallVector<SDep*, 2> DelDeps; SmallVector<std::pair<SUnit*, bool>, 4> DelDeps;
for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
I != E; ++I) { I != E; ++I) {
if (I->isSpecial) if (I->isSpecial)
continue; continue;
NewSU->Height = std::max(NewSU->Height, I->Dep->Height+1);
if (I->Dep->isScheduled) { if (I->Dep->isScheduled) {
NewSU->Height = std::max(NewSU->Height, I->Dep->Height+1);
I->Dep->addPred(NewSU, I->isCtrl, false, I->Reg, I->Cost); I->Dep->addPred(NewSU, I->isCtrl, false, I->Reg, I->Cost);
DelDeps.push_back(I); DelDeps.push_back(std::make_pair(I->Dep, I->isCtrl));
} }
} }
for (unsigned i = 0, e = DelDeps.size(); i != e; ++i) { for (unsigned i = 0, e = DelDeps.size(); i != e; ++i) {
SUnit *Succ = DelDeps[i]->Dep; SUnit *Succ = DelDeps[i].first;
bool isCtrl = DelDeps[i]->isCtrl; bool isCtrl = DelDeps[i].second;
Succ->removePred(SU, isCtrl, false); Succ->removePred(SU, isCtrl, false);
} }
@@ -469,20 +469,20 @@ void ScheduleDAGRRList::InsertCCCopiesAndMoveSuccs(SUnit *SU, unsigned Reg,
// Only copy scheduled successors. Cut them from old node's successor // Only copy scheduled successors. Cut them from old node's successor
// list and move them over. // list and move them over.
SmallVector<SDep*, 2> DelDeps; SmallVector<std::pair<SUnit*, bool>, 4> DelDeps;
for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end(); for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
I != E; ++I) { I != E; ++I) {
if (I->isSpecial) if (I->isSpecial)
continue; continue;
CopyToSU->Height = std::max(CopyToSU->Height, I->Dep->Height+1);
if (I->Dep->isScheduled) { if (I->Dep->isScheduled) {
CopyToSU->Height = std::max(CopyToSU->Height, I->Dep->Height+1);
I->Dep->addPred(CopyToSU, I->isCtrl, false, I->Reg, I->Cost); I->Dep->addPred(CopyToSU, I->isCtrl, false, I->Reg, I->Cost);
DelDeps.push_back(I); DelDeps.push_back(std::make_pair(I->Dep, I->isCtrl));
} }
} }
for (unsigned i = 0, e = DelDeps.size(); i != e; ++i) { for (unsigned i = 0, e = DelDeps.size(); i != e; ++i) {
SUnit *Succ = DelDeps[i]->Dep; SUnit *Succ = DelDeps[i].first;
bool isCtrl = DelDeps[i]->isCtrl; bool isCtrl = DelDeps[i].second;
Succ->removePred(SU, isCtrl, false); Succ->removePred(SU, isCtrl, false);
} }