2006-01-25 09:14:32 +00:00
|
|
|
//===---- ScheduleDAGList.cpp - Implement a list scheduler for isel DAG ---===//
|
2006-01-23 08:26:10 +00:00
|
|
|
//
|
|
|
|
// The LLVM Compiler Infrastructure
|
|
|
|
//
|
2007-12-29 20:36:04 +00:00
|
|
|
// This file is distributed under the University of Illinois Open Source
|
|
|
|
// License. See LICENSE.TXT for details.
|
2006-01-23 08:26:10 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
//
|
2006-05-11 23:55:42 +00:00
|
|
|
// This implements a top-down list scheduler, using standard algorithms.
|
|
|
|
// The basic approach uses a priority queue of available nodes to schedule.
|
|
|
|
// One at a time, nodes are taken from the priority queue (thus in priority
|
|
|
|
// order), checked for legality to schedule, and emitted if legal.
|
2006-03-06 17:58:04 +00:00
|
|
|
//
|
|
|
|
// Nodes may not be legal to schedule either due to structural hazards (e.g.
|
|
|
|
// pipeline or resource constraints) or because an input to the instruction has
|
|
|
|
// not completed execution.
|
2006-01-23 08:26:10 +00:00
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2007-07-13 17:13:54 +00:00
|
|
|
#define DEBUG_TYPE "pre-RA-sched"
|
2009-02-06 17:22:58 +00:00
|
|
|
#include "ScheduleDAGSDNodes.h"
|
2008-11-19 23:18:57 +00:00
|
|
|
#include "llvm/CodeGen/LatencyPriorityQueue.h"
|
2009-01-15 22:18:12 +00:00
|
|
|
#include "llvm/CodeGen/ScheduleHazardRecognizer.h"
|
2006-08-02 12:30:23 +00:00
|
|
|
#include "llvm/CodeGen/SchedulerRegistry.h"
|
2006-08-01 18:29:48 +00:00
|
|
|
#include "llvm/CodeGen/SelectionDAGISel.h"
|
2008-02-10 18:45:23 +00:00
|
|
|
#include "llvm/Target/TargetRegisterInfo.h"
|
2006-05-12 06:33:49 +00:00
|
|
|
#include "llvm/Target/TargetData.h"
|
2006-01-23 08:26:10 +00:00
|
|
|
#include "llvm/Target/TargetInstrInfo.h"
|
2006-01-25 09:14:32 +00:00
|
|
|
#include "llvm/Support/Debug.h"
|
2006-08-27 12:54:02 +00:00
|
|
|
#include "llvm/Support/Compiler.h"
|
2009-07-11 20:10:48 +00:00
|
|
|
#include "llvm/Support/ErrorHandling.h"
|
2008-06-23 23:40:09 +00:00
|
|
|
#include "llvm/ADT/PriorityQueue.h"
|
2006-03-05 23:13:56 +00:00
|
|
|
#include "llvm/ADT/Statistic.h"
|
2006-01-25 09:14:32 +00:00
|
|
|
#include <climits>
|
2006-01-23 08:26:10 +00:00
|
|
|
using namespace llvm;
|
|
|
|
|
2006-12-19 22:41:21 +00:00
|
|
|
STATISTIC(NumNoops , "Number of noops inserted");
|
|
|
|
STATISTIC(NumStalls, "Number of pipeline stalls");
|
2006-03-08 05:18:27 +00:00
|
|
|
|
2006-08-01 14:21:23 +00:00
|
|
|
static RegisterScheduler
|
2008-10-14 20:25:08 +00:00
|
|
|
tdListDAGScheduler("list-td", "Top-down list scheduler",
|
2006-08-01 14:21:23 +00:00
|
|
|
createTDListDAGScheduler);
|
|
|
|
|
2006-03-08 04:37:58 +00:00
|
|
|
namespace {
|
2006-03-09 06:37:29 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
/// ScheduleDAGList - The actual list scheduler implementation. This supports
|
2006-05-11 23:55:42 +00:00
|
|
|
/// top-down scheduling.
|
2006-03-09 06:37:29 +00:00
|
|
|
///
|
2008-11-19 23:18:57 +00:00
|
|
|
class VISIBILITY_HIDDEN ScheduleDAGList : public ScheduleDAGSDNodes {
|
2006-01-23 08:26:10 +00:00
|
|
|
private:
|
2006-03-11 22:44:37 +00:00
|
|
|
/// AvailableQueue - The priority queue to use for the available SUnits.
|
|
|
|
///
|
|
|
|
SchedulingPriorityQueue *AvailableQueue;
|
2006-03-09 06:35:14 +00:00
|
|
|
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
/// PendingQueue - This contains all of the instructions whose operands have
|
|
|
|
/// been issued, but their results are not ready yet (due to the latency of
|
2008-11-18 02:50:01 +00:00
|
|
|
/// the operation). Once the operands become available, the instruction is
|
2008-11-17 19:45:19 +00:00
|
|
|
/// added to the AvailableQueue.
|
|
|
|
std::vector<SUnit*> PendingQueue;
|
2006-05-04 19:16:39 +00:00
|
|
|
|
2006-03-05 22:45:01 +00:00
|
|
|
/// HazardRec - The hazard recognizer to use.
|
2009-01-15 22:18:12 +00:00
|
|
|
ScheduleHazardRecognizer *HazardRec;
|
2006-05-04 19:16:39 +00:00
|
|
|
|
2006-01-23 08:26:10 +00:00
|
|
|
public:
|
2009-01-15 19:20:50 +00:00
|
|
|
ScheduleDAGList(MachineFunction &mf,
|
2006-03-11 22:44:37 +00:00
|
|
|
SchedulingPriorityQueue *availqueue,
|
2009-01-15 22:18:12 +00:00
|
|
|
ScheduleHazardRecognizer *HR)
|
2009-01-15 19:20:50 +00:00
|
|
|
: ScheduleDAGSDNodes(mf),
|
2006-03-11 22:44:37 +00:00
|
|
|
AvailableQueue(availqueue), HazardRec(HR) {
|
2006-03-05 22:45:01 +00:00
|
|
|
}
|
2006-01-25 09:14:32 +00:00
|
|
|
|
|
|
|
~ScheduleDAGList() {
|
2006-03-08 04:25:59 +00:00
|
|
|
delete HazardRec;
|
2006-03-11 22:44:37 +00:00
|
|
|
delete AvailableQueue;
|
2006-01-25 09:14:32 +00:00
|
|
|
}
|
2006-01-23 08:26:10 +00:00
|
|
|
|
|
|
|
void Schedule();
|
2006-01-25 09:14:32 +00:00
|
|
|
|
|
|
|
private:
|
2008-12-09 22:54:47 +00:00
|
|
|
void ReleaseSucc(SUnit *SU, const SDep &D);
|
2009-02-10 23:27:53 +00:00
|
|
|
void ReleaseSuccessors(SUnit *SU);
|
2006-03-11 22:34:41 +00:00
|
|
|
void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
|
2006-03-09 06:48:37 +00:00
|
|
|
void ListScheduleTopDown();
|
2006-01-23 08:26:10 +00:00
|
|
|
};
|
2006-03-08 04:37:58 +00:00
|
|
|
} // end anonymous namespace
|
2006-01-25 09:14:32 +00:00
|
|
|
|
2006-03-11 22:28:35 +00:00
|
|
|
/// Schedule - Schedule the DAG using list scheduling.
|
|
|
|
void ScheduleDAGList::Schedule() {
|
2006-12-07 20:04:42 +00:00
|
|
|
DOUT << "********** List Scheduling **********\n";
|
2006-03-11 22:28:35 +00:00
|
|
|
|
2008-12-23 18:36:58 +00:00
|
|
|
// Build the scheduling graph.
|
|
|
|
BuildSchedGraph();
|
2006-05-09 07:13:34 +00:00
|
|
|
|
2008-06-21 19:18:17 +00:00
|
|
|
AvailableQueue->initNodes(SUnits);
|
2006-03-11 22:28:35 +00:00
|
|
|
|
2006-05-11 23:55:42 +00:00
|
|
|
ListScheduleTopDown();
|
2006-03-11 22:28:35 +00:00
|
|
|
|
2006-03-11 22:44:37 +00:00
|
|
|
AvailableQueue->releaseState();
|
2006-03-11 22:28:35 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Top-Down Scheduling
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
|
|
|
/// ReleaseSucc - Decrement the NumPredsLeft count of a successor. Add it to
|
2008-11-18 00:38:59 +00:00
|
|
|
/// the PendingQueue if the count reaches zero. Also update its cycle bound.
|
2008-12-09 22:54:47 +00:00
|
|
|
void ScheduleDAGList::ReleaseSucc(SUnit *SU, const SDep &D) {
|
|
|
|
SUnit *SuccSU = D.getSUnit();
|
2008-11-18 00:38:59 +00:00
|
|
|
--SuccSU->NumPredsLeft;
|
2006-03-11 22:28:35 +00:00
|
|
|
|
2008-11-18 00:38:59 +00:00
|
|
|
#ifndef NDEBUG
|
|
|
|
if (SuccSU->NumPredsLeft < 0) {
|
|
|
|
cerr << "*** Scheduling failed! ***\n";
|
2008-11-18 02:06:40 +00:00
|
|
|
SuccSU->dump(this);
|
2008-11-18 00:38:59 +00:00
|
|
|
cerr << " has been released too many times!\n";
|
2009-07-11 20:10:48 +00:00
|
|
|
llvm_unreachable();
|
2008-11-18 00:38:59 +00:00
|
|
|
}
|
|
|
|
#endif
|
|
|
|
|
2008-12-16 03:25:46 +00:00
|
|
|
SuccSU->setDepthToAtLeast(SU->getDepth() + D.getLatency());
|
2006-03-11 22:28:35 +00:00
|
|
|
|
2009-02-10 23:27:53 +00:00
|
|
|
// If all the node's predecessors are scheduled, this node is ready
|
|
|
|
// to be scheduled. Ignore the special ExitSU node.
|
|
|
|
if (SuccSU->NumPredsLeft == 0 && SuccSU != &ExitSU)
|
2008-11-17 19:45:19 +00:00
|
|
|
PendingQueue.push_back(SuccSU);
|
2009-02-10 23:27:53 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
void ScheduleDAGList::ReleaseSuccessors(SUnit *SU) {
|
|
|
|
// Top down: release successors.
|
|
|
|
for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
|
|
|
|
I != E; ++I) {
|
|
|
|
assert(!I->isAssignedRegDep() &&
|
|
|
|
"The list-td scheduler doesn't yet support physreg dependencies!");
|
|
|
|
|
|
|
|
ReleaseSucc(SU, *I);
|
2006-03-11 22:28:35 +00:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// ScheduleNodeTopDown - Add the node to the schedule. Decrement the pending
|
|
|
|
/// count of its successors. If a successor pending count is zero, add it to
|
|
|
|
/// the Available queue.
|
2006-03-11 22:44:37 +00:00
|
|
|
void ScheduleDAGList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
|
2006-12-07 20:04:42 +00:00
|
|
|
DOUT << "*** Scheduling [" << CurCycle << "]: ";
|
2008-11-18 02:06:40 +00:00
|
|
|
DEBUG(SU->dump(this));
|
2006-03-11 22:28:35 +00:00
|
|
|
|
|
|
|
Sequence.push_back(SU);
|
2008-12-16 03:25:46 +00:00
|
|
|
assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");
|
|
|
|
SU->setDepthToAtLeast(CurCycle);
|
2008-11-17 21:31:02 +00:00
|
|
|
|
2009-02-10 23:27:53 +00:00
|
|
|
ReleaseSuccessors(SU);
|
2008-11-17 21:31:02 +00:00
|
|
|
SU->isScheduled = true;
|
|
|
|
AvailableQueue->ScheduledNode(SU);
|
2006-03-11 22:28:35 +00:00
|
|
|
}
|
|
|
|
|
2006-03-05 21:10:33 +00:00
|
|
|
/// ListScheduleTopDown - The main loop of list scheduling for top-down
|
|
|
|
/// schedulers.
|
2006-03-09 06:48:37 +00:00
|
|
|
void ScheduleDAGList::ListScheduleTopDown() {
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
unsigned CurCycle = 0;
|
|
|
|
|
2009-02-10 23:27:53 +00:00
|
|
|
// Release any successors of the special Entry node.
|
|
|
|
ReleaseSuccessors(&EntrySU);
|
|
|
|
|
2006-03-05 21:10:33 +00:00
|
|
|
// All leaves to Available queue.
|
2006-03-08 04:54:34 +00:00
|
|
|
for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
|
2006-03-05 21:10:33 +00:00
|
|
|
// It is available if it has no predecessors.
|
2008-04-15 01:22:18 +00:00
|
|
|
if (SUnits[i].Preds.empty()) {
|
2006-03-11 22:44:37 +00:00
|
|
|
AvailableQueue->push(&SUnits[i]);
|
2008-11-17 16:37:30 +00:00
|
|
|
SUnits[i].isAvailable = true;
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
}
|
2006-03-05 21:10:33 +00:00
|
|
|
}
|
|
|
|
|
|
|
|
// While Available queue is not empty, grab the node with the highest
|
|
|
|
// priority. If it is not ready put it back. Schedule the node.
|
|
|
|
std::vector<SUnit*> NotReady;
|
2008-06-21 15:52:51 +00:00
|
|
|
Sequence.reserve(SUnits.size());
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
while (!AvailableQueue->empty() || !PendingQueue.empty()) {
|
|
|
|
// Check to see if any of the pending instructions are ready to issue. If
|
|
|
|
// so, add them to the available queue.
|
2006-03-12 09:01:41 +00:00
|
|
|
for (unsigned i = 0, e = PendingQueue.size(); i != e; ++i) {
|
2008-12-16 03:25:46 +00:00
|
|
|
if (PendingQueue[i]->getDepth() == CurCycle) {
|
2008-11-17 19:45:19 +00:00
|
|
|
AvailableQueue->push(PendingQueue[i]);
|
|
|
|
PendingQueue[i]->isAvailable = true;
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
PendingQueue[i] = PendingQueue.back();
|
|
|
|
PendingQueue.pop_back();
|
|
|
|
--i; --e;
|
|
|
|
} else {
|
2008-12-16 03:25:46 +00:00
|
|
|
assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?");
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
}
|
2006-03-12 09:01:41 +00:00
|
|
|
}
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
|
2006-03-12 09:01:41 +00:00
|
|
|
// If there are no instructions available, don't try to issue anything, and
|
|
|
|
// don't advance the hazard recognizer.
|
|
|
|
if (AvailableQueue->empty()) {
|
|
|
|
++CurCycle;
|
|
|
|
continue;
|
|
|
|
}
|
2006-01-25 09:14:32 +00:00
|
|
|
|
2006-03-12 09:01:41 +00:00
|
|
|
SUnit *FoundSUnit = 0;
|
|
|
|
|
2006-03-05 22:45:01 +00:00
|
|
|
bool HasNoopHazards = false;
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
while (!AvailableQueue->empty()) {
|
2006-03-12 09:01:41 +00:00
|
|
|
SUnit *CurSUnit = AvailableQueue->pop();
|
2006-03-07 05:40:43 +00:00
|
|
|
|
2009-01-15 22:18:12 +00:00
|
|
|
ScheduleHazardRecognizer::HazardType HT =
|
|
|
|
HazardRec->getHazardType(CurSUnit);
|
|
|
|
if (HT == ScheduleHazardRecognizer::NoHazard) {
|
2006-03-12 09:01:41 +00:00
|
|
|
FoundSUnit = CurSUnit;
|
2006-03-05 22:45:01 +00:00
|
|
|
break;
|
|
|
|
}
|
2008-11-19 23:18:57 +00:00
|
|
|
|
2006-03-05 22:45:01 +00:00
|
|
|
// Remember if this is a noop hazard.
|
2009-01-15 22:18:12 +00:00
|
|
|
HasNoopHazards |= HT == ScheduleHazardRecognizer::NoopHazard;
|
2006-03-05 22:45:01 +00:00
|
|
|
|
2006-03-12 09:01:41 +00:00
|
|
|
NotReady.push_back(CurSUnit);
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
}
|
2006-03-05 22:45:01 +00:00
|
|
|
|
2006-03-05 21:10:33 +00:00
|
|
|
// Add the nodes that aren't ready back onto the available list.
|
2006-03-12 09:01:41 +00:00
|
|
|
if (!NotReady.empty()) {
|
|
|
|
AvailableQueue->push_all(NotReady);
|
|
|
|
NotReady.clear();
|
|
|
|
}
|
2006-03-05 22:45:01 +00:00
|
|
|
|
|
|
|
// If we found a node to schedule, do it now.
|
2006-03-12 09:01:41 +00:00
|
|
|
if (FoundSUnit) {
|
|
|
|
ScheduleNodeTopDown(FoundSUnit, CurCycle);
|
2009-01-15 22:18:12 +00:00
|
|
|
HazardRec->EmitInstruction(FoundSUnit);
|
As a pending queue data structure to keep track of instructions whose
operands have all issued, but whose results are not yet available. This
allows us to compile:
int G;
int test(int A, int B, int* P) {
return (G+A)*(B+1);
}
to:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
addi r4, r4, 1
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
instead of this, which has a stall between the lis/lwz:
_test:
lis r2, ha16(L_G$non_lazy_ptr)
lwz r2, lo16(L_G$non_lazy_ptr)(r2)
addi r4, r4, 1
lwz r2, 0(r2)
add r2, r2, r3
mullw r3, r2, r4
blr
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@26716 91177308-0d34-0410-b5e6-96231b3b80d8
2006-03-12 00:38:57 +00:00
|
|
|
|
|
|
|
// If this is a pseudo-op node, we don't want to increment the current
|
|
|
|
// cycle.
|
2006-03-12 09:01:41 +00:00
|
|
|
if (FoundSUnit->Latency) // Don't increment CurCycle for pseudo-ops!
|
|
|
|
++CurCycle;
|
2006-03-05 22:45:01 +00:00
|
|
|
} else if (!HasNoopHazards) {
|
|
|
|
// Otherwise, we have a pipeline stall, but no other problem, just advance
|
|
|
|
// the current cycle and try again.
|
2006-12-07 20:04:42 +00:00
|
|
|
DOUT << "*** Advancing cycle, no work to do\n";
|
2006-03-08 04:25:59 +00:00
|
|
|
HazardRec->AdvanceCycle();
|
2006-03-05 23:13:56 +00:00
|
|
|
++NumStalls;
|
2006-03-12 09:01:41 +00:00
|
|
|
++CurCycle;
|
2006-03-05 22:45:01 +00:00
|
|
|
} else {
|
|
|
|
// 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
|
|
|
|
// processors without pipeline interlocks and other cases.
|
2006-12-07 20:04:42 +00:00
|
|
|
DOUT << "*** Emitting noop\n";
|
2006-03-08 04:25:59 +00:00
|
|
|
HazardRec->EmitNoop();
|
2009-01-16 01:33:36 +00:00
|
|
|
Sequence.push_back(0); // NULL here means noop
|
2006-03-05 23:13:56 +00:00
|
|
|
++NumNoops;
|
2006-03-12 09:01:41 +00:00
|
|
|
++CurCycle;
|
2006-03-05 22:45:01 +00:00
|
|
|
}
|
2006-03-05 21:10:33 +00:00
|
|
|
}
|
2006-01-23 08:26:10 +00:00
|
|
|
|
2006-03-05 21:10:33 +00:00
|
|
|
#ifndef NDEBUG
|
2008-11-20 01:26:25 +00:00
|
|
|
VerifySchedule(/*isBottomUp=*/false);
|
2006-03-05 21:10:33 +00:00
|
|
|
#endif
|
2006-01-25 09:14:32 +00:00
|
|
|
}
|
|
|
|
|
2006-03-09 06:35:14 +00:00
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
// Public Constructor Functions
|
|
|
|
//===----------------------------------------------------------------------===//
|
|
|
|
|
2006-08-01 14:21:23 +00:00
|
|
|
/// createTDListDAGScheduler - This creates a top-down list scheduler with a
|
|
|
|
/// new hazard recognizer. This scheduler takes ownership of the hazard
|
|
|
|
/// recognizer and deletes it when done.
|
2009-02-11 04:27:20 +00:00
|
|
|
ScheduleDAGSDNodes *
|
2009-04-29 23:29:43 +00:00
|
|
|
llvm::createTDListDAGScheduler(SelectionDAGISel *IS, CodeGenOpt::Level) {
|
2009-01-15 19:20:50 +00:00
|
|
|
return new ScheduleDAGList(*IS->MF,
|
2006-03-09 07:38:27 +00:00
|
|
|
new LatencyPriorityQueue(),
|
2006-08-01 18:29:48 +00:00
|
|
|
IS->CreateTargetHazardRecognizer());
|
2006-01-23 08:26:10 +00:00
|
|
|
}
|