1 //===- MachineScheduler.cpp - Machine Instruction Scheduler ---------------===//
3 // The LLVM Compiler Infrastructure
5 // This file is distributed under the University of Illinois Open Source
6 // License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // MachineScheduler schedules machine instructions after phi elimination. It
11 // preserves LiveIntervals so it can be invoked before register allocation.
13 //===----------------------------------------------------------------------===//
15 #define DEBUG_TYPE "misched"
17 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
18 #include "llvm/CodeGen/MachineScheduler.h"
19 #include "llvm/CodeGen/Passes.h"
20 #include "llvm/CodeGen/ScheduleDAGInstrs.h"
21 #include "llvm/Analysis/AliasAnalysis.h"
22 #include "llvm/Target/TargetInstrInfo.h"
23 #include "llvm/Support/CommandLine.h"
24 #include "llvm/Support/Debug.h"
25 #include "llvm/Support/ErrorHandling.h"
26 #include "llvm/Support/raw_ostream.h"
27 #include "llvm/ADT/OwningPtr.h"
34 static cl::opt<bool> ViewMISchedDAGs("view-misched-dags", cl::Hidden,
35 cl::desc("Pop up a window to show MISched dags after they are processed"));
37 static bool ViewMISchedDAGs = false;
40 //===----------------------------------------------------------------------===//
41 // Machine Instruction Scheduling Pass and Registry
42 //===----------------------------------------------------------------------===//
45 /// MachineScheduler runs after coalescing and before register allocation.
46 class MachineScheduler : public MachineSchedContext,
47 public MachineFunctionPass {
51 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
53 virtual void releaseMemory() {}
55 virtual bool runOnMachineFunction(MachineFunction&);
57 virtual void print(raw_ostream &O, const Module* = 0) const;
59 static char ID; // Class identification, replacement for typeinfo
63 char MachineScheduler::ID = 0;
65 char &llvm::MachineSchedulerID = MachineScheduler::ID;
67 INITIALIZE_PASS_BEGIN(MachineScheduler, "misched",
68 "Machine Instruction Scheduler", false, false)
69 INITIALIZE_AG_DEPENDENCY(AliasAnalysis)
70 INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
71 INITIALIZE_PASS_DEPENDENCY(LiveIntervals)
72 INITIALIZE_PASS_END(MachineScheduler, "misched",
73 "Machine Instruction Scheduler", false, false)
75 MachineScheduler::MachineScheduler()
76 : MachineFunctionPass(ID) {
77 initializeMachineSchedulerPass(*PassRegistry::getPassRegistry());
80 void MachineScheduler::getAnalysisUsage(AnalysisUsage &AU) const {
82 AU.addRequiredID(MachineDominatorsID);
83 AU.addRequired<MachineLoopInfo>();
84 AU.addRequired<AliasAnalysis>();
85 AU.addRequired<TargetPassConfig>();
86 AU.addRequired<SlotIndexes>();
87 AU.addPreserved<SlotIndexes>();
88 AU.addRequired<LiveIntervals>();
89 AU.addPreserved<LiveIntervals>();
90 MachineFunctionPass::getAnalysisUsage(AU);
93 MachinePassRegistry MachineSchedRegistry::Registry;
95 /// A dummy default scheduler factory indicates whether the scheduler
96 /// is overridden on the command line.
97 static ScheduleDAGInstrs *useDefaultMachineSched(MachineSchedContext *C) {
101 /// MachineSchedOpt allows command line selection of the scheduler.
102 static cl::opt<MachineSchedRegistry::ScheduleDAGCtor, false,
103 RegisterPassParser<MachineSchedRegistry> >
104 MachineSchedOpt("misched",
105 cl::init(&useDefaultMachineSched), cl::Hidden,
106 cl::desc("Machine instruction scheduler to use"));
108 static MachineSchedRegistry
109 SchedDefaultRegistry("default", "Use the target's default scheduler choice.",
110 useDefaultMachineSched);
112 /// Forward declare the common machine scheduler. This will be used as the
113 /// default scheduler if the target does not set a default.
114 static ScheduleDAGInstrs *createCommonMachineSched(MachineSchedContext *C);
116 bool MachineScheduler::runOnMachineFunction(MachineFunction &mf) {
117 // Initialize the context of the pass.
119 MLI = &getAnalysis<MachineLoopInfo>();
120 MDT = &getAnalysis<MachineDominatorTree>();
121 PassConfig = &getAnalysis<TargetPassConfig>();
122 AA = &getAnalysis<AliasAnalysis>();
124 LIS = &getAnalysis<LiveIntervals>();
125 const TargetInstrInfo *TII = MF->getTarget().getInstrInfo();
127 // Select the scheduler, or set the default.
128 MachineSchedRegistry::ScheduleDAGCtor Ctor = MachineSchedOpt;
129 if (Ctor == useDefaultMachineSched) {
130 // Get the default scheduler set by the target.
131 Ctor = MachineSchedRegistry::getDefault();
133 Ctor = createCommonMachineSched;
134 MachineSchedRegistry::setDefault(Ctor);
137 // Instantiate the selected scheduler.
138 OwningPtr<ScheduleDAGInstrs> Scheduler(Ctor(this));
140 // Visit all machine basic blocks.
141 for (MachineFunction::iterator MBB = MF->begin(), MBBEnd = MF->end();
142 MBB != MBBEnd; ++MBB) {
144 // Break the block into scheduling regions [I, RegionEnd), and schedule each
145 // region as soon as it is discovered.
146 unsigned RemainingCount = MBB->size();
147 for(MachineBasicBlock::iterator RegionEnd = MBB->end(),
148 RegionStart = MBB->begin(); RegionEnd != RegionStart;) {
149 Scheduler->startBlock(MBB);
150 // The next region starts above the previous region. Look backward in the
151 // instruction stream until we find the nearest boundary.
152 MachineBasicBlock::iterator I = RegionEnd;
153 for(;I != RegionStart; --I, --RemainingCount) {
154 if (TII->isSchedulingBoundary(llvm::prior(I), MBB, *MF))
157 // Notify the scheduler of the region, even if we may skip scheduling
158 // it. Perhaps it still needs to be bundled.
159 Scheduler->enterRegion(MBB, I, RegionEnd, RemainingCount);
161 // Skip empty scheduling regions (0 or 1 schedulable instructions).
162 if (I == RegionEnd || I == llvm::prior(RegionEnd)) {
163 RegionEnd = llvm::prior(RegionEnd);
166 // Close the current region. Bundle the terminator if needed.
167 Scheduler->exitRegion();
170 DEBUG(dbgs() << "MachineScheduling " << MF->getFunction()->getName()
171 << ":BB#" << MBB->getNumber() << "\n From: " << *I << " To: ";
172 if (RegionEnd != MBB->end()) dbgs() << *RegionEnd;
173 else dbgs() << "End";
174 dbgs() << " Remaining: " << RemainingCount << "\n");
176 // Inform ScheduleDAGInstrs of the region being scheduled. It calls back
177 // to our schedule() method.
178 Scheduler->schedule();
179 Scheduler->exitRegion();
181 // Scheduling has invalidated the current iterator 'I'. Ask the
182 // scheduler for the top of it's scheduled region.
183 RegionEnd = Scheduler->begin();
185 assert(RemainingCount == 0 && "Instruction count mismatch!");
186 Scheduler->finishBlock();
191 void MachineScheduler::print(raw_ostream &O, const Module* m) const {
195 //===----------------------------------------------------------------------===//
196 // ScheduleTopeDownLive - Base class for basic top-down scheduling with
197 // LiveIntervals preservation.
198 // ===----------------------------------------------------------------------===//
201 /// ScheduleTopDownLive is an implementation of ScheduleDAGInstrs that schedules
202 /// machine instructions while updating LiveIntervals.
203 class ScheduleTopDownLive : public ScheduleDAGInstrs {
206 ScheduleTopDownLive(MachineSchedContext *C):
207 ScheduleDAGInstrs(*C->MF, *C->MLI, *C->MDT, /*IsPostRA=*/false, C->LIS),
210 /// ScheduleDAGInstrs interface.
213 /// Interface implemented by the selected top-down liveinterval scheduler.
215 /// Pick the next node to schedule, or return NULL.
216 virtual SUnit *pickNode() = 0;
218 /// When all preceeding dependencies have been resolved, free this node for
220 virtual void releaseNode(SUnit *SU) = 0;
223 void releaseSucc(SUnit *SU, SDep *SuccEdge);
224 void releaseSuccessors(SUnit *SU);
228 /// ReleaseSucc - Decrement the NumPredsLeft count of a successor. When
229 /// NumPredsLeft reaches zero, release the successor node.
230 void ScheduleTopDownLive::releaseSucc(SUnit *SU, SDep *SuccEdge) {
231 SUnit *SuccSU = SuccEdge->getSUnit();
234 if (SuccSU->NumPredsLeft == 0) {
235 dbgs() << "*** Scheduling failed! ***\n";
237 dbgs() << " has been released too many times!\n";
241 --SuccSU->NumPredsLeft;
242 if (SuccSU->NumPredsLeft == 0 && SuccSU != &ExitSU)
246 /// releaseSuccessors - Call releaseSucc on each of SU's successors.
247 void ScheduleTopDownLive::releaseSuccessors(SUnit *SU) {
248 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
250 releaseSucc(SU, &*I);
254 /// schedule - This is called back from ScheduleDAGInstrs::Run() when it's
255 /// time to do some work.
256 void ScheduleTopDownLive::schedule() {
259 DEBUG(dbgs() << "********** MI Scheduling **********\n");
260 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
261 SUnits[su].dumpAll(this));
263 if (ViewMISchedDAGs) viewGraph();
265 // Release any successors of the special Entry node. It is currently unused,
266 // but we keep up appearances.
267 releaseSuccessors(&EntrySU);
269 // Release all DAG roots for scheduling.
270 for (std::vector<SUnit>::iterator I = SUnits.begin(), E = SUnits.end();
272 // A SUnit is ready to schedule if it has no predecessors.
273 if (I->Preds.empty())
277 MachineBasicBlock::iterator InsertPos = Begin;
278 while (SUnit *SU = pickNode()) {
279 DEBUG(dbgs() << "*** Scheduling Instruction:\n"; SU->dump(this));
281 // Move the instruction to its new location in the instruction stream.
282 MachineInstr *MI = SU->getInstr();
283 if (&*InsertPos == MI)
286 BB->splice(InsertPos, BB, MI);
288 if (Begin == InsertPos)
292 // Release dependent instructions for scheduling.
293 releaseSuccessors(SU);
297 //===----------------------------------------------------------------------===//
298 // Placeholder for the default machine instruction scheduler.
299 //===----------------------------------------------------------------------===//
302 class CommonMachineScheduler : public ScheduleDAGInstrs {
305 CommonMachineScheduler(MachineSchedContext *C):
306 ScheduleDAGInstrs(*C->MF, *C->MLI, *C->MDT, /*IsPostRA=*/false, C->LIS),
309 /// schedule - This is called back from ScheduleDAGInstrs::Run() when it's
310 /// time to do some work.
315 /// The common machine scheduler will be used as the default scheduler if the
316 /// target does not set a default.
317 static ScheduleDAGInstrs *createCommonMachineSched(MachineSchedContext *C) {
318 return new CommonMachineScheduler(C);
320 static MachineSchedRegistry
321 SchedCommonRegistry("common", "Use the target's default scheduler choice.",
322 createCommonMachineSched);
324 /// Schedule - This is called back from ScheduleDAGInstrs::Run() when it's
325 /// time to do some work.
326 void CommonMachineScheduler::schedule() {
329 DEBUG(dbgs() << "********** MI Scheduling **********\n");
330 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
331 SUnits[su].dumpAll(this));
333 // TODO: Put interesting things here.
335 // When this is fully implemented, it will become a subclass of
336 // ScheduleTopDownLive. So this driver will disappear.
339 //===----------------------------------------------------------------------===//
340 // Machine Instruction Shuffler for Correctness Testing
341 //===----------------------------------------------------------------------===//
345 // Nodes with a higher number have higher priority. This way we attempt to
346 // schedule the latest instructions earliest.
348 // TODO: Relies on the property of the BuildSchedGraph that results in SUnits
349 // being ordered in sequence top-down.
350 struct ShuffleSUnitOrder {
351 bool operator()(SUnit *A, SUnit *B) const {
352 return A->NodeNum < B->NodeNum;
356 /// Reorder instructions as much as possible.
357 class InstructionShuffler : public ScheduleTopDownLive {
358 std::priority_queue<SUnit*, std::vector<SUnit*>, ShuffleSUnitOrder> Queue;
360 InstructionShuffler(MachineSchedContext *C):
361 ScheduleTopDownLive(C) {}
363 /// ScheduleTopDownLive Interface
365 virtual SUnit *pickNode() {
366 if (Queue.empty()) return NULL;
367 SUnit *SU = Queue.top();
372 virtual void releaseNode(SUnit *SU) {
378 static ScheduleDAGInstrs *createInstructionShuffler(MachineSchedContext *C) {
379 return new InstructionShuffler(C);
381 static MachineSchedRegistry ShufflerRegistry("shuffle",
382 "Shuffle machine instructions",
383 createInstructionShuffler);