6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-01-18 13:34:04 +00:00
Code Issues Projects Releases Wiki Activity

misched: trace formatting

Browse Source 
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@157455 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Andrew Trick 2012-05-25 02:02:39 +00:00
parent 43a699a112
commit c7a098fbb2
2 changed files with 7 additions and 7 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

11
lib/CodeGen/MachineScheduler.cpp
View File

@ -622,8 +622,6 @@ void ScheduleDAGMI::schedule() {
CurrentBottom = RegionEnd; CurrentBottom = RegionEnd;
bool IsTopNode = false; bool IsTopNode = false;
while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) { while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) {
DEBUG(dbgs() << "*** " << (IsTopNode ? "Top" : "Bottom")
<< " Scheduling Instruction");
if (!checkSchedLimit()) if (!checkSchedLimit())
break; break;
@ -671,7 +669,6 @@ void ScheduleDAGMI::schedule() {
} }
SU->isScheduled = true; SU->isScheduled = true;
SchedImpl->schedNode(SU, IsTopNode); SchedImpl->schedNode(SU, IsTopNode);
DEBUG(SU->dump(this));
} }
assert(CurrentTop == CurrentBottom && "Nonempty unscheduled zone."); assert(CurrentTop == CurrentBottom && "Nonempty unscheduled zone.");
@ -1198,6 +1195,11 @@ SUnit *ConvergingScheduler::pickNode(bool &IsTopNode) {
Top.removeReady(SU); Top.removeReady(SU);
if (SU->isBottomReady()) if (SU->isBottomReady())
Bot.removeReady(SU); Bot.removeReady(SU);
DEBUG(dbgs() << "*** " << (IsTopNode ? "Top" : "Bottom")
<< " Scheduling Instruction in cycle "
<< (IsTopNode ? Top.CurrCycle : Bot.CurrCycle) << '\n';
SU->dump(DAG));
return SU; return SU;
} }
@ -1205,9 +1207,6 @@ SUnit *ConvergingScheduler::pickNode(bool &IsTopNode) {
/// that was just returned by pickNode(). However, ScheduleDAGMI needs to update /// that was just returned by pickNode(). However, ScheduleDAGMI needs to update
/// it's state based on the current cycle before MachineSchedStrategy. /// it's state based on the current cycle before MachineSchedStrategy.
void ConvergingScheduler::schedNode(SUnit *SU, bool IsTopNode) { void ConvergingScheduler::schedNode(SUnit *SU, bool IsTopNode) {
DEBUG(dbgs() << " in cycle " << (IsTopNode ? Top.CurrCycle : Bot.CurrCycle)
<< '\n');
// Update the reservation table. // Update the reservation table.
if (IsTopNode && Top.HazardRec->isEnabled()) { if (IsTopNode && Top.HazardRec->isEnabled()) {
Top.HazardRec->EmitInstruction(SU); Top.HazardRec->EmitInstruction(SU);

3
lib/CodeGen/ScoreboardHazardRecognizer.cpp
View File

@ -151,7 +151,8 @@ ScoreboardHazardRecognizer::getHazardType(SUnit *SU, int Stalls) {
} }
if (!freeUnits) { if (!freeUnits) {
DEBUG(dbgs() << "*** Hazard in cycle " << (cycle + i) << ", "); DEBUG(dbgs() << "*** Hazard in cycle " << ((cycle+i) < 0 ? "" : "+")
<< (cycle + i) << ", ");
DEBUG(dbgs() << "SU(" << SU->NodeNum << "): "); DEBUG(dbgs() << "SU(" << SU->NodeNum << "): ");
DEBUG(DAG->dumpNode(SU)); DEBUG(DAG->dumpNode(SU));
return Hazard; return Hazard;