#define DEBUG_TYPE "pre-RA-sched"
#include "llvm/CodeGen/ScheduleDAG.h"
+#include "llvm/CodeGen/ScheduleHazardRecognizer.h"
#include "llvm/Target/TargetMachine.h"
#include "llvm/Target/TargetInstrInfo.h"
#include "llvm/Target/TargetRegisterInfo.h"
#include "llvm/Support/Debug.h"
+#include "llvm/Support/raw_ostream.h"
#include <climits>
using namespace llvm;
-ScheduleDAG::ScheduleDAG(SelectionDAG *dag, MachineBasicBlock *bb,
- const TargetMachine &tm)
- : DAG(dag), BB(bb), TM(tm), MRI(BB->getParent()->getRegInfo()) {
- TII = TM.getInstrInfo();
- MF = BB->getParent();
- TRI = TM.getRegisterInfo();
- TLI = TM.getTargetLowering();
- ConstPool = MF->getConstantPool();
+ScheduleDAG::ScheduleDAG(MachineFunction &mf)
+ : TM(mf.getTarget()),
+ TII(TM.getInstrInfo()),
+ TRI(TM.getRegisterInfo()),
+ TLI(TM.getTargetLowering()),
+ MF(mf), MRI(mf.getRegInfo()),
+ ConstPool(MF.getConstantPool()),
+ EntrySU(), ExitSU() {
}
ScheduleDAG::~ScheduleDAG() {}
if (SUnit *SU = Sequence[i])
SU->dump(this);
else
- cerr << "**** NOOP ****\n";
+ errs() << "**** NOOP ****\n";
}
}
/// Run - perform scheduling.
///
-void ScheduleDAG::Run() {
+void ScheduleDAG::Run(MachineBasicBlock *bb,
+ MachineBasicBlock::iterator insertPos) {
+ BB = bb;
+ InsertPos = insertPos;
+
+ SUnits.clear();
+ Sequence.clear();
+ EntrySU = SUnit();
+ ExitSU = SUnit();
+
Schedule();
-
- DOUT << "*** Final schedule ***\n";
- DEBUG(dumpSchedule());
- DOUT << "\n";
+
+ DEBUG({
+ errs() << "*** Final schedule ***\n";
+ dumpSchedule();
+ errs() << '\n';
+ });
}
/// addPred - This adds the specified edge as a pred of the current node if
/// specified node.
void SUnit::addPred(const SDep &D) {
// If this node already has this depenence, don't add a redundant one.
- for (unsigned i = 0, e = (unsigned)Preds.size(); i != e; ++i)
- if (Preds[i] == D)
+ for (SmallVector<SDep, 4>::const_iterator I = Preds.begin(), E = Preds.end();
+ I != E; ++I)
+ if (*I == D)
return;
// Now add a corresponding succ to N.
SDep P = D;
SUnit *N = D.getSUnit();
// Update the bookkeeping.
if (D.getKind() == SDep::Data) {
+ assert(NumPreds < UINT_MAX && "NumPreds will overflow!");
+ assert(N->NumSuccs < UINT_MAX && "NumSuccs will overflow!");
++NumPreds;
++N->NumSuccs;
}
- if (!N->isScheduled)
+ if (!N->isScheduled) {
+ assert(NumPredsLeft < UINT_MAX && "NumPredsLeft will overflow!");
++NumPredsLeft;
- if (!isScheduled)
+ }
+ if (!isScheduled) {
+ assert(N->NumSuccsLeft < UINT_MAX && "NumSuccsLeft will overflow!");
++N->NumSuccsLeft;
- N->Succs.push_back(P);
+ }
Preds.push_back(D);
- this->setDepthDirty();
- N->setHeightDirty();
+ N->Succs.push_back(P);
+ if (P.getLatency() != 0) {
+ this->setDepthDirty();
+ N->setHeightDirty();
+ }
}
/// removePred - This removes the specified edge as a pred of the current
}
assert(FoundSucc && "Mismatching preds / succs lists!");
Preds.erase(I);
- // Update the bookkeeping;
- if (D.getKind() == SDep::Data) {
+ // Update the bookkeeping.
+ if (P.getKind() == SDep::Data) {
+ assert(NumPreds > 0 && "NumPreds will underflow!");
+ assert(N->NumSuccs > 0 && "NumSuccs will underflow!");
--NumPreds;
--N->NumSuccs;
}
- if (!N->isScheduled)
+ if (!N->isScheduled) {
+ assert(NumPredsLeft > 0 && "NumPredsLeft will underflow!");
--NumPredsLeft;
- if (!isScheduled)
+ }
+ if (!isScheduled) {
+ assert(N->NumSuccsLeft > 0 && "NumSuccsLeft will underflow!");
--N->NumSuccsLeft;
- this->setDepthDirty();
- N->setHeightDirty();
+ }
+ if (P.getLatency() != 0) {
+ this->setDepthDirty();
+ N->setHeightDirty();
+ }
return;
}
}
void SUnit::setDepthDirty() {
+ if (!isDepthCurrent) return;
SmallVector<SUnit*, 8> WorkList;
WorkList.push_back(this);
- while (!WorkList.empty()) {
+ do {
SUnit *SU = WorkList.pop_back_val();
- if (!SU->isDepthCurrent) continue;
SU->isDepthCurrent = false;
for (SUnit::const_succ_iterator I = SU->Succs.begin(),
- E = SU->Succs.end(); I != E; ++I)
- WorkList.push_back(I->getSUnit());
- }
+ E = SU->Succs.end(); I != E; ++I) {
+ SUnit *SuccSU = I->getSUnit();
+ if (SuccSU->isDepthCurrent)
+ WorkList.push_back(SuccSU);
+ }
+ } while (!WorkList.empty());
}
void SUnit::setHeightDirty() {
+ if (!isHeightCurrent) return;
SmallVector<SUnit*, 8> WorkList;
WorkList.push_back(this);
- while (!WorkList.empty()) {
+ do {
SUnit *SU = WorkList.pop_back_val();
- if (!SU->isHeightCurrent) continue;
SU->isHeightCurrent = false;
for (SUnit::const_pred_iterator I = SU->Preds.begin(),
- E = SU->Preds.end(); I != E; ++I)
- WorkList.push_back(I->getSUnit());
- }
+ E = SU->Preds.end(); I != E; ++I) {
+ SUnit *PredSU = I->getSUnit();
+ if (PredSU->isHeightCurrent)
+ WorkList.push_back(PredSU);
+ }
+ } while (!WorkList.empty());
}
/// setDepthToAtLeast - Update this node's successors to reflect the
void SUnit::ComputeDepth() {
SmallVector<SUnit*, 8> WorkList;
WorkList.push_back(this);
- while (!WorkList.empty()) {
+ do {
SUnit *Cur = WorkList.back();
bool Done = true;
}
Cur->isDepthCurrent = true;
}
- }
+ } while (!WorkList.empty());
}
/// ComputeHeight - Calculate the maximal path from the node to the entry.
void SUnit::ComputeHeight() {
SmallVector<SUnit*, 8> WorkList;
WorkList.push_back(this);
- while (!WorkList.empty()) {
+ do {
SUnit *Cur = WorkList.back();
bool Done = true;
}
Cur->isHeightCurrent = true;
}
- }
+ } while (!WorkList.empty());
}
/// 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 {
- cerr << "SU(" << NodeNum << "): ";
+ errs() << "SU(" << NodeNum << "): ";
G->dumpNode(this);
}
void SUnit::dumpAll(const ScheduleDAG *G) const {
dump(G);
- cerr << " # preds left : " << NumPredsLeft << "\n";
- cerr << " # succs left : " << NumSuccsLeft << "\n";
- cerr << " Latency : " << Latency << "\n";
- cerr << " Depth : " << Depth << "\n";
- cerr << " Height : " << Height << "\n";
+ errs() << " # preds left : " << NumPredsLeft << "\n";
+ errs() << " # succs left : " << NumSuccsLeft << "\n";
+ errs() << " Latency : " << Latency << "\n";
+ errs() << " Depth : " << Depth << "\n";
+ errs() << " Height : " << Height << "\n";
if (Preds.size() != 0) {
- cerr << " Predecessors:\n";
+ errs() << " Predecessors:\n";
for (SUnit::const_succ_iterator I = Preds.begin(), E = Preds.end();
I != E; ++I) {
- cerr << " ";
+ errs() << " ";
switch (I->getKind()) {
- case SDep::Data: cerr << "val "; break;
- case SDep::Anti: cerr << "anti"; break;
- case SDep::Output: cerr << "out "; break;
- case SDep::Order: cerr << "ch "; break;
+ case SDep::Data: errs() << "val "; break;
+ case SDep::Anti: errs() << "anti"; break;
+ case SDep::Output: errs() << "out "; break;
+ case SDep::Order: errs() << "ch "; break;
}
- cerr << "#";
- cerr << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
+ errs() << "#";
+ errs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
if (I->isArtificial())
- cerr << " *";
- cerr << "\n";
+ errs() << " *";
+ errs() << ": Latency=" << I->getLatency();
+ errs() << "\n";
}
}
if (Succs.size() != 0) {
- cerr << " Successors:\n";
+ errs() << " Successors:\n";
for (SUnit::const_succ_iterator I = Succs.begin(), E = Succs.end();
I != E; ++I) {
- cerr << " ";
+ errs() << " ";
switch (I->getKind()) {
- case SDep::Data: cerr << "val "; break;
- case SDep::Anti: cerr << "anti"; break;
- case SDep::Output: cerr << "out "; break;
- case SDep::Order: cerr << "ch "; break;
+ case SDep::Data: errs() << "val "; break;
+ case SDep::Anti: errs() << "anti"; break;
+ case SDep::Output: errs() << "out "; break;
+ case SDep::Order: errs() << "ch "; break;
}
- cerr << "#";
- cerr << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
+ errs() << "#";
+ errs() << I->getSUnit() << " - SU(" << I->getSUnit()->NodeNum << ")";
if (I->isArtificial())
- cerr << " *";
- cerr << "\n";
+ errs() << " *";
+ errs() << ": Latency=" << I->getLatency();
+ errs() << "\n";
}
}
- cerr << "\n";
+ errs() << "\n";
}
#ifndef NDEBUG
continue;
}
if (!AnyNotSched)
- cerr << "*** Scheduling failed! ***\n";
+ errs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
- cerr << "has not been scheduled!\n";
+ errs() << "has not been scheduled!\n";
AnyNotSched = true;
}
if (SUnits[i].isScheduled &&
- (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getHeight()) >
+ (isBottomUp ? SUnits[i].getHeight() : SUnits[i].getDepth()) >
unsigned(INT_MAX)) {
if (!AnyNotSched)
- cerr << "*** Scheduling failed! ***\n";
+ errs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
- cerr << "has an unexpected "
+ errs() << "has an unexpected "
<< (isBottomUp ? "Height" : "Depth") << " value!\n";
AnyNotSched = true;
}
if (isBottomUp) {
if (SUnits[i].NumSuccsLeft != 0) {
if (!AnyNotSched)
- cerr << "*** Scheduling failed! ***\n";
+ errs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
- cerr << "has successors left!\n";
+ errs() << "has successors left!\n";
AnyNotSched = true;
}
} else {
if (SUnits[i].NumPredsLeft != 0) {
if (!AnyNotSched)
- cerr << "*** Scheduling failed! ***\n";
+ errs() << "*** Scheduling failed! ***\n";
SUnits[i].dump(this);
- cerr << "has predecessors left!\n";
+ errs() << "has predecessors left!\n";
AnyNotSched = true;
}
}
WorkList.reserve(SUnits.size());
WorkList.push_back(SU);
- while (!WorkList.empty()) {
+ do {
SU = WorkList.back();
WorkList.pop_back();
Visited.set(SU->NodeNum);
WorkList.push_back(SU->Succs[I].getSUnit());
}
}
- }
+ } while (!WorkList.empty());
}
/// Shift - Renumber the nodes so that the topological ordering is
ScheduleDAGTopologicalSort::ScheduleDAGTopologicalSort(
std::vector<SUnit> &sunits)
: SUnits(sunits) {}
+
+ScheduleHazardRecognizer::~ScheduleHazardRecognizer() {}