mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-08-24 09:29:42 +00:00
misched: Added ReadyQ container wrapper for Top and Bottom Queues.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@156572 91177308-0d34-0410-b5e6-96231b3b80d8
This commit is contained in:
parent
7f8ab785af
commit
d38f87eeec
@ -629,15 +629,46 @@ void ScheduleDAGMI::placeDebugValues() {
|
||||
//===----------------------------------------------------------------------===//
|
||||
|
||||
namespace {
|
||||
struct ReadyQ {
|
||||
typedef std::vector<SUnit*>::iterator iterator;
|
||||
|
||||
unsigned ID;
|
||||
std::vector<SUnit*> Queue;
|
||||
|
||||
ReadyQ(unsigned id): ID(id) {}
|
||||
|
||||
bool isInQueue(SUnit *SU) const {
|
||||
return SU->NodeQueueId & ID;
|
||||
}
|
||||
|
||||
bool empty() const { return Queue.empty(); }
|
||||
|
||||
iterator find(SUnit *SU) {
|
||||
return std::find(Queue.begin(), Queue.end(), SU);
|
||||
}
|
||||
|
||||
void push(SUnit *SU) {
|
||||
Queue.push_back(SU);
|
||||
}
|
||||
|
||||
void remove(iterator I) {
|
||||
*I = Queue.back();
|
||||
Queue.pop_back();
|
||||
}
|
||||
};
|
||||
|
||||
/// ConvergingScheduler shrinks the unscheduled zone using heuristics to balance
|
||||
/// the schedule.
|
||||
class ConvergingScheduler : public MachineSchedStrategy {
|
||||
ScheduleDAGMI *DAG;
|
||||
|
||||
unsigned NumTopReady;
|
||||
unsigned NumBottomReady;
|
||||
ReadyQ TopQueue;
|
||||
ReadyQ BotQueue;
|
||||
|
||||
public:
|
||||
// NodeQueueId = 0 (none), = 1 (top), = 2 (bottom), = 3 (both)
|
||||
ConvergingScheduler(): TopQueue(1), BotQueue(2) {}
|
||||
|
||||
virtual void initialize(ScheduleDAGMI *dag) {
|
||||
DAG = dag;
|
||||
|
||||
@ -646,13 +677,15 @@ public:
|
||||
}
|
||||
|
||||
virtual SUnit *pickNode(bool &IsTopNode) {
|
||||
if (DAG->top() == DAG->bottom())
|
||||
if (DAG->top() == DAG->bottom()) {
|
||||
assert(TopQueue.empty() && BotQueue.empty() && "ReadyQ garbage");
|
||||
return NULL;
|
||||
|
||||
}
|
||||
// As an initial placeholder heuristic, schedule in the direction that has
|
||||
// the fewest choices.
|
||||
SUnit *SU;
|
||||
if (ForceTopDown || (!ForceBottomUp && NumTopReady <= NumBottomReady)) {
|
||||
if (ForceTopDown
|
||||
|| (!ForceBottomUp && TopQueue.Queue.size() <= BotQueue.Queue.size())) {
|
||||
SU = DAG->getSUnit(DAG->top());
|
||||
IsTopNode = true;
|
||||
}
|
||||
@ -661,21 +694,21 @@ public:
|
||||
IsTopNode = false;
|
||||
}
|
||||
if (SU->isTopReady()) {
|
||||
assert(NumTopReady > 0 && "bad ready count");
|
||||
--NumTopReady;
|
||||
assert(!TopQueue.empty() && "bad ready count");
|
||||
TopQueue.remove(TopQueue.find(SU));
|
||||
}
|
||||
if (SU->isBottomReady()) {
|
||||
assert(NumBottomReady > 0 && "bad ready count");
|
||||
--NumBottomReady;
|
||||
assert(!BotQueue.empty() && "bad ready count");
|
||||
BotQueue.remove(BotQueue.find(SU));
|
||||
}
|
||||
return SU;
|
||||
}
|
||||
|
||||
virtual void releaseTopNode(SUnit *SU) {
|
||||
++NumTopReady;
|
||||
TopQueue.push(SU);
|
||||
}
|
||||
virtual void releaseBottomNode(SUnit *SU) {
|
||||
++NumBottomReady;
|
||||
BotQueue.push(SU);
|
||||
}
|
||||
};
|
||||
} // namespace
|
||||
|
Loading…
Reference in New Issue
Block a user