6502/llvm-6502
1
0
Fork 0
mirror of https://github.com/c64scene-ar/llvm-6502.git synced 2025-02-10 04:33:40 +00:00
Code Issues Projects Releases Wiki Activity

Minor cleanups to reduce some spurious differences between different

Browse Source 
scheduler implementations.


git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@41191 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
Dan Gohman 2007-08-20 19:28:38 +00:00
parent ef1af7d6d5
commit 8d1bfad00b
1 changed files with 11 additions and 9 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

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

@ -45,7 +45,6 @@ namespace {
/// ScheduleDAGRRList - The actual register reduction list scheduler /// ScheduleDAGRRList - The actual register reduction list scheduler
/// implementation. This supports both top-down and bottom-up scheduling. /// implementation. This supports both top-down and bottom-up scheduling.
/// ///
class VISIBILITY_HIDDEN ScheduleDAGRRList : public ScheduleDAG { class VISIBILITY_HIDDEN ScheduleDAGRRList : public ScheduleDAG {
private: private:
/// isBottomUp - This is true if the scheduling problem is bottom-up, false if /// isBottomUp - This is true if the scheduling problem is bottom-up, false if
@ -95,7 +94,7 @@ void ScheduleDAGRRList::Schedule() {
CalculateHeights(); CalculateHeights();
AvailableQueue->initNodes(SUnitMap, SUnits); AvailableQueue->initNodes(SUnitMap, SUnits);
// Execute the actual scheduling loop Top-Down or Bottom-Up as appropriate. // Execute the actual scheduling loop Top-Down or Bottom-Up as appropriate.
if (isBottomUp) if (isBottomUp)
ListScheduleBottomUp(); ListScheduleBottomUp();
@ -103,7 +102,7 @@ void ScheduleDAGRRList::Schedule() {
ListScheduleTopDown(); ListScheduleTopDown();
AvailableQueue->releaseState(); AvailableQueue->releaseState();
CommuteNodesToReducePressure(); CommuteNodesToReducePressure();
DOUT << "*** Final schedule ***\n"; DOUT << "*** Final schedule ***\n";
@ -169,7 +168,7 @@ void ScheduleDAGRRList::CommuteNodesToReducePressure() {
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
/// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to
/// the Available queue is the count reaches zero. Also update its cycle bound. /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
void ScheduleDAGRRList::ReleasePred(SUnit *PredSU, bool isChain, void ScheduleDAGRRList::ReleasePred(SUnit *PredSU, bool isChain,
unsigned CurCycle) { unsigned CurCycle) {
// FIXME: the distance between two nodes is not always == the predecessor's // FIXME: the distance between two nodes is not always == the predecessor's
@ -233,7 +232,7 @@ void ScheduleDAGRRList::ListScheduleBottomUp() {
AvailableQueue->push(SUnitMap[DAG.getRoot().Val]); AvailableQueue->push(SUnitMap[DAG.getRoot().Val]);
// While Available queue is not empty, grab the node with the highest // While Available queue is not empty, grab the node with the highest
// priority. If it is not ready put it back. Schedule the node. // priority. If it is not ready put it back. Schedule the node.
std::vector<SUnit*> NotReady; std::vector<SUnit*> NotReady;
while (!AvailableQueue->empty()) { while (!AvailableQueue->empty()) {
SUnit *CurNode = AvailableQueue->pop(); SUnit *CurNode = AvailableQueue->pop();
@ -282,7 +281,7 @@ void ScheduleDAGRRList::ListScheduleBottomUp() {
//===----------------------------------------------------------------------===// //===----------------------------------------------------------------------===//
/// ReleaseSucc - Decrement the NumPredsLeft count of a successor. Add it to /// ReleaseSucc - Decrement the NumPredsLeft count of a successor. Add it to
/// the PendingQueue if the count reaches zero. /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
void ScheduleDAGRRList::ReleaseSucc(SUnit *SuccSU, bool isChain, void ScheduleDAGRRList::ReleaseSucc(SUnit *SuccSU, bool isChain,
unsigned CurCycle) { unsigned CurCycle) {
// FIXME: the distance between two nodes is not always == the predecessor's // FIXME: the distance between two nodes is not always == the predecessor's
@ -330,6 +329,8 @@ void ScheduleDAGRRList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
SU->isScheduled = true; SU->isScheduled = true;
} }
/// ListScheduleTopDown - The main loop of list scheduling for top-down
/// schedulers.
void ScheduleDAGRRList::ListScheduleTopDown() { void ScheduleDAGRRList::ListScheduleTopDown() {
unsigned CurCycle = 0; unsigned CurCycle = 0;
SUnit *Entry = SUnitMap[DAG.getEntryNode().Val]; SUnit *Entry = SUnitMap[DAG.getEntryNode().Val];
@ -348,7 +349,7 @@ void ScheduleDAGRRList::ListScheduleTopDown() {
CurCycle++; CurCycle++;
// While Available queue is not empty, grab the node with the highest // While Available queue is not empty, grab the node with the highest
// priority. If it is not ready put it back. Schedule the node. // priority. If it is not ready put it back. Schedule the node.
std::vector<SUnit*> NotReady; std::vector<SUnit*> NotReady;
while (!AvailableQueue->empty()) { while (!AvailableQueue->empty()) {
SUnit *CurNode = AvailableQueue->pop(); SUnit *CurNode = AvailableQueue->pop();
@ -474,7 +475,7 @@ namespace {
const TargetInstrInfo *TII; const TargetInstrInfo *TII;
public: public:
BURegReductionPriorityQueue(const TargetInstrInfo *tii) explicit BURegReductionPriorityQueue(const TargetInstrInfo *tii)
: TII(tii) {} : TII(tii) {}
void initNodes(DenseMap<SDNode*, SUnit*> &sumap, void initNodes(DenseMap<SDNode*, SUnit*> &sumap,
@ -539,7 +540,8 @@ namespace {
template<class SF> template<class SF>
class TDRegReductionPriorityQueue : public RegReductionPriorityQueue<SF> { class VISIBILITY_HIDDEN TDRegReductionPriorityQueue
: public RegReductionPriorityQueue<SF> {
// SUnitMap SDNode to SUnit mapping (n -> 1). // SUnitMap SDNode to SUnit mapping (n -> 1).
DenseMap<SDNode*, SUnit*> *SUnitMap; DenseMap<SDNode*, SUnit*> *SUnitMap;