RPCS3/llvm
1
0
Fork 0
mirror of https://github.com/RPCS3/llvm.git synced 2025-04-03 05:41:42 +00:00
Code Issues Actions Packages Projects Releases Wiki Activity

Change errs() to dbgs().

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@92571 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
David Greene 2010-01-05 01:24:43 +00:00
parent 7419b1806a
commit ec2d7fe924
1 changed files with 6 additions and 6 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -87,7 +87,7 @@ private:
/// Schedule - Schedule the DAG using list scheduling. /// Schedule - Schedule the DAG using list scheduling.
void ScheduleDAGList::Schedule() { void ScheduleDAGList::Schedule() {
DEBUG(errs() << "********** List Scheduling **********\n"); DEBUG(dbgs() << "********** List Scheduling **********\n");
// Build the scheduling graph. // Build the scheduling graph.
BuildSchedGraph(NULL); BuildSchedGraph(NULL);
@ -110,9 +110,9 @@ void ScheduleDAGList::ReleaseSucc(SUnit *SU, const SDep &D) {
#ifndef NDEBUG #ifndef NDEBUG
if (SuccSU->NumPredsLeft == 0) { if (SuccSU->NumPredsLeft == 0) {
errs() << "*** Scheduling failed! ***\n"; dbgs() << "*** Scheduling failed! ***\n";
SuccSU->dump(this); SuccSU->dump(this);
errs() << " has been released too many times!\n"; dbgs() << " has been released too many times!\n";
llvm_unreachable(0); llvm_unreachable(0);
} }
#endif #endif
@ -141,7 +141,7 @@ void ScheduleDAGList::ReleaseSuccessors(SUnit *SU) {
/// count of its successors. If a successor pending count is zero, add it to /// count of its successors. If a successor pending count is zero, add it to
/// the Available queue. /// the Available queue.
void ScheduleDAGList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) { void ScheduleDAGList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
DEBUG(errs() << "*** Scheduling [" << CurCycle << "]: "); DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");
DEBUG(SU->dump(this)); DEBUG(SU->dump(this));
Sequence.push_back(SU); Sequence.push_back(SU);
@ -233,7 +233,7 @@ void ScheduleDAGList::ListScheduleTopDown() {
} else if (!HasNoopHazards) { } else if (!HasNoopHazards) {
// Otherwise, we have a pipeline stall, but no other problem, just advance // Otherwise, we have a pipeline stall, but no other problem, just advance
// the current cycle and try again. // the current cycle and try again.
DEBUG(errs() << "*** Advancing cycle, no work to do\n"); DEBUG(dbgs() << "*** Advancing cycle, no work to do\n");
HazardRec->AdvanceCycle(); HazardRec->AdvanceCycle();
++NumStalls; ++NumStalls;
++CurCycle; ++CurCycle;
@ -241,7 +241,7 @@ void ScheduleDAGList::ListScheduleTopDown() {
// Otherwise, we have no instructions to issue and we have instructions // Otherwise, we have no instructions to issue and we have instructions
// that will fault if we don't do this right. This is the case for // that will fault if we don't do this right. This is the case for
// processors without pipeline interlocks and other cases. // processors without pipeline interlocks and other cases.
DEBUG(errs() << "*** Emitting noop\n"); DEBUG(dbgs() << "*** Emitting noop\n");
HazardRec->EmitNoop(); HazardRec->EmitNoop();
Sequence.push_back(0); // NULL here means noop Sequence.push_back(0); // NULL here means noop
++NumNoops; ++NumNoops;