6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2024-11-02 07:11:49 +00:00
Code Issues Projects Releases Wiki Activity

Change errs() to dbgs().

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@92585 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
David Greene 2010-01-05 01:25:41 +00:00
parent 0d5c06e0b6
commit 4b134d1661
1 changed files with 40 additions and 40 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

80
lib/CodeGen/ScheduleDAG.cpp
View File

@ -41,7 +41,7 @@ void ScheduleDAG::dumpSchedule() const {
if (SUnit *SU = Sequence[i])
SU->dump(this);
else
errs() << "**** NOOP ****\n";
dbgs() << "**** NOOP ****\n";
}
}
@ -61,9 +61,9 @@ void ScheduleDAG::Run(MachineBasicBlock *bb,
Schedule();
DEBUG({
errs() << "*** Final schedule ***\n";
dbgs() << "*** Final schedule ***\n";
dumpSchedule();
errs() << '\n';
dbgs() << '\n';
});
}
@ -271,58 +271,58 @@ void SUnit::ComputeHeight() {
/// SUnit - Scheduling unit. It's an wrapper around either a single SDNode or
/// a group of nodes flagged together.
void SUnit::dump(const ScheduleDAG *G) const {
errs() << "SU(" << NodeNum << "): ";
dbgs() << "SU(" << NodeNum << "): ";
G->dumpNode(this);
}
void SUnit::dumpAll(const ScheduleDAG *G) const {
dump(G);
errs() << " # preds left : " << NumPredsLeft << "\n";
errs() << " # succs left : " << NumSuccsLeft << "\n";
errs() << " Latency : " << Latency << "\n";
errs() << " Depth : " << Depth << "\n";
errs() << " Height : " << Height << "\n";
dbgs() << " # preds left : " << NumPredsLeft << "\n";
dbgs() << " # succs left : " << NumSuccsLeft << "\n";
dbgs() << " Latency : " << Latency << "\n";
dbgs() << " Depth : " << Depth << "\n";
dbgs() << " Height : " << Height << "\n";
if (Preds.size() != 0) {
errs() << " Predecessors:\n";
dbgs() << " Predecessors:\n";
for (SUnit::const_succ_iterator I = Preds.begin(), E = Preds.end();
I != E; ++I) {
errs() << " ";
dbgs() << " ";
switch (I->getKind()) {
case SDep::Data: errs() << "val "; break;
case SDep::Anti: errs() << "anti"; break;
case SDep::Output: errs() << "out "; break;
case SDep::Order: errs() << "ch "; break;
case SDep::Data: dbgs() << "val "; break;
case SDep::Anti: dbgs() << "anti"; break;
case SDep::Output: dbgs() << "out "; break;
case SDep::Order: dbgs() << "ch "; break;
}
errs() << "#";
errs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
dbgs() << "#";
dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
if (I->isArtificial())
errs() << " *";
errs() << ": Latency=" << I->getLatency();
errs() << "\n";
dbgs() << " *";
dbgs() << ": Latency=" << I->getLatency();
dbgs() << "\n";
}
}
if (Succs.size() != 0) {
errs() << " Successors:\n";
dbgs() << " Successors:\n";
for (SUnit::const_succ_iterator I = Succs.begin(), E = Succs.end();
I != E; ++I) {
errs() << " ";
dbgs() << " ";
switch (I->getKind()) {
case SDep::Data: errs() << "val "; break;
case SDep::Anti: errs() << "anti"; break;
case SDep::Output: errs() << "out "; break;
case SDep::Order: errs() << "ch "; break;
case SDep::Data: dbgs() << "val "; break;
case SDep::Anti: dbgs() << "anti"; break;
case SDep::Output: dbgs() << "out "; break;
case SDep::Order: dbgs() << "ch "; break;
}
errs() << "#";
errs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
dbgs() << "#";
dbgs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
if (I->isArtificial())
errs() << " *";
errs() << ": Latency=" << I->getLatency();
errs() << "\n";
dbgs() << " *";
dbgs() << ": Latency=" << I->getLatency();
dbgs() << "\n";
}
}
errs() << "\n";
dbgs() << "\n";
}
#ifndef NDEBUG
@ -340,35 +340,35 @@ void ScheduleDAG::VerifySchedule(bool isBottomUp) {
continue;
}
if (!AnyNotSched)
errs() << "*** Scheduling failed! ***\n";
dbgs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
errs() << "has not been scheduled!\n";
dbgs() << "has not been scheduled!\n";
AnyNotSched = true;
}
if (SUnits[i].isScheduled &&
(isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) >
unsigned(INT_MAX)) {
if (!AnyNotSched)
errs() << "*** Scheduling failed! ***\n";
dbgs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
errs() << "has an unexpected "
dbgs() << "has an unexpected "
<< (isBottomUp ? "Height" : "Depth") << " value!\n";
AnyNotSched = true;
}
if (isBottomUp) {
if (SUnits[i].NumSuccsLeft != 0) {
if (!AnyNotSched)
errs() << "*** Scheduling failed! ***\n";
dbgs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
errs() << "has successors left!\n";
dbgs() << "has successors left!\n";
AnyNotSched = true;
}
} else {
if (SUnits[i].NumPredsLeft != 0) {
if (!AnyNotSched)
errs() << "*** Scheduling failed! ***\n";
dbgs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
errs() << "has predecessors left!\n";
dbgs() << "has predecessors left!\n";
AnyNotSched = true;
}
}