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/MachineScheduler.h"
18 #include "llvm/ADT/OwningPtr.h"
19 #include "llvm/ADT/PriorityQueue.h"
20 #include "llvm/Analysis/AliasAnalysis.h"
21 #include "llvm/CodeGen/LiveIntervalAnalysis.h"
22 #include "llvm/CodeGen/MachineDominators.h"
23 #include "llvm/CodeGen/MachineLoopInfo.h"
24 #include "llvm/CodeGen/MachineRegisterInfo.h"
25 #include "llvm/CodeGen/Passes.h"
26 #include "llvm/CodeGen/RegisterClassInfo.h"
27 #include "llvm/CodeGen/ScheduleDFS.h"
28 #include "llvm/CodeGen/ScheduleHazardRecognizer.h"
29 #include "llvm/Support/CommandLine.h"
30 #include "llvm/Support/Debug.h"
31 #include "llvm/Support/ErrorHandling.h"
32 #include "llvm/Support/GraphWriter.h"
33 #include "llvm/Support/raw_ostream.h"
34 #include "llvm/Target/TargetInstrInfo.h"
40 cl::opt<bool> ForceTopDown("misched-topdown", cl::Hidden,
41 cl::desc("Force top-down list scheduling"));
42 cl::opt<bool> ForceBottomUp("misched-bottomup", cl::Hidden,
43 cl::desc("Force bottom-up list scheduling"));
47 static cl::opt<bool> ViewMISchedDAGs("view-misched-dags", cl::Hidden,
48 cl::desc("Pop up a window to show MISched dags after they are processed"));
50 static cl::opt<unsigned> MISchedCutoff("misched-cutoff", cl::Hidden,
51 cl::desc("Stop scheduling after N instructions"), cl::init(~0U));
53 static bool ViewMISchedDAGs = false;
56 static cl::opt<bool> EnableLoadCluster("misched-cluster", cl::Hidden,
57 cl::desc("Enable load clustering."), cl::init(true));
59 // Experimental heuristics
60 static cl::opt<bool> EnableMacroFusion("misched-fusion", cl::Hidden,
61 cl::desc("Enable scheduling for macro fusion."), cl::init(true));
63 static cl::opt<bool> VerifyScheduling("verify-misched", cl::Hidden,
64 cl::desc("Verify machine instrs before and after machine scheduling"));
66 // DAG subtrees must have at least this many nodes.
67 static const unsigned MinSubtreeSize = 8;
69 //===----------------------------------------------------------------------===//
70 // Machine Instruction Scheduling Pass and Registry
71 //===----------------------------------------------------------------------===//
73 MachineSchedContext::MachineSchedContext():
74 MF(0), MLI(0), MDT(0), PassConfig(0), AA(0), LIS(0) {
75 RegClassInfo = new RegisterClassInfo();
78 MachineSchedContext::~MachineSchedContext() {
83 /// MachineScheduler runs after coalescing and before register allocation.
84 class MachineScheduler : public MachineSchedContext,
85 public MachineFunctionPass {
89 virtual void getAnalysisUsage(AnalysisUsage &AU) const;
91 virtual void releaseMemory() {}
93 virtual bool runOnMachineFunction(MachineFunction&);
95 virtual void print(raw_ostream &O, const Module* = 0) const;
97 static char ID; // Class identification, replacement for typeinfo
101 char MachineScheduler::ID = 0;
103 char &llvm::MachineSchedulerID = MachineScheduler::ID;
105 INITIALIZE_PASS_BEGIN(MachineScheduler, "misched",
106 "Machine Instruction Scheduler", false, false)
107 INITIALIZE_AG_DEPENDENCY(AliasAnalysis)
108 INITIALIZE_PASS_DEPENDENCY(SlotIndexes)
109 INITIALIZE_PASS_DEPENDENCY(LiveIntervals)
110 INITIALIZE_PASS_END(MachineScheduler, "misched",
111 "Machine Instruction Scheduler", false, false)
113 MachineScheduler::MachineScheduler()
114 : MachineFunctionPass(ID) {
115 initializeMachineSchedulerPass(*PassRegistry::getPassRegistry());
118 void MachineScheduler::getAnalysisUsage(AnalysisUsage &AU) const {
119 AU.setPreservesCFG();
120 AU.addRequiredID(MachineDominatorsID);
121 AU.addRequired<MachineLoopInfo>();
122 AU.addRequired<AliasAnalysis>();
123 AU.addRequired<TargetPassConfig>();
124 AU.addRequired<SlotIndexes>();
125 AU.addPreserved<SlotIndexes>();
126 AU.addRequired<LiveIntervals>();
127 AU.addPreserved<LiveIntervals>();
128 MachineFunctionPass::getAnalysisUsage(AU);
131 MachinePassRegistry MachineSchedRegistry::Registry;
133 /// A dummy default scheduler factory indicates whether the scheduler
134 /// is overridden on the command line.
135 static ScheduleDAGInstrs *useDefaultMachineSched(MachineSchedContext *C) {
139 /// MachineSchedOpt allows command line selection of the scheduler.
140 static cl::opt<MachineSchedRegistry::ScheduleDAGCtor, false,
141 RegisterPassParser<MachineSchedRegistry> >
142 MachineSchedOpt("misched",
143 cl::init(&useDefaultMachineSched), cl::Hidden,
144 cl::desc("Machine instruction scheduler to use"));
146 static MachineSchedRegistry
147 DefaultSchedRegistry("default", "Use the target's default scheduler choice.",
148 useDefaultMachineSched);
150 /// Forward declare the standard machine scheduler. This will be used as the
151 /// default scheduler if the target does not set a default.
152 static ScheduleDAGInstrs *createConvergingSched(MachineSchedContext *C);
155 /// Decrement this iterator until reaching the top or a non-debug instr.
156 static MachineBasicBlock::iterator
157 priorNonDebug(MachineBasicBlock::iterator I, MachineBasicBlock::iterator Beg) {
158 assert(I != Beg && "reached the top of the region, cannot decrement");
160 if (!I->isDebugValue())
166 /// If this iterator is a debug value, increment until reaching the End or a
167 /// non-debug instruction.
168 static MachineBasicBlock::iterator
169 nextIfDebug(MachineBasicBlock::iterator I, MachineBasicBlock::iterator End) {
170 for(; I != End; ++I) {
171 if (!I->isDebugValue())
177 /// Top-level MachineScheduler pass driver.
179 /// Visit blocks in function order. Divide each block into scheduling regions
180 /// and visit them bottom-up. Visiting regions bottom-up is not required, but is
181 /// consistent with the DAG builder, which traverses the interior of the
182 /// scheduling regions bottom-up.
184 /// This design avoids exposing scheduling boundaries to the DAG builder,
185 /// simplifying the DAG builder's support for "special" target instructions.
186 /// At the same time the design allows target schedulers to operate across
187 /// scheduling boundaries, for example to bundle the boudary instructions
188 /// without reordering them. This creates complexity, because the target
189 /// scheduler must update the RegionBegin and RegionEnd positions cached by
190 /// ScheduleDAGInstrs whenever adding or removing instructions. A much simpler
191 /// design would be to split blocks at scheduling boundaries, but LLVM has a
192 /// general bias against block splitting purely for implementation simplicity.
193 bool MachineScheduler::runOnMachineFunction(MachineFunction &mf) {
194 DEBUG(dbgs() << "Before MISsched:\n"; mf.print(dbgs()));
196 // Initialize the context of the pass.
198 MLI = &getAnalysis<MachineLoopInfo>();
199 MDT = &getAnalysis<MachineDominatorTree>();
200 PassConfig = &getAnalysis<TargetPassConfig>();
201 AA = &getAnalysis<AliasAnalysis>();
203 LIS = &getAnalysis<LiveIntervals>();
204 const TargetInstrInfo *TII = MF->getTarget().getInstrInfo();
206 if (VerifyScheduling) {
208 MF->verify(this, "Before machine scheduling.");
210 RegClassInfo->runOnMachineFunction(*MF);
212 // Select the scheduler, or set the default.
213 MachineSchedRegistry::ScheduleDAGCtor Ctor = MachineSchedOpt;
214 if (Ctor == useDefaultMachineSched) {
215 // Get the default scheduler set by the target.
216 Ctor = MachineSchedRegistry::getDefault();
218 Ctor = createConvergingSched;
219 MachineSchedRegistry::setDefault(Ctor);
222 // Instantiate the selected scheduler.
223 OwningPtr<ScheduleDAGInstrs> Scheduler(Ctor(this));
225 // Visit all machine basic blocks.
227 // TODO: Visit blocks in global postorder or postorder within the bottom-up
228 // loop tree. Then we can optionally compute global RegPressure.
229 for (MachineFunction::iterator MBB = MF->begin(), MBBEnd = MF->end();
230 MBB != MBBEnd; ++MBB) {
232 Scheduler->startBlock(MBB);
234 // Break the block into scheduling regions [I, RegionEnd), and schedule each
235 // region as soon as it is discovered. RegionEnd points the scheduling
236 // boundary at the bottom of the region. The DAG does not include RegionEnd,
237 // but the region does (i.e. the next RegionEnd is above the previous
238 // RegionBegin). If the current block has no terminator then RegionEnd ==
239 // MBB->end() for the bottom region.
241 // The Scheduler may insert instructions during either schedule() or
242 // exitRegion(), even for empty regions. So the local iterators 'I' and
243 // 'RegionEnd' are invalid across these calls.
244 unsigned RemainingInstrs = MBB->size();
245 for(MachineBasicBlock::iterator RegionEnd = MBB->end();
246 RegionEnd != MBB->begin(); RegionEnd = Scheduler->begin()) {
248 // Avoid decrementing RegionEnd for blocks with no terminator.
249 if (RegionEnd != MBB->end()
250 || TII->isSchedulingBoundary(llvm::prior(RegionEnd), MBB, *MF)) {
252 // Count the boundary instruction.
256 // The next region starts above the previous region. Look backward in the
257 // instruction stream until we find the nearest boundary.
258 MachineBasicBlock::iterator I = RegionEnd;
259 for(;I != MBB->begin(); --I, --RemainingInstrs) {
260 if (TII->isSchedulingBoundary(llvm::prior(I), MBB, *MF))
263 // Notify the scheduler of the region, even if we may skip scheduling
264 // it. Perhaps it still needs to be bundled.
265 Scheduler->enterRegion(MBB, I, RegionEnd, RemainingInstrs);
267 // Skip empty scheduling regions (0 or 1 schedulable instructions).
268 if (I == RegionEnd || I == llvm::prior(RegionEnd)) {
269 // Close the current region. Bundle the terminator if needed.
270 // This invalidates 'RegionEnd' and 'I'.
271 Scheduler->exitRegion();
274 DEBUG(dbgs() << "********** MI Scheduling **********\n");
275 DEBUG(dbgs() << MF->getName()
276 << ":BB#" << MBB->getNumber() << " " << MBB->getName()
277 << "\n From: " << *I << " To: ";
278 if (RegionEnd != MBB->end()) dbgs() << *RegionEnd;
279 else dbgs() << "End";
280 dbgs() << " Remaining: " << RemainingInstrs << "\n");
282 // Schedule a region: possibly reorder instructions.
283 // This invalidates 'RegionEnd' and 'I'.
284 Scheduler->schedule();
286 // Close the current region.
287 Scheduler->exitRegion();
289 // Scheduling has invalidated the current iterator 'I'. Ask the
290 // scheduler for the top of it's scheduled region.
291 RegionEnd = Scheduler->begin();
293 assert(RemainingInstrs == 0 && "Instruction count mismatch!");
294 Scheduler->finishBlock();
296 Scheduler->finalizeSchedule();
298 if (VerifyScheduling)
299 MF->verify(this, "After machine scheduling.");
303 void MachineScheduler::print(raw_ostream &O, const Module* m) const {
307 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
308 void ReadyQueue::dump() {
309 dbgs() << Name << ": ";
310 for (unsigned i = 0, e = Queue.size(); i < e; ++i)
311 dbgs() << Queue[i]->NodeNum << " ";
316 //===----------------------------------------------------------------------===//
317 // ScheduleDAGMI - Base class for MachineInstr scheduling with LiveIntervals
319 //===----------------------------------------------------------------------===//
321 ScheduleDAGMI::~ScheduleDAGMI() {
323 DeleteContainerPointers(Mutations);
327 bool ScheduleDAGMI::canAddEdge(SUnit *SuccSU, SUnit *PredSU) {
328 return SuccSU == &ExitSU || !Topo.IsReachable(PredSU, SuccSU);
331 bool ScheduleDAGMI::addEdge(SUnit *SuccSU, const SDep &PredDep) {
332 if (SuccSU != &ExitSU) {
333 // Do not use WillCreateCycle, it assumes SD scheduling.
334 // If Pred is reachable from Succ, then the edge creates a cycle.
335 if (Topo.IsReachable(PredDep.getSUnit(), SuccSU))
337 Topo.AddPred(SuccSU, PredDep.getSUnit());
339 SuccSU->addPred(PredDep, /*Required=*/!PredDep.isArtificial());
340 // Return true regardless of whether a new edge needed to be inserted.
344 /// ReleaseSucc - Decrement the NumPredsLeft count of a successor. When
345 /// NumPredsLeft reaches zero, release the successor node.
347 /// FIXME: Adjust SuccSU height based on MinLatency.
348 void ScheduleDAGMI::releaseSucc(SUnit *SU, SDep *SuccEdge) {
349 SUnit *SuccSU = SuccEdge->getSUnit();
351 if (SuccEdge->isWeak()) {
352 --SuccSU->WeakPredsLeft;
353 if (SuccEdge->isCluster())
354 NextClusterSucc = SuccSU;
358 if (SuccSU->NumPredsLeft == 0) {
359 dbgs() << "*** Scheduling failed! ***\n";
361 dbgs() << " has been released too many times!\n";
365 --SuccSU->NumPredsLeft;
366 if (SuccSU->NumPredsLeft == 0 && SuccSU != &ExitSU)
367 SchedImpl->releaseTopNode(SuccSU);
370 /// releaseSuccessors - Call releaseSucc on each of SU's successors.
371 void ScheduleDAGMI::releaseSuccessors(SUnit *SU) {
372 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
374 releaseSucc(SU, &*I);
378 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. When
379 /// NumSuccsLeft reaches zero, release the predecessor node.
381 /// FIXME: Adjust PredSU height based on MinLatency.
382 void ScheduleDAGMI::releasePred(SUnit *SU, SDep *PredEdge) {
383 SUnit *PredSU = PredEdge->getSUnit();
385 if (PredEdge->isWeak()) {
386 --PredSU->WeakSuccsLeft;
387 if (PredEdge->isCluster())
388 NextClusterPred = PredSU;
392 if (PredSU->NumSuccsLeft == 0) {
393 dbgs() << "*** Scheduling failed! ***\n";
395 dbgs() << " has been released too many times!\n";
399 --PredSU->NumSuccsLeft;
400 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU)
401 SchedImpl->releaseBottomNode(PredSU);
404 /// releasePredecessors - Call releasePred on each of SU's predecessors.
405 void ScheduleDAGMI::releasePredecessors(SUnit *SU) {
406 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
408 releasePred(SU, &*I);
412 /// This is normally called from the main scheduler loop but may also be invoked
413 /// by the scheduling strategy to perform additional code motion.
414 void ScheduleDAGMI::moveInstruction(MachineInstr *MI,
415 MachineBasicBlock::iterator InsertPos) {
416 // Advance RegionBegin if the first instruction moves down.
417 if (&*RegionBegin == MI)
420 // Update the instruction stream.
421 BB->splice(InsertPos, BB, MI);
423 // Update LiveIntervals
424 LIS->handleMove(MI, /*UpdateFlags=*/true);
426 // Recede RegionBegin if an instruction moves above the first.
427 if (RegionBegin == InsertPos)
431 bool ScheduleDAGMI::checkSchedLimit() {
433 if (NumInstrsScheduled == MISchedCutoff && MISchedCutoff != ~0U) {
434 CurrentTop = CurrentBottom;
437 ++NumInstrsScheduled;
442 /// enterRegion - Called back from MachineScheduler::runOnMachineFunction after
443 /// crossing a scheduling boundary. [begin, end) includes all instructions in
444 /// the region, including the boundary itself and single-instruction regions
445 /// that don't get scheduled.
446 void ScheduleDAGMI::enterRegion(MachineBasicBlock *bb,
447 MachineBasicBlock::iterator begin,
448 MachineBasicBlock::iterator end,
451 ScheduleDAGInstrs::enterRegion(bb, begin, end, endcount);
453 // For convenience remember the end of the liveness region.
455 (RegionEnd == bb->end()) ? RegionEnd : llvm::next(RegionEnd);
458 // Setup the register pressure trackers for the top scheduled top and bottom
459 // scheduled regions.
460 void ScheduleDAGMI::initRegPressure() {
461 TopRPTracker.init(&MF, RegClassInfo, LIS, BB, RegionBegin);
462 BotRPTracker.init(&MF, RegClassInfo, LIS, BB, LiveRegionEnd);
464 // Close the RPTracker to finalize live ins.
465 RPTracker.closeRegion();
467 DEBUG(RPTracker.getPressure().dump(TRI));
469 // Initialize the live ins and live outs.
470 TopRPTracker.addLiveRegs(RPTracker.getPressure().LiveInRegs);
471 BotRPTracker.addLiveRegs(RPTracker.getPressure().LiveOutRegs);
473 // Close one end of the tracker so we can call
474 // getMaxUpward/DownwardPressureDelta before advancing across any
475 // instructions. This converts currently live regs into live ins/outs.
476 TopRPTracker.closeTop();
477 BotRPTracker.closeBottom();
479 // Account for liveness generated by the region boundary.
480 if (LiveRegionEnd != RegionEnd)
481 BotRPTracker.recede();
483 assert(BotRPTracker.getPos() == RegionEnd && "Can't find the region bottom");
485 // Cache the list of excess pressure sets in this region. This will also track
486 // the max pressure in the scheduled code for these sets.
487 RegionCriticalPSets.clear();
488 const std::vector<unsigned> &RegionPressure =
489 RPTracker.getPressure().MaxSetPressure;
490 for (unsigned i = 0, e = RegionPressure.size(); i < e; ++i) {
491 unsigned Limit = RegClassInfo->getRegPressureSetLimit(i);
492 if (RegionPressure[i] > Limit) {
493 DEBUG(dbgs() << TRI->getRegPressureSetName(i)
494 << " Limit " << Limit
495 << " Actual " << RegionPressure[i] << "\n");
496 RegionCriticalPSets.push_back(PressureElement(i, 0));
499 DEBUG(dbgs() << "Excess PSets: ";
500 for (unsigned i = 0, e = RegionCriticalPSets.size(); i != e; ++i)
501 dbgs() << TRI->getRegPressureSetName(
502 RegionCriticalPSets[i].PSetID) << " ";
506 // FIXME: When the pressure tracker deals in pressure differences then we won't
507 // iterate over all RegionCriticalPSets[i].
509 updateScheduledPressure(const std::vector<unsigned> &NewMaxPressure) {
510 for (unsigned i = 0, e = RegionCriticalPSets.size(); i < e; ++i) {
511 unsigned ID = RegionCriticalPSets[i].PSetID;
512 int &MaxUnits = RegionCriticalPSets[i].UnitIncrease;
513 if ((int)NewMaxPressure[ID] > MaxUnits)
514 MaxUnits = NewMaxPressure[ID];
517 for (unsigned i = 0, e = NewMaxPressure.size(); i < e; ++i) {
518 unsigned Limit = RegClassInfo->getRegPressureSetLimit(i);
519 if (NewMaxPressure[i] > Limit ) {
520 dbgs() << " " << TRI->getRegPressureSetName(i) << ": "
521 << NewMaxPressure[i] << " > " << Limit << "\n";
526 /// schedule - Called back from MachineScheduler::runOnMachineFunction
527 /// after setting up the current scheduling region. [RegionBegin, RegionEnd)
528 /// only includes instructions that have DAG nodes, not scheduling boundaries.
530 /// This is a skeletal driver, with all the functionality pushed into helpers,
531 /// so that it can be easilly extended by experimental schedulers. Generally,
532 /// implementing MachineSchedStrategy should be sufficient to implement a new
533 /// scheduling algorithm. However, if a scheduler further subclasses
534 /// ScheduleDAGMI then it will want to override this virtual method in order to
535 /// update any specialized state.
536 void ScheduleDAGMI::schedule() {
537 buildDAGWithRegPressure();
539 Topo.InitDAGTopologicalSorting();
543 SmallVector<SUnit*, 8> TopRoots, BotRoots;
544 findRootsAndBiasEdges(TopRoots, BotRoots);
546 // Initialize the strategy before modifying the DAG.
547 // This may initialize a DFSResult to be used for queue priority.
548 SchedImpl->initialize(this);
550 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
551 SUnits[su].dumpAll(this));
552 if (ViewMISchedDAGs) viewGraph();
554 // Initialize ready queues now that the DAG and priority data are finalized.
555 initQueues(TopRoots, BotRoots);
557 bool IsTopNode = false;
558 while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) {
559 assert(!SU->isScheduled && "Node already scheduled");
560 if (!checkSchedLimit())
563 scheduleMI(SU, IsTopNode);
565 updateQueues(SU, IsTopNode);
567 assert(CurrentTop == CurrentBottom && "Nonempty unscheduled zone.");
572 unsigned BBNum = begin()->getParent()->getNumber();
573 dbgs() << "*** Final schedule for BB#" << BBNum << " ***\n";
579 /// Build the DAG and setup three register pressure trackers.
580 void ScheduleDAGMI::buildDAGWithRegPressure() {
581 // Initialize the register pressure tracker used by buildSchedGraph.
582 RPTracker.init(&MF, RegClassInfo, LIS, BB, LiveRegionEnd);
584 // Account for liveness generate by the region boundary.
585 if (LiveRegionEnd != RegionEnd)
588 // Build the DAG, and compute current register pressure.
589 buildSchedGraph(AA, &RPTracker);
591 // Initialize top/bottom trackers after computing region pressure.
595 /// Apply each ScheduleDAGMutation step in order.
596 void ScheduleDAGMI::postprocessDAG() {
597 for (unsigned i = 0, e = Mutations.size(); i < e; ++i) {
598 Mutations[i]->apply(this);
602 void ScheduleDAGMI::computeDFSResult() {
604 DFSResult = new SchedDFSResult(/*BottomU*/true, MinSubtreeSize);
606 ScheduledTrees.clear();
607 DFSResult->resize(SUnits.size());
608 DFSResult->compute(SUnits);
609 ScheduledTrees.resize(DFSResult->getNumSubtrees());
612 void ScheduleDAGMI::findRootsAndBiasEdges(SmallVectorImpl<SUnit*> &TopRoots,
613 SmallVectorImpl<SUnit*> &BotRoots) {
614 for (std::vector<SUnit>::iterator
615 I = SUnits.begin(), E = SUnits.end(); I != E; ++I) {
617 assert(!SU->isBoundaryNode() && "Boundary node should not be in SUnits");
619 // Order predecessors so DFSResult follows the critical path.
620 SU->biasCriticalPath();
622 // A SUnit is ready to top schedule if it has no predecessors.
623 if (!I->NumPredsLeft)
624 TopRoots.push_back(SU);
625 // A SUnit is ready to bottom schedule if it has no successors.
626 if (!I->NumSuccsLeft)
627 BotRoots.push_back(SU);
629 ExitSU.biasCriticalPath();
632 /// Identify DAG roots and setup scheduler queues.
633 void ScheduleDAGMI::initQueues(ArrayRef<SUnit*> TopRoots,
634 ArrayRef<SUnit*> BotRoots) {
635 NextClusterSucc = NULL;
636 NextClusterPred = NULL;
638 // Release all DAG roots for scheduling, not including EntrySU/ExitSU.
640 // Nodes with unreleased weak edges can still be roots.
641 // Release top roots in forward order.
642 for (SmallVectorImpl<SUnit*>::const_iterator
643 I = TopRoots.begin(), E = TopRoots.end(); I != E; ++I) {
644 SchedImpl->releaseTopNode(*I);
646 // Release bottom roots in reverse order so the higher priority nodes appear
647 // first. This is more natural and slightly more efficient.
648 for (SmallVectorImpl<SUnit*>::const_reverse_iterator
649 I = BotRoots.rbegin(), E = BotRoots.rend(); I != E; ++I) {
650 SchedImpl->releaseBottomNode(*I);
653 releaseSuccessors(&EntrySU);
654 releasePredecessors(&ExitSU);
656 SchedImpl->registerRoots();
658 // Advance past initial DebugValues.
659 assert(TopRPTracker.getPos() == RegionBegin && "bad initial Top tracker");
660 CurrentTop = nextIfDebug(RegionBegin, RegionEnd);
661 TopRPTracker.setPos(CurrentTop);
663 CurrentBottom = RegionEnd;
666 /// Move an instruction and update register pressure.
667 void ScheduleDAGMI::scheduleMI(SUnit *SU, bool IsTopNode) {
668 // Move the instruction to its new location in the instruction stream.
669 MachineInstr *MI = SU->getInstr();
672 assert(SU->isTopReady() && "node still has unscheduled dependencies");
673 if (&*CurrentTop == MI)
674 CurrentTop = nextIfDebug(++CurrentTop, CurrentBottom);
676 moveInstruction(MI, CurrentTop);
677 TopRPTracker.setPos(MI);
680 // Update top scheduled pressure.
681 TopRPTracker.advance();
682 assert(TopRPTracker.getPos() == CurrentTop && "out of sync");
683 updateScheduledPressure(TopRPTracker.getPressure().MaxSetPressure);
686 assert(SU->isBottomReady() && "node still has unscheduled dependencies");
687 MachineBasicBlock::iterator priorII =
688 priorNonDebug(CurrentBottom, CurrentTop);
690 CurrentBottom = priorII;
692 if (&*CurrentTop == MI) {
693 CurrentTop = nextIfDebug(++CurrentTop, priorII);
694 TopRPTracker.setPos(CurrentTop);
696 moveInstruction(MI, CurrentBottom);
699 // Update bottom scheduled pressure.
700 BotRPTracker.recede();
701 assert(BotRPTracker.getPos() == CurrentBottom && "out of sync");
702 updateScheduledPressure(BotRPTracker.getPressure().MaxSetPressure);
706 /// Update scheduler queues after scheduling an instruction.
707 void ScheduleDAGMI::updateQueues(SUnit *SU, bool IsTopNode) {
708 // Release dependent instructions for scheduling.
710 releaseSuccessors(SU);
712 releasePredecessors(SU);
714 SU->isScheduled = true;
717 unsigned SubtreeID = DFSResult->getSubtreeID(SU);
718 if (!ScheduledTrees.test(SubtreeID)) {
719 ScheduledTrees.set(SubtreeID);
720 DFSResult->scheduleTree(SubtreeID);
721 SchedImpl->scheduleTree(SubtreeID);
725 // Notify the scheduling strategy after updating the DAG.
726 SchedImpl->schedNode(SU, IsTopNode);
729 /// Reinsert any remaining debug_values, just like the PostRA scheduler.
730 void ScheduleDAGMI::placeDebugValues() {
731 // If first instruction was a DBG_VALUE then put it back.
733 BB->splice(RegionBegin, BB, FirstDbgValue);
734 RegionBegin = FirstDbgValue;
737 for (std::vector<std::pair<MachineInstr *, MachineInstr *> >::iterator
738 DI = DbgValues.end(), DE = DbgValues.begin(); DI != DE; --DI) {
739 std::pair<MachineInstr *, MachineInstr *> P = *prior(DI);
740 MachineInstr *DbgValue = P.first;
741 MachineBasicBlock::iterator OrigPrevMI = P.second;
742 if (&*RegionBegin == DbgValue)
744 BB->splice(++OrigPrevMI, BB, DbgValue);
745 if (OrigPrevMI == llvm::prior(RegionEnd))
746 RegionEnd = DbgValue;
749 FirstDbgValue = NULL;
752 #if !defined(NDEBUG) || defined(LLVM_ENABLE_DUMP)
753 void ScheduleDAGMI::dumpSchedule() const {
754 for (MachineBasicBlock::iterator MI = begin(), ME = end(); MI != ME; ++MI) {
755 if (SUnit *SU = getSUnit(&(*MI)))
758 dbgs() << "Missing SUnit\n";
763 //===----------------------------------------------------------------------===//
764 // LoadClusterMutation - DAG post-processing to cluster loads.
765 //===----------------------------------------------------------------------===//
768 /// \brief Post-process the DAG to create cluster edges between neighboring
770 class LoadClusterMutation : public ScheduleDAGMutation {
775 LoadInfo(SUnit *su, unsigned reg, unsigned ofs)
776 : SU(su), BaseReg(reg), Offset(ofs) {}
778 static bool LoadInfoLess(const LoadClusterMutation::LoadInfo &LHS,
779 const LoadClusterMutation::LoadInfo &RHS);
781 const TargetInstrInfo *TII;
782 const TargetRegisterInfo *TRI;
784 LoadClusterMutation(const TargetInstrInfo *tii,
785 const TargetRegisterInfo *tri)
786 : TII(tii), TRI(tri) {}
788 virtual void apply(ScheduleDAGMI *DAG);
790 void clusterNeighboringLoads(ArrayRef<SUnit*> Loads, ScheduleDAGMI *DAG);
794 bool LoadClusterMutation::LoadInfoLess(
795 const LoadClusterMutation::LoadInfo &LHS,
796 const LoadClusterMutation::LoadInfo &RHS) {
797 if (LHS.BaseReg != RHS.BaseReg)
798 return LHS.BaseReg < RHS.BaseReg;
799 return LHS.Offset < RHS.Offset;
802 void LoadClusterMutation::clusterNeighboringLoads(ArrayRef<SUnit*> Loads,
803 ScheduleDAGMI *DAG) {
804 SmallVector<LoadClusterMutation::LoadInfo,32> LoadRecords;
805 for (unsigned Idx = 0, End = Loads.size(); Idx != End; ++Idx) {
806 SUnit *SU = Loads[Idx];
809 if (TII->getLdStBaseRegImmOfs(SU->getInstr(), BaseReg, Offset, TRI))
810 LoadRecords.push_back(LoadInfo(SU, BaseReg, Offset));
812 if (LoadRecords.size() < 2)
814 std::sort(LoadRecords.begin(), LoadRecords.end(), LoadInfoLess);
815 unsigned ClusterLength = 1;
816 for (unsigned Idx = 0, End = LoadRecords.size(); Idx < (End - 1); ++Idx) {
817 if (LoadRecords[Idx].BaseReg != LoadRecords[Idx+1].BaseReg) {
822 SUnit *SUa = LoadRecords[Idx].SU;
823 SUnit *SUb = LoadRecords[Idx+1].SU;
824 if (TII->shouldClusterLoads(SUa->getInstr(), SUb->getInstr(), ClusterLength)
825 && DAG->addEdge(SUb, SDep(SUa, SDep::Cluster))) {
827 DEBUG(dbgs() << "Cluster loads SU(" << SUa->NodeNum << ") - SU("
828 << SUb->NodeNum << ")\n");
829 // Copy successor edges from SUa to SUb. Interleaving computation
830 // dependent on SUa can prevent load combining due to register reuse.
831 // Predecessor edges do not need to be copied from SUb to SUa since nearby
832 // loads should have effectively the same inputs.
833 for (SUnit::const_succ_iterator
834 SI = SUa->Succs.begin(), SE = SUa->Succs.end(); SI != SE; ++SI) {
835 if (SI->getSUnit() == SUb)
837 DEBUG(dbgs() << " Copy Succ SU(" << SI->getSUnit()->NodeNum << ")\n");
838 DAG->addEdge(SI->getSUnit(), SDep(SUb, SDep::Artificial));
847 /// \brief Callback from DAG postProcessing to create cluster edges for loads.
848 void LoadClusterMutation::apply(ScheduleDAGMI *DAG) {
849 // Map DAG NodeNum to store chain ID.
850 DenseMap<unsigned, unsigned> StoreChainIDs;
851 // Map each store chain to a set of dependent loads.
852 SmallVector<SmallVector<SUnit*,4>, 32> StoreChainDependents;
853 for (unsigned Idx = 0, End = DAG->SUnits.size(); Idx != End; ++Idx) {
854 SUnit *SU = &DAG->SUnits[Idx];
855 if (!SU->getInstr()->mayLoad())
857 unsigned ChainPredID = DAG->SUnits.size();
858 for (SUnit::const_pred_iterator
859 PI = SU->Preds.begin(), PE = SU->Preds.end(); PI != PE; ++PI) {
861 ChainPredID = PI->getSUnit()->NodeNum;
865 // Check if this chain-like pred has been seen
866 // before. ChainPredID==MaxNodeID for loads at the top of the schedule.
867 unsigned NumChains = StoreChainDependents.size();
868 std::pair<DenseMap<unsigned, unsigned>::iterator, bool> Result =
869 StoreChainIDs.insert(std::make_pair(ChainPredID, NumChains));
871 StoreChainDependents.resize(NumChains + 1);
872 StoreChainDependents[Result.first->second].push_back(SU);
874 // Iterate over the store chains.
875 for (unsigned Idx = 0, End = StoreChainDependents.size(); Idx != End; ++Idx)
876 clusterNeighboringLoads(StoreChainDependents[Idx], DAG);
879 //===----------------------------------------------------------------------===//
880 // MacroFusion - DAG post-processing to encourage fusion of macro ops.
881 //===----------------------------------------------------------------------===//
884 /// \brief Post-process the DAG to create cluster edges between instructions
885 /// that may be fused by the processor into a single operation.
886 class MacroFusion : public ScheduleDAGMutation {
887 const TargetInstrInfo *TII;
889 MacroFusion(const TargetInstrInfo *tii): TII(tii) {}
891 virtual void apply(ScheduleDAGMI *DAG);
895 /// \brief Callback from DAG postProcessing to create cluster edges to encourage
896 /// fused operations.
897 void MacroFusion::apply(ScheduleDAGMI *DAG) {
898 // For now, assume targets can only fuse with the branch.
899 MachineInstr *Branch = DAG->ExitSU.getInstr();
903 for (unsigned Idx = DAG->SUnits.size(); Idx > 0;) {
904 SUnit *SU = &DAG->SUnits[--Idx];
905 if (!TII->shouldScheduleAdjacent(SU->getInstr(), Branch))
908 // Create a single weak edge from SU to ExitSU. The only effect is to cause
909 // bottom-up scheduling to heavily prioritize the clustered SU. There is no
910 // need to copy predecessor edges from ExitSU to SU, since top-down
911 // scheduling cannot prioritize ExitSU anyway. To defer top-down scheduling
912 // of SU, we could create an artificial edge from the deepest root, but it
913 // hasn't been needed yet.
914 bool Success = DAG->addEdge(&DAG->ExitSU, SDep(SU, SDep::Cluster));
916 assert(Success && "No DAG nodes should be reachable from ExitSU");
918 DEBUG(dbgs() << "Macro Fuse SU(" << SU->NodeNum << ")\n");
923 //===----------------------------------------------------------------------===//
924 // CopyConstrain - DAG post-processing to encourage copy elimination.
925 //===----------------------------------------------------------------------===//
928 /// \brief Post-process the DAG to create weak edges from all uses of a copy to
929 /// the one use that defines the copy's source vreg, most likely an induction
930 /// variable increment.
931 class CopyConstrain : public ScheduleDAGMutation {
933 SlotIndex RegionBeginIdx;
934 // RegionEndIdx is the slot index of the last non-debug instruction in the
935 // scheduling region. So we may have RegionBeginIdx == RegionEndIdx.
936 SlotIndex RegionEndIdx;
938 CopyConstrain(const TargetInstrInfo *, const TargetRegisterInfo *) {}
940 virtual void apply(ScheduleDAGMI *DAG);
943 void constrainLocalCopy(SUnit *CopySU, ScheduleDAGMI *DAG);
947 /// constrainLocalCopy handles two possibilities:
952 /// I3: dst = src (copy)
953 /// (create pred->succ edges I0->I1, I2->I1)
956 /// I0: dst = src (copy)
960 /// (create pred->succ edges I1->I2, I3->I2)
962 /// Although the MachineScheduler is currently constrained to single blocks,
963 /// this algorithm should handle extended blocks. An EBB is a set of
964 /// contiguously numbered blocks such that the previous block in the EBB is
965 /// always the single predecessor.
966 void CopyConstrain::constrainLocalCopy(SUnit *CopySU, ScheduleDAGMI *DAG) {
967 LiveIntervals *LIS = DAG->getLIS();
968 MachineInstr *Copy = CopySU->getInstr();
970 // Check for pure vreg copies.
971 unsigned SrcReg = Copy->getOperand(1).getReg();
972 if (!TargetRegisterInfo::isVirtualRegister(SrcReg))
975 unsigned DstReg = Copy->getOperand(0).getReg();
976 if (!TargetRegisterInfo::isVirtualRegister(DstReg))
979 // Check if either the dest or source is local. If it's live across a back
980 // edge, it's not local. Note that if both vregs are live across the back
981 // edge, we cannot successfully contrain the copy without cyclic scheduling.
982 unsigned LocalReg = DstReg;
983 unsigned GlobalReg = SrcReg;
984 LiveInterval *LocalLI = &LIS->getInterval(LocalReg);
985 if (!LocalLI->isLocal(RegionBeginIdx, RegionEndIdx)) {
988 LocalLI = &LIS->getInterval(LocalReg);
989 if (!LocalLI->isLocal(RegionBeginIdx, RegionEndIdx))
992 LiveInterval *GlobalLI = &LIS->getInterval(GlobalReg);
994 // Find the global segment after the start of the local LI.
995 LiveInterval::iterator GlobalSegment = GlobalLI->find(LocalLI->beginIndex());
996 // If GlobalLI does not overlap LocalLI->start, then a copy directly feeds a
997 // local live range. We could create edges from other global uses to the local
998 // start, but the coalescer should have already eliminated these cases, so
999 // don't bother dealing with it.
1000 if (GlobalSegment == GlobalLI->end())
1003 // If GlobalSegment is killed at the LocalLI->start, the call to find()
1004 // returned the next global segment. But if GlobalSegment overlaps with
1005 // LocalLI->start, then advance to the next segement. If a hole in GlobalLI
1006 // exists in LocalLI's vicinity, GlobalSegment will be the end of the hole.
1007 if (GlobalSegment->contains(LocalLI->beginIndex()))
1010 if (GlobalSegment == GlobalLI->end())
1013 // Check if GlobalLI contains a hole in the vicinity of LocalLI.
1014 if (GlobalSegment != GlobalLI->begin()) {
1015 // Two address defs have no hole.
1016 if (SlotIndex::isSameInstr(llvm::prior(GlobalSegment)->end,
1017 GlobalSegment->start)) {
1020 // If GlobalLI has a prior segment, it must be live into the EBB. Otherwise
1021 // it would be a disconnected component in the live range.
1022 assert(llvm::prior(GlobalSegment)->start < LocalLI->beginIndex() &&
1023 "Disconnected LRG within the scheduling region.");
1025 MachineInstr *GlobalDef = LIS->getInstructionFromIndex(GlobalSegment->start);
1029 SUnit *GlobalSU = DAG->getSUnit(GlobalDef);
1033 // GlobalDef is the bottom of the GlobalLI hole. Open the hole by
1034 // constraining the uses of the last local def to precede GlobalDef.
1035 SmallVector<SUnit*,8> LocalUses;
1036 const VNInfo *LastLocalVN = LocalLI->getVNInfoBefore(LocalLI->endIndex());
1037 MachineInstr *LastLocalDef = LIS->getInstructionFromIndex(LastLocalVN->def);
1038 SUnit *LastLocalSU = DAG->getSUnit(LastLocalDef);
1039 for (SUnit::const_succ_iterator
1040 I = LastLocalSU->Succs.begin(), E = LastLocalSU->Succs.end();
1042 if (I->getKind() != SDep::Data || I->getReg() != LocalReg)
1044 if (I->getSUnit() == GlobalSU)
1046 if (!DAG->canAddEdge(GlobalSU, I->getSUnit()))
1048 LocalUses.push_back(I->getSUnit());
1050 // Open the top of the GlobalLI hole by constraining any earlier global uses
1051 // to precede the start of LocalLI.
1052 SmallVector<SUnit*,8> GlobalUses;
1053 MachineInstr *FirstLocalDef =
1054 LIS->getInstructionFromIndex(LocalLI->beginIndex());
1055 SUnit *FirstLocalSU = DAG->getSUnit(FirstLocalDef);
1056 for (SUnit::const_pred_iterator
1057 I = GlobalSU->Preds.begin(), E = GlobalSU->Preds.end(); I != E; ++I) {
1058 if (I->getKind() != SDep::Anti || I->getReg() != GlobalReg)
1060 if (I->getSUnit() == FirstLocalSU)
1062 if (!DAG->canAddEdge(FirstLocalSU, I->getSUnit()))
1064 GlobalUses.push_back(I->getSUnit());
1066 DEBUG(dbgs() << "Constraining copy SU(" << CopySU->NodeNum << ")\n");
1067 // Add the weak edges.
1068 for (SmallVectorImpl<SUnit*>::const_iterator
1069 I = LocalUses.begin(), E = LocalUses.end(); I != E; ++I) {
1070 DEBUG(dbgs() << " Local use SU(" << (*I)->NodeNum << ") -> SU("
1071 << GlobalSU->NodeNum << ")\n");
1072 DAG->addEdge(GlobalSU, SDep(*I, SDep::Weak));
1074 for (SmallVectorImpl<SUnit*>::const_iterator
1075 I = GlobalUses.begin(), E = GlobalUses.end(); I != E; ++I) {
1076 DEBUG(dbgs() << " Global use SU(" << (*I)->NodeNum << ") -> SU("
1077 << FirstLocalSU->NodeNum << ")\n");
1078 DAG->addEdge(FirstLocalSU, SDep(*I, SDep::Weak));
1082 /// \brief Callback from DAG postProcessing to create weak edges to encourage
1083 /// copy elimination.
1084 void CopyConstrain::apply(ScheduleDAGMI *DAG) {
1085 MachineBasicBlock::iterator FirstPos = nextIfDebug(DAG->begin(), DAG->end());
1086 if (FirstPos == DAG->end())
1088 RegionBeginIdx = DAG->getLIS()->getInstructionIndex(&*FirstPos);
1089 RegionEndIdx = DAG->getLIS()->getInstructionIndex(
1090 &*priorNonDebug(DAG->end(), DAG->begin()));
1092 for (unsigned Idx = 0, End = DAG->SUnits.size(); Idx != End; ++Idx) {
1093 SUnit *SU = &DAG->SUnits[Idx];
1094 if (!SU->getInstr()->isCopy())
1097 constrainLocalCopy(SU, DAG);
1101 //===----------------------------------------------------------------------===//
1102 // ConvergingScheduler - Implementation of the generic MachineSchedStrategy.
1103 //===----------------------------------------------------------------------===//
1106 /// ConvergingScheduler shrinks the unscheduled zone using heuristics to balance
1108 class ConvergingScheduler : public MachineSchedStrategy {
1110 /// Represent the type of SchedCandidate found within a single queue.
1111 /// pickNodeBidirectional depends on these listed by decreasing priority.
1113 NoCand, PhysRegCopy, RegExcess, RegCritical, Cluster, Weak, RegMax,
1114 ResourceReduce, ResourceDemand, BotHeightReduce, BotPathReduce,
1115 TopDepthReduce, TopPathReduce, NextDefUse, NodeOrder};
1118 static const char *getReasonStr(ConvergingScheduler::CandReason Reason);
1121 /// Policy for scheduling the next instruction in the candidate's zone.
1124 unsigned ReduceResIdx;
1125 unsigned DemandResIdx;
1127 CandPolicy(): ReduceLatency(false), ReduceResIdx(0), DemandResIdx(0) {}
1130 /// Status of an instruction's critical resource consumption.
1131 struct SchedResourceDelta {
1132 // Count critical resources in the scheduled region required by SU.
1133 unsigned CritResources;
1135 // Count critical resources from another region consumed by SU.
1136 unsigned DemandedResources;
1138 SchedResourceDelta(): CritResources(0), DemandedResources(0) {}
1140 bool operator==(const SchedResourceDelta &RHS) const {
1141 return CritResources == RHS.CritResources
1142 && DemandedResources == RHS.DemandedResources;
1144 bool operator!=(const SchedResourceDelta &RHS) const {
1145 return !operator==(RHS);
1149 /// Store the state used by ConvergingScheduler heuristics, required for the
1150 /// lifetime of one invocation of pickNode().
1151 struct SchedCandidate {
1154 // The best SUnit candidate.
1157 // The reason for this candidate.
1160 // Set of reasons that apply to multiple candidates.
1161 uint32_t RepeatReasonSet;
1163 // Register pressure values for the best candidate.
1164 RegPressureDelta RPDelta;
1166 // Critical resource consumption of the best candidate.
1167 SchedResourceDelta ResDelta;
1169 SchedCandidate(const CandPolicy &policy)
1170 : Policy(policy), SU(NULL), Reason(NoCand), RepeatReasonSet(0) {}
1172 bool isValid() const { return SU; }
1174 // Copy the status of another candidate without changing policy.
1175 void setBest(SchedCandidate &Best) {
1176 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
1178 Reason = Best.Reason;
1179 RPDelta = Best.RPDelta;
1180 ResDelta = Best.ResDelta;
1183 bool isRepeat(CandReason R) { return RepeatReasonSet & (1 << R); }
1184 void setRepeat(CandReason R) { RepeatReasonSet |= (1 << R); }
1186 void initResourceDelta(const ScheduleDAGMI *DAG,
1187 const TargetSchedModel *SchedModel);
1190 /// Summarize the unscheduled region.
1191 struct SchedRemainder {
1192 // Critical path through the DAG in expected latency.
1193 unsigned CriticalPath;
1195 // Scaled count of micro-ops left to schedule.
1196 unsigned RemIssueCount;
1198 // Unscheduled resources
1199 SmallVector<unsigned, 16> RemainingCounts;
1204 RemainingCounts.clear();
1207 SchedRemainder() { reset(); }
1209 void init(ScheduleDAGMI *DAG, const TargetSchedModel *SchedModel);
1212 /// Each Scheduling boundary is associated with ready queues. It tracks the
1213 /// current cycle in the direction of movement, and maintains the state
1214 /// of "hazards" and other interlocks at the current cycle.
1215 struct SchedBoundary {
1217 const TargetSchedModel *SchedModel;
1218 SchedRemainder *Rem;
1220 ReadyQueue Available;
1224 // For heuristics, keep a list of the nodes that immediately depend on the
1225 // most recently scheduled node.
1226 SmallPtrSet<const SUnit*, 8> NextSUs;
1228 ScheduleHazardRecognizer *HazardRec;
1230 /// Number of cycles it takes to issue the instructions scheduled in this
1231 /// zone. It is defined as: scheduled-micro-ops / issue-width + stalls.
1232 /// See getStalls().
1235 /// Micro-ops issued in the current cycle
1238 /// MinReadyCycle - Cycle of the soonest available instruction.
1239 unsigned MinReadyCycle;
1241 // The expected latency of the critical path in this scheduled zone.
1242 unsigned ExpectedLatency;
1244 // The latency of dependence chains leading into this zone.
1245 // For each node scheduled top-down: DLat = max DLat, N.Depth.
1246 // For each cycle scheduled: DLat -= 1.
1247 unsigned DependentLatency;
1249 /// Count the scheduled (issued) micro-ops that can be retired by
1250 /// time=CurrCycle assuming the first scheduled instr is retired at time=0.
1251 unsigned RetiredMOps;
1253 // Count scheduled resources that have been executed. Resources are
1254 // considered executed if they become ready in the time that it takes to
1255 // saturate any resource including the one in question. Counts are scaled
1256 // for direct comparison with other resources. Counts can be compared with
1257 // MOps * getMicroOpFactor and Latency * getLatencyFactor.
1258 SmallVector<unsigned, 16> ExecutedResCounts;
1260 /// Cache the max count for a single resource.
1261 unsigned MaxExecutedResCount;
1263 // Cache the critical resources ID in this scheduled zone.
1264 unsigned ZoneCritResIdx;
1266 // Is the scheduled region resource limited vs. latency limited.
1267 bool IsResourceLimited;
1270 // Remember the greatest operand latency as an upper bound on the number of
1271 // times we should retry the pending queue because of a hazard.
1272 unsigned MaxObservedLatency;
1276 // A new HazardRec is created for each DAG and owned by SchedBoundary.
1281 CheckPending = false;
1286 MinReadyCycle = UINT_MAX;
1287 ExpectedLatency = 0;
1288 DependentLatency = 0;
1290 MaxExecutedResCount = 0;
1292 IsResourceLimited = false;
1294 MaxObservedLatency = 0;
1296 // Reserve a zero-count for invalid CritResIdx.
1297 ExecutedResCounts.resize(1);
1298 assert(!ExecutedResCounts[0] && "nonzero count for bad resource");
1301 /// Pending queues extend the ready queues with the same ID and the
1302 /// PendingFlag set.
1303 SchedBoundary(unsigned ID, const Twine &Name):
1304 DAG(0), SchedModel(0), Rem(0), Available(ID, Name+".A"),
1305 Pending(ID << ConvergingScheduler::LogMaxQID, Name+".P"),
1310 ~SchedBoundary() { delete HazardRec; }
1312 void init(ScheduleDAGMI *dag, const TargetSchedModel *smodel,
1313 SchedRemainder *rem);
1315 bool isTop() const {
1316 return Available.getID() == ConvergingScheduler::TopQID;
1320 const char *getResourceName(unsigned PIdx) {
1323 return SchedModel->getProcResource(PIdx)->Name;
1327 /// Get the number of latency cycles "covered" by the scheduled
1328 /// instructions. This is the larger of the critical path within the zone
1329 /// and the number of cycles required to issue the instructions.
1330 unsigned getScheduledLatency() const {
1331 return std::max(ExpectedLatency, CurrCycle);
1334 unsigned getUnscheduledLatency(SUnit *SU) const {
1335 return isTop() ? SU->getHeight() : SU->getDepth();
1338 unsigned getResourceCount(unsigned ResIdx) const {
1339 return ExecutedResCounts[ResIdx];
1342 /// Get the scaled count of scheduled micro-ops and resources, including
1343 /// executed resources.
1344 unsigned getCriticalCount() const {
1345 if (!ZoneCritResIdx)
1346 return RetiredMOps * SchedModel->getMicroOpFactor();
1347 return getResourceCount(ZoneCritResIdx);
1350 /// Get a scaled count for the minimum execution time of the scheduled
1351 /// micro-ops that are ready to execute by getExecutedCount. Notice the
1353 unsigned getExecutedCount() const {
1354 return std::max(CurrCycle * SchedModel->getLatencyFactor(),
1355 MaxExecutedResCount);
1358 bool checkHazard(SUnit *SU);
1360 unsigned findMaxLatency(ArrayRef<SUnit*> ReadySUs);
1362 unsigned getOtherResourceCount(unsigned &OtherCritIdx);
1364 void setPolicy(CandPolicy &Policy, SchedBoundary &OtherZone);
1366 void releaseNode(SUnit *SU, unsigned ReadyCycle);
1368 void bumpCycle(unsigned NextCycle);
1370 void incExecutedResources(unsigned PIdx, unsigned Count);
1372 unsigned countResource(unsigned PIdx, unsigned Cycles, unsigned ReadyCycle);
1374 void bumpNode(SUnit *SU);
1376 void releasePending();
1378 void removeReady(SUnit *SU);
1380 SUnit *pickOnlyChoice();
1383 void dumpScheduledState();
1389 const TargetSchedModel *SchedModel;
1390 const TargetRegisterInfo *TRI;
1392 // State of the top and bottom scheduled instruction boundaries.
1398 /// SUnit::NodeQueueId: 0 (none), 1 (top), 2 (bot), 3 (both)
1405 ConvergingScheduler():
1406 DAG(0), SchedModel(0), TRI(0), Top(TopQID, "TopQ"), Bot(BotQID, "BotQ") {}
1408 virtual void initialize(ScheduleDAGMI *dag);
1410 virtual SUnit *pickNode(bool &IsTopNode);
1412 virtual void schedNode(SUnit *SU, bool IsTopNode);
1414 virtual void releaseTopNode(SUnit *SU);
1416 virtual void releaseBottomNode(SUnit *SU);
1418 virtual void registerRoots();
1421 void tryCandidate(SchedCandidate &Cand,
1422 SchedCandidate &TryCand,
1423 SchedBoundary &Zone,
1424 const RegPressureTracker &RPTracker,
1425 RegPressureTracker &TempTracker);
1427 SUnit *pickNodeBidirectional(bool &IsTopNode);
1429 void pickNodeFromQueue(SchedBoundary &Zone,
1430 const RegPressureTracker &RPTracker,
1431 SchedCandidate &Candidate);
1433 void reschedulePhysRegCopies(SUnit *SU, bool isTop);
1436 void traceCandidate(const SchedCandidate &Cand);
1441 void ConvergingScheduler::SchedRemainder::
1442 init(ScheduleDAGMI *DAG, const TargetSchedModel *SchedModel) {
1444 if (!SchedModel->hasInstrSchedModel())
1446 RemainingCounts.resize(SchedModel->getNumProcResourceKinds());
1447 for (std::vector<SUnit>::iterator
1448 I = DAG->SUnits.begin(), E = DAG->SUnits.end(); I != E; ++I) {
1449 const MCSchedClassDesc *SC = DAG->getSchedClass(&*I);
1450 RemIssueCount += SchedModel->getNumMicroOps(I->getInstr(), SC)
1451 * SchedModel->getMicroOpFactor();
1452 for (TargetSchedModel::ProcResIter
1453 PI = SchedModel->getWriteProcResBegin(SC),
1454 PE = SchedModel->getWriteProcResEnd(SC); PI != PE; ++PI) {
1455 unsigned PIdx = PI->ProcResourceIdx;
1456 unsigned Factor = SchedModel->getResourceFactor(PIdx);
1457 RemainingCounts[PIdx] += (Factor * PI->Cycles);
1462 void ConvergingScheduler::SchedBoundary::
1463 init(ScheduleDAGMI *dag, const TargetSchedModel *smodel, SchedRemainder *rem) {
1466 SchedModel = smodel;
1468 if (SchedModel->hasInstrSchedModel())
1469 ExecutedResCounts.resize(SchedModel->getNumProcResourceKinds());
1472 void ConvergingScheduler::initialize(ScheduleDAGMI *dag) {
1474 SchedModel = DAG->getSchedModel();
1477 Rem.init(DAG, SchedModel);
1478 Top.init(DAG, SchedModel, &Rem);
1479 Bot.init(DAG, SchedModel, &Rem);
1481 // Initialize resource counts.
1483 // Initialize the HazardRecognizers. If itineraries don't exist, are empty, or
1484 // are disabled, then these HazardRecs will be disabled.
1485 const InstrItineraryData *Itin = SchedModel->getInstrItineraries();
1486 const TargetMachine &TM = DAG->MF.getTarget();
1487 Top.HazardRec = TM.getInstrInfo()->CreateTargetMIHazardRecognizer(Itin, DAG);
1488 Bot.HazardRec = TM.getInstrInfo()->CreateTargetMIHazardRecognizer(Itin, DAG);
1490 assert((!ForceTopDown || !ForceBottomUp) &&
1491 "-misched-topdown incompatible with -misched-bottomup");
1494 void ConvergingScheduler::releaseTopNode(SUnit *SU) {
1495 if (SU->isScheduled)
1498 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1502 unsigned PredReadyCycle = I->getSUnit()->TopReadyCycle;
1503 unsigned Latency = I->getLatency();
1505 Top.MaxObservedLatency = std::max(Latency, Top.MaxObservedLatency);
1507 if (SU->TopReadyCycle < PredReadyCycle + Latency)
1508 SU->TopReadyCycle = PredReadyCycle + Latency;
1510 Top.releaseNode(SU, SU->TopReadyCycle);
1513 void ConvergingScheduler::releaseBottomNode(SUnit *SU) {
1514 if (SU->isScheduled)
1517 assert(SU->getInstr() && "Scheduled SUnit must have instr");
1519 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1523 unsigned SuccReadyCycle = I->getSUnit()->BotReadyCycle;
1524 unsigned Latency = I->getLatency();
1526 Bot.MaxObservedLatency = std::max(Latency, Bot.MaxObservedLatency);
1528 if (SU->BotReadyCycle < SuccReadyCycle + Latency)
1529 SU->BotReadyCycle = SuccReadyCycle + Latency;
1531 Bot.releaseNode(SU, SU->BotReadyCycle);
1534 void ConvergingScheduler::registerRoots() {
1535 Rem.CriticalPath = DAG->ExitSU.getDepth();
1536 // Some roots may not feed into ExitSU. Check all of them in case.
1537 for (std::vector<SUnit*>::const_iterator
1538 I = Bot.Available.begin(), E = Bot.Available.end(); I != E; ++I) {
1539 if ((*I)->getDepth() > Rem.CriticalPath)
1540 Rem.CriticalPath = (*I)->getDepth();
1542 DEBUG(dbgs() << "Critical Path: " << Rem.CriticalPath << '\n');
1545 /// Does this SU have a hazard within the current instruction group.
1547 /// The scheduler supports two modes of hazard recognition. The first is the
1548 /// ScheduleHazardRecognizer API. It is a fully general hazard recognizer that
1549 /// supports highly complicated in-order reservation tables
1550 /// (ScoreboardHazardRecognizer) and arbitraty target-specific logic.
1552 /// The second is a streamlined mechanism that checks for hazards based on
1553 /// simple counters that the scheduler itself maintains. It explicitly checks
1554 /// for instruction dispatch limitations, including the number of micro-ops that
1555 /// can dispatch per cycle.
1557 /// TODO: Also check whether the SU must start a new group.
1558 bool ConvergingScheduler::SchedBoundary::checkHazard(SUnit *SU) {
1559 if (HazardRec->isEnabled())
1560 return HazardRec->getHazardType(SU) != ScheduleHazardRecognizer::NoHazard;
1562 unsigned uops = SchedModel->getNumMicroOps(SU->getInstr());
1563 if ((CurrMOps > 0) && (CurrMOps + uops > SchedModel->getIssueWidth())) {
1564 DEBUG(dbgs() << " SU(" << SU->NodeNum << ") uops="
1565 << SchedModel->getNumMicroOps(SU->getInstr()) << '\n');
1571 // Find the unscheduled node in ReadySUs with the highest latency.
1572 unsigned ConvergingScheduler::SchedBoundary::
1573 findMaxLatency(ArrayRef<SUnit*> ReadySUs) {
1575 unsigned RemLatency = 0;
1576 for (ArrayRef<SUnit*>::iterator I = ReadySUs.begin(), E = ReadySUs.end();
1578 unsigned L = getUnscheduledLatency(*I);
1579 if (L > RemLatency) {
1585 DEBUG(dbgs() << Available.getName() << " RemLatency SU("
1586 << LateSU->NodeNum << ") " << RemLatency << "c\n");
1591 // Count resources in this zone and the remaining unscheduled
1592 // instruction. Return the max count, scaled. Set OtherCritIdx to the critical
1593 // resource index, or zero if the zone is issue limited.
1594 unsigned ConvergingScheduler::SchedBoundary::
1595 getOtherResourceCount(unsigned &OtherCritIdx) {
1597 if (!SchedModel->hasInstrSchedModel())
1600 unsigned OtherCritCount = Rem->RemIssueCount
1601 + (RetiredMOps * SchedModel->getMicroOpFactor());
1602 DEBUG(dbgs() << " " << Available.getName() << " + Remain MOps: "
1603 << OtherCritCount / SchedModel->getMicroOpFactor() << '\n');
1604 for (unsigned PIdx = 1, PEnd = SchedModel->getNumProcResourceKinds();
1605 PIdx != PEnd; ++PIdx) {
1606 unsigned OtherCount = getResourceCount(PIdx) + Rem->RemainingCounts[PIdx];
1607 if (OtherCount > OtherCritCount) {
1608 OtherCritCount = OtherCount;
1609 OtherCritIdx = PIdx;
1613 DEBUG(dbgs() << " " << Available.getName() << " + Remain CritRes: "
1614 << OtherCritCount / SchedModel->getResourceFactor(OtherCritIdx)
1615 << " " << getResourceName(OtherCritIdx) << "\n");
1617 return OtherCritCount;
1620 /// Set the CandPolicy for this zone given the current resources and latencies
1621 /// inside and outside the zone.
1622 void ConvergingScheduler::SchedBoundary::setPolicy(CandPolicy &Policy,
1623 SchedBoundary &OtherZone) {
1624 // Now that potential stalls have been considered, apply preemptive heuristics
1625 // based on the the total latency and resources inside and outside this
1628 // Compute remaining latency. We need this both to determine whether the
1629 // overall schedule has become latency-limited and whether the instructions
1630 // outside this zone are resource or latency limited.
1632 // The "dependent" latency is updated incrementally during scheduling as the
1633 // max height/depth of scheduled nodes minus the cycles since it was
1635 // DLat = max (N.depth - (CurrCycle - N.ReadyCycle) for N in Zone
1637 // The "independent" latency is the max ready queue depth:
1638 // ILat = max N.depth for N in Available|Pending
1640 // RemainingLatency is the greater of independent and dependent latency.
1641 unsigned RemLatency = DependentLatency;
1642 RemLatency = std::max(RemLatency, findMaxLatency(Available.elements()));
1643 RemLatency = std::max(RemLatency, findMaxLatency(Pending.elements()));
1645 // Compute the critical resource outside the zone.
1646 unsigned OtherCritIdx;
1647 unsigned OtherCount = OtherZone.getOtherResourceCount(OtherCritIdx);
1649 bool OtherResLimited = false;
1650 if (SchedModel->hasInstrSchedModel()) {
1651 unsigned LFactor = SchedModel->getLatencyFactor();
1652 OtherResLimited = (int)(OtherCount - (RemLatency * LFactor)) > (int)LFactor;
1654 if (!OtherResLimited && (RemLatency + CurrCycle > Rem->CriticalPath)) {
1655 Policy.ReduceLatency |= true;
1656 DEBUG(dbgs() << " " << Available.getName() << " RemainingLatency "
1657 << RemLatency << " + " << CurrCycle << "c > CritPath "
1658 << Rem->CriticalPath << "\n");
1660 // If the same resource is limiting inside and outside the zone, do nothing.
1661 if (ZoneCritResIdx == OtherCritIdx)
1665 if (IsResourceLimited) {
1666 dbgs() << " " << Available.getName() << " ResourceLimited: "
1667 << getResourceName(ZoneCritResIdx) << "\n";
1669 if (OtherResLimited)
1670 dbgs() << " RemainingLimit: " << getResourceName(OtherCritIdx) << "\n";
1671 if (!IsResourceLimited && !OtherResLimited)
1672 dbgs() << " Latency limited both directions.\n");
1674 if (IsResourceLimited && !Policy.ReduceResIdx)
1675 Policy.ReduceResIdx = ZoneCritResIdx;
1677 if (OtherResLimited)
1678 Policy.DemandResIdx = OtherCritIdx;
1681 void ConvergingScheduler::SchedBoundary::releaseNode(SUnit *SU,
1682 unsigned ReadyCycle) {
1683 if (ReadyCycle < MinReadyCycle)
1684 MinReadyCycle = ReadyCycle;
1686 // Check for interlocks first. For the purpose of other heuristics, an
1687 // instruction that cannot issue appears as if it's not in the ReadyQueue.
1688 bool IsBuffered = SchedModel->getMicroOpBufferSize() != 0;
1689 if ((!IsBuffered && ReadyCycle > CurrCycle) || checkHazard(SU))
1694 // Record this node as an immediate dependent of the scheduled node.
1698 /// Move the boundary of scheduled code by one cycle.
1699 void ConvergingScheduler::SchedBoundary::bumpCycle(unsigned NextCycle) {
1700 if (SchedModel->getMicroOpBufferSize() == 0) {
1701 assert(MinReadyCycle < UINT_MAX && "MinReadyCycle uninitialized");
1702 if (MinReadyCycle > NextCycle)
1703 NextCycle = MinReadyCycle;
1705 // Update the current micro-ops, which will issue in the next cycle.
1706 unsigned DecMOps = SchedModel->getIssueWidth() * (NextCycle - CurrCycle);
1707 CurrMOps = (CurrMOps <= DecMOps) ? 0 : CurrMOps - DecMOps;
1709 // Decrement DependentLatency based on the next cycle.
1710 if ((NextCycle - CurrCycle) > DependentLatency)
1711 DependentLatency = 0;
1713 DependentLatency -= (NextCycle - CurrCycle);
1715 if (!HazardRec->isEnabled()) {
1716 // Bypass HazardRec virtual calls.
1717 CurrCycle = NextCycle;
1720 // Bypass getHazardType calls in case of long latency.
1721 for (; CurrCycle != NextCycle; ++CurrCycle) {
1723 HazardRec->AdvanceCycle();
1725 HazardRec->RecedeCycle();
1728 CheckPending = true;
1729 unsigned LFactor = SchedModel->getLatencyFactor();
1731 (int)(getCriticalCount() - (getScheduledLatency() * LFactor))
1734 DEBUG(dbgs() << "Cycle: " << CurrCycle << ' ' << Available.getName() << '\n');
1737 void ConvergingScheduler::SchedBoundary::incExecutedResources(unsigned PIdx,
1739 ExecutedResCounts[PIdx] += Count;
1740 if (ExecutedResCounts[PIdx] > MaxExecutedResCount)
1741 MaxExecutedResCount = ExecutedResCounts[PIdx];
1744 /// Add the given processor resource to this scheduled zone.
1746 /// \param Cycles indicates the number of consecutive (non-pipelined) cycles
1747 /// during which this resource is consumed.
1749 /// \return the next cycle at which the instruction may execute without
1750 /// oversubscribing resources.
1751 unsigned ConvergingScheduler::SchedBoundary::
1752 countResource(unsigned PIdx, unsigned Cycles, unsigned ReadyCycle) {
1753 unsigned Factor = SchedModel->getResourceFactor(PIdx);
1754 unsigned Count = Factor * Cycles;
1755 DEBUG(dbgs() << " " << getResourceName(PIdx)
1756 << " +" << Cycles << "x" << Factor << "u\n");
1758 // Update Executed resources counts.
1759 incExecutedResources(PIdx, Count);
1760 assert(Rem->RemainingCounts[PIdx] >= Count && "resource double counted");
1761 Rem->RemainingCounts[PIdx] -= Count;
1763 // Check if this resource exceeds the current critical resource. If so, it
1764 // becomes the critical resource.
1765 if (ZoneCritResIdx != PIdx && (getResourceCount(PIdx) > getCriticalCount())) {
1766 ZoneCritResIdx = PIdx;
1767 DEBUG(dbgs() << " *** Critical resource "
1768 << getResourceName(PIdx) << ": "
1769 << getResourceCount(PIdx) / SchedModel->getLatencyFactor() << "c\n");
1771 // TODO: We don't yet model reserved resources. It's not hard though.
1775 /// Move the boundary of scheduled code by one SUnit.
1776 void ConvergingScheduler::SchedBoundary::bumpNode(SUnit *SU) {
1777 // Update the reservation table.
1778 if (HazardRec->isEnabled()) {
1779 if (!isTop() && SU->isCall) {
1780 // Calls are scheduled with their preceding instructions. For bottom-up
1781 // scheduling, clear the pipeline state before emitting.
1784 HazardRec->EmitInstruction(SU);
1786 const MCSchedClassDesc *SC = DAG->getSchedClass(SU);
1787 unsigned IncMOps = SchedModel->getNumMicroOps(SU->getInstr());
1788 CurrMOps += IncMOps;
1789 // checkHazard prevents scheduling multiple instructions per cycle that exceed
1790 // issue width. However, we commonly reach the maximum. In this case
1791 // opportunistically bump the cycle to avoid uselessly checking everything in
1792 // the readyQ. Furthermore, a single instruction may produce more than one
1793 // cycle's worth of micro-ops.
1795 // TODO: Also check if this SU must end a dispatch group.
1796 unsigned NextCycle = CurrCycle;
1797 if (CurrMOps >= SchedModel->getIssueWidth()) {
1799 DEBUG(dbgs() << " *** Max MOps " << CurrMOps
1800 << " at cycle " << CurrCycle << '\n');
1802 unsigned ReadyCycle = (isTop() ? SU->TopReadyCycle : SU->BotReadyCycle);
1803 DEBUG(dbgs() << " Ready @" << ReadyCycle << "c\n");
1805 switch (SchedModel->getMicroOpBufferSize()) {
1807 assert(ReadyCycle <= CurrCycle && "Broken PendingQueue");
1810 if (ReadyCycle > NextCycle) {
1811 NextCycle = ReadyCycle;
1812 DEBUG(dbgs() << " *** Stall until: " << ReadyCycle << "\n");
1816 // We don't currently model the OOO reorder buffer, so consider all
1817 // scheduled MOps to be "retired".
1820 RetiredMOps += IncMOps;
1822 // Update resource counts and critical resource.
1823 if (SchedModel->hasInstrSchedModel()) {
1824 unsigned DecRemIssue = IncMOps * SchedModel->getMicroOpFactor();
1825 assert(Rem->RemIssueCount >= DecRemIssue && "MOps double counted");
1826 Rem->RemIssueCount -= DecRemIssue;
1827 if (ZoneCritResIdx) {
1828 // Scale scheduled micro-ops for comparing with the critical resource.
1829 unsigned ScaledMOps =
1830 RetiredMOps * SchedModel->getMicroOpFactor();
1832 // If scaled micro-ops are now more than the previous critical resource by
1833 // a full cycle, then micro-ops issue becomes critical.
1834 if ((int)(ScaledMOps - getResourceCount(ZoneCritResIdx))
1835 >= (int)SchedModel->getLatencyFactor()) {
1837 DEBUG(dbgs() << " *** Critical resource NumMicroOps: "
1838 << ScaledMOps / SchedModel->getLatencyFactor() << "c\n");
1841 for (TargetSchedModel::ProcResIter
1842 PI = SchedModel->getWriteProcResBegin(SC),
1843 PE = SchedModel->getWriteProcResEnd(SC); PI != PE; ++PI) {
1845 countResource(PI->ProcResourceIdx, PI->Cycles, ReadyCycle);
1846 if (RCycle > NextCycle)
1850 // Update ExpectedLatency and DependentLatency.
1851 unsigned &TopLatency = isTop() ? ExpectedLatency : DependentLatency;
1852 unsigned &BotLatency = isTop() ? DependentLatency : ExpectedLatency;
1853 if (SU->getDepth() > TopLatency) {
1854 TopLatency = SU->getDepth();
1855 DEBUG(dbgs() << " " << Available.getName()
1856 << " TopLatency SU(" << SU->NodeNum << ") " << TopLatency << "c\n");
1858 if (SU->getHeight() > BotLatency) {
1859 BotLatency = SU->getHeight();
1860 DEBUG(dbgs() << " " << Available.getName()
1861 << " BotLatency SU(" << SU->NodeNum << ") " << BotLatency << "c\n");
1863 // If we stall for any reason, bump the cycle.
1864 if (NextCycle > CurrCycle) {
1865 bumpCycle(NextCycle);
1868 // After updating ZoneCritResIdx and ExpectedLatency, check if we're
1869 // resource limited. If a stall occured, bumpCycle does this.
1870 unsigned LFactor = SchedModel->getLatencyFactor();
1872 (int)(getCriticalCount() - (getScheduledLatency() * LFactor))
1875 DEBUG(dumpScheduledState());
1878 /// Release pending ready nodes in to the available queue. This makes them
1879 /// visible to heuristics.
1880 void ConvergingScheduler::SchedBoundary::releasePending() {
1881 // If the available queue is empty, it is safe to reset MinReadyCycle.
1882 if (Available.empty())
1883 MinReadyCycle = UINT_MAX;
1885 // Check to see if any of the pending instructions are ready to issue. If
1886 // so, add them to the available queue.
1887 bool IsBuffered = SchedModel->getMicroOpBufferSize() != 0;
1888 for (unsigned i = 0, e = Pending.size(); i != e; ++i) {
1889 SUnit *SU = *(Pending.begin()+i);
1890 unsigned ReadyCycle = isTop() ? SU->TopReadyCycle : SU->BotReadyCycle;
1892 if (ReadyCycle < MinReadyCycle)
1893 MinReadyCycle = ReadyCycle;
1895 if (!IsBuffered && ReadyCycle > CurrCycle)
1898 if (checkHazard(SU))
1902 Pending.remove(Pending.begin()+i);
1905 DEBUG(if (!Pending.empty()) Pending.dump());
1906 CheckPending = false;
1909 /// Remove SU from the ready set for this boundary.
1910 void ConvergingScheduler::SchedBoundary::removeReady(SUnit *SU) {
1911 if (Available.isInQueue(SU))
1912 Available.remove(Available.find(SU));
1914 assert(Pending.isInQueue(SU) && "bad ready count");
1915 Pending.remove(Pending.find(SU));
1919 /// If this queue only has one ready candidate, return it. As a side effect,
1920 /// defer any nodes that now hit a hazard, and advance the cycle until at least
1921 /// one node is ready. If multiple instructions are ready, return NULL.
1922 SUnit *ConvergingScheduler::SchedBoundary::pickOnlyChoice() {
1927 // Defer any ready instrs that now have a hazard.
1928 for (ReadyQueue::iterator I = Available.begin(); I != Available.end();) {
1929 if (checkHazard(*I)) {
1931 I = Available.remove(I);
1937 for (unsigned i = 0; Available.empty(); ++i) {
1938 assert(i <= (HazardRec->getMaxLookAhead() + MaxObservedLatency) &&
1939 "permanent hazard"); (void)i;
1940 bumpCycle(CurrCycle + 1);
1943 if (Available.size() == 1)
1944 return *Available.begin();
1949 // This is useful information to dump after bumpNode.
1950 // Note that the Queue contents are more useful before pickNodeFromQueue.
1951 void ConvergingScheduler::SchedBoundary::dumpScheduledState() {
1954 if (ZoneCritResIdx) {
1955 ResFactor = SchedModel->getResourceFactor(ZoneCritResIdx);
1956 ResCount = getResourceCount(ZoneCritResIdx);
1959 ResFactor = SchedModel->getMicroOpFactor();
1960 ResCount = RetiredMOps * SchedModel->getMicroOpFactor();
1962 unsigned LFactor = SchedModel->getLatencyFactor();
1963 dbgs() << Available.getName() << " @" << CurrCycle << "c\n"
1964 << " Retired: " << RetiredMOps;
1965 dbgs() << "\n Executed: " << getExecutedCount() / LFactor << "c";
1966 dbgs() << "\n Critical: " << ResCount / LFactor << "c, "
1967 << ResCount / ResFactor << " " << getResourceName(ZoneCritResIdx)
1968 << "\n ExpectedLatency: " << ExpectedLatency << "c\n"
1969 << (IsResourceLimited ? " - Resource" : " - Latency")
1974 void ConvergingScheduler::SchedCandidate::
1975 initResourceDelta(const ScheduleDAGMI *DAG,
1976 const TargetSchedModel *SchedModel) {
1977 if (!Policy.ReduceResIdx && !Policy.DemandResIdx)
1980 const MCSchedClassDesc *SC = DAG->getSchedClass(SU);
1981 for (TargetSchedModel::ProcResIter
1982 PI = SchedModel->getWriteProcResBegin(SC),
1983 PE = SchedModel->getWriteProcResEnd(SC); PI != PE; ++PI) {
1984 if (PI->ProcResourceIdx == Policy.ReduceResIdx)
1985 ResDelta.CritResources += PI->Cycles;
1986 if (PI->ProcResourceIdx == Policy.DemandResIdx)
1987 ResDelta.DemandedResources += PI->Cycles;
1992 /// Return true if this heuristic determines order.
1993 static bool tryLess(int TryVal, int CandVal,
1994 ConvergingScheduler::SchedCandidate &TryCand,
1995 ConvergingScheduler::SchedCandidate &Cand,
1996 ConvergingScheduler::CandReason Reason) {
1997 if (TryVal < CandVal) {
1998 TryCand.Reason = Reason;
2001 if (TryVal > CandVal) {
2002 if (Cand.Reason > Reason)
2003 Cand.Reason = Reason;
2006 Cand.setRepeat(Reason);
2010 static bool tryGreater(int TryVal, int CandVal,
2011 ConvergingScheduler::SchedCandidate &TryCand,
2012 ConvergingScheduler::SchedCandidate &Cand,
2013 ConvergingScheduler::CandReason Reason) {
2014 if (TryVal > CandVal) {
2015 TryCand.Reason = Reason;
2018 if (TryVal < CandVal) {
2019 if (Cand.Reason > Reason)
2020 Cand.Reason = Reason;
2023 Cand.setRepeat(Reason);
2027 static unsigned getWeakLeft(const SUnit *SU, bool isTop) {
2028 return (isTop) ? SU->WeakPredsLeft : SU->WeakSuccsLeft;
2031 /// Minimize physical register live ranges. Regalloc wants them adjacent to
2032 /// their physreg def/use.
2034 /// FIXME: This is an unnecessary check on the critical path. Most are root/leaf
2035 /// copies which can be prescheduled. The rest (e.g. x86 MUL) could be bundled
2036 /// with the operation that produces or consumes the physreg. We'll do this when
2037 /// regalloc has support for parallel copies.
2038 static int biasPhysRegCopy(const SUnit *SU, bool isTop) {
2039 const MachineInstr *MI = SU->getInstr();
2043 unsigned ScheduledOper = isTop ? 1 : 0;
2044 unsigned UnscheduledOper = isTop ? 0 : 1;
2045 // If we have already scheduled the physreg produce/consumer, immediately
2046 // schedule the copy.
2047 if (TargetRegisterInfo::isPhysicalRegister(
2048 MI->getOperand(ScheduledOper).getReg()))
2050 // If the physreg is at the boundary, defer it. Otherwise schedule it
2051 // immediately to free the dependent. We can hoist the copy later.
2052 bool AtBoundary = isTop ? !SU->NumSuccsLeft : !SU->NumPredsLeft;
2053 if (TargetRegisterInfo::isPhysicalRegister(
2054 MI->getOperand(UnscheduledOper).getReg()))
2055 return AtBoundary ? -1 : 1;
2059 /// Apply a set of heursitics to a new candidate. Heuristics are currently
2060 /// hierarchical. This may be more efficient than a graduated cost model because
2061 /// we don't need to evaluate all aspects of the model for each node in the
2062 /// queue. But it's really done to make the heuristics easier to debug and
2063 /// statistically analyze.
2065 /// \param Cand provides the policy and current best candidate.
2066 /// \param TryCand refers to the next SUnit candidate, otherwise uninitialized.
2067 /// \param Zone describes the scheduled zone that we are extending.
2068 /// \param RPTracker describes reg pressure within the scheduled zone.
2069 /// \param TempTracker is a scratch pressure tracker to reuse in queries.
2070 void ConvergingScheduler::tryCandidate(SchedCandidate &Cand,
2071 SchedCandidate &TryCand,
2072 SchedBoundary &Zone,
2073 const RegPressureTracker &RPTracker,
2074 RegPressureTracker &TempTracker) {
2076 // Always initialize TryCand's RPDelta.
2077 TempTracker.getMaxPressureDelta(TryCand.SU->getInstr(), TryCand.RPDelta,
2078 DAG->getRegionCriticalPSets(),
2079 DAG->getRegPressure().MaxSetPressure);
2081 // Initialize the candidate if needed.
2082 if (!Cand.isValid()) {
2083 TryCand.Reason = NodeOrder;
2087 if (tryGreater(biasPhysRegCopy(TryCand.SU, Zone.isTop()),
2088 biasPhysRegCopy(Cand.SU, Zone.isTop()),
2089 TryCand, Cand, PhysRegCopy))
2092 // Avoid exceeding the target's limit.
2093 if (tryLess(TryCand.RPDelta.Excess.UnitIncrease,
2094 Cand.RPDelta.Excess.UnitIncrease, TryCand, Cand, RegExcess))
2097 // Avoid increasing the max critical pressure in the scheduled region.
2098 if (tryLess(TryCand.RPDelta.CriticalMax.UnitIncrease,
2099 Cand.RPDelta.CriticalMax.UnitIncrease,
2100 TryCand, Cand, RegCritical))
2103 // Keep clustered nodes together to encourage downstream peephole
2104 // optimizations which may reduce resource requirements.
2106 // This is a best effort to set things up for a post-RA pass. Optimizations
2107 // like generating loads of multiple registers should ideally be done within
2108 // the scheduler pass by combining the loads during DAG postprocessing.
2109 const SUnit *NextClusterSU =
2110 Zone.isTop() ? DAG->getNextClusterSucc() : DAG->getNextClusterPred();
2111 if (tryGreater(TryCand.SU == NextClusterSU, Cand.SU == NextClusterSU,
2112 TryCand, Cand, Cluster))
2115 // Weak edges are for clustering and other constraints.
2116 if (tryLess(getWeakLeft(TryCand.SU, Zone.isTop()),
2117 getWeakLeft(Cand.SU, Zone.isTop()),
2118 TryCand, Cand, Weak)) {
2121 // Avoid increasing the max pressure of the entire region.
2122 if (tryLess(TryCand.RPDelta.CurrentMax.UnitIncrease,
2123 Cand.RPDelta.CurrentMax.UnitIncrease, TryCand, Cand, RegMax))
2126 // Avoid critical resource consumption and balance the schedule.
2127 TryCand.initResourceDelta(DAG, SchedModel);
2128 if (tryLess(TryCand.ResDelta.CritResources, Cand.ResDelta.CritResources,
2129 TryCand, Cand, ResourceReduce))
2131 if (tryGreater(TryCand.ResDelta.DemandedResources,
2132 Cand.ResDelta.DemandedResources,
2133 TryCand, Cand, ResourceDemand))
2136 // Avoid serializing long latency dependence chains.
2137 if (Cand.Policy.ReduceLatency) {
2139 if (Cand.SU->getDepth() > Zone.getScheduledLatency()) {
2140 if (tryLess(TryCand.SU->getDepth(), Cand.SU->getDepth(),
2141 TryCand, Cand, TopDepthReduce))
2144 if (tryGreater(TryCand.SU->getHeight(), Cand.SU->getHeight(),
2145 TryCand, Cand, TopPathReduce))
2149 if (Cand.SU->getHeight() > Zone.getScheduledLatency()) {
2150 if (tryLess(TryCand.SU->getHeight(), Cand.SU->getHeight(),
2151 TryCand, Cand, BotHeightReduce))
2154 if (tryGreater(TryCand.SU->getDepth(), Cand.SU->getDepth(),
2155 TryCand, Cand, BotPathReduce))
2160 // Prefer immediate defs/users of the last scheduled instruction. This is a
2161 // local pressure avoidance strategy that also makes the machine code
2163 if (tryGreater(Zone.NextSUs.count(TryCand.SU), Zone.NextSUs.count(Cand.SU),
2164 TryCand, Cand, NextDefUse))
2167 // Fall through to original instruction order.
2168 if ((Zone.isTop() && TryCand.SU->NodeNum < Cand.SU->NodeNum)
2169 || (!Zone.isTop() && TryCand.SU->NodeNum > Cand.SU->NodeNum)) {
2170 TryCand.Reason = NodeOrder;
2175 const char *ConvergingScheduler::getReasonStr(
2176 ConvergingScheduler::CandReason Reason) {
2178 case NoCand: return "NOCAND ";
2179 case PhysRegCopy: return "PREG-COPY";
2180 case RegExcess: return "REG-EXCESS";
2181 case RegCritical: return "REG-CRIT ";
2182 case Cluster: return "CLUSTER ";
2183 case Weak: return "WEAK ";
2184 case RegMax: return "REG-MAX ";
2185 case ResourceReduce: return "RES-REDUCE";
2186 case ResourceDemand: return "RES-DEMAND";
2187 case TopDepthReduce: return "TOP-DEPTH ";
2188 case TopPathReduce: return "TOP-PATH ";
2189 case BotHeightReduce:return "BOT-HEIGHT";
2190 case BotPathReduce: return "BOT-PATH ";
2191 case NextDefUse: return "DEF-USE ";
2192 case NodeOrder: return "ORDER ";
2194 llvm_unreachable("Unknown reason!");
2197 void ConvergingScheduler::traceCandidate(const SchedCandidate &Cand) {
2199 unsigned ResIdx = 0;
2200 unsigned Latency = 0;
2201 switch (Cand.Reason) {
2205 P = Cand.RPDelta.Excess;
2208 P = Cand.RPDelta.CriticalMax;
2211 P = Cand.RPDelta.CurrentMax;
2213 case ResourceReduce:
2214 ResIdx = Cand.Policy.ReduceResIdx;
2216 case ResourceDemand:
2217 ResIdx = Cand.Policy.DemandResIdx;
2219 case TopDepthReduce:
2220 Latency = Cand.SU->getDepth();
2223 Latency = Cand.SU->getHeight();
2225 case BotHeightReduce:
2226 Latency = Cand.SU->getHeight();
2229 Latency = Cand.SU->getDepth();
2232 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);
2234 dbgs() << " " << TRI->getRegPressureSetName(P.PSetID)
2235 << ":" << P.UnitIncrease << " ";
2239 dbgs() << " " << SchedModel->getProcResource(ResIdx)->Name << " ";
2243 dbgs() << " " << Latency << " cycles ";
2250 /// Pick the best candidate from the top queue.
2252 /// TODO: getMaxPressureDelta results can be mostly cached for each SUnit during
2253 /// DAG building. To adjust for the current scheduling location we need to
2254 /// maintain the number of vreg uses remaining to be top-scheduled.
2255 void ConvergingScheduler::pickNodeFromQueue(SchedBoundary &Zone,
2256 const RegPressureTracker &RPTracker,
2257 SchedCandidate &Cand) {
2258 ReadyQueue &Q = Zone.Available;
2262 // getMaxPressureDelta temporarily modifies the tracker.
2263 RegPressureTracker &TempTracker = const_cast<RegPressureTracker&>(RPTracker);
2265 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
2267 SchedCandidate TryCand(Cand.Policy);
2269 tryCandidate(Cand, TryCand, Zone, RPTracker, TempTracker);
2270 if (TryCand.Reason != NoCand) {
2271 // Initialize resource delta if needed in case future heuristics query it.
2272 if (TryCand.ResDelta == SchedResourceDelta())
2273 TryCand.initResourceDelta(DAG, SchedModel);
2274 Cand.setBest(TryCand);
2275 DEBUG(traceCandidate(Cand));
2280 static void tracePick(const ConvergingScheduler::SchedCandidate &Cand,
2282 DEBUG(dbgs() << "Pick " << (IsTop ? "Top " : "Bot ")
2283 << ConvergingScheduler::getReasonStr(Cand.Reason) << '\n');
2286 /// Pick the best candidate node from either the top or bottom queue.
2287 SUnit *ConvergingScheduler::pickNodeBidirectional(bool &IsTopNode) {
2288 // Schedule as far as possible in the direction of no choice. This is most
2289 // efficient, but also provides the best heuristics for CriticalPSets.
2290 if (SUnit *SU = Bot.pickOnlyChoice()) {
2292 DEBUG(dbgs() << "Pick Bot NOCAND\n");
2295 if (SUnit *SU = Top.pickOnlyChoice()) {
2297 DEBUG(dbgs() << "Pick Top NOCAND\n");
2300 CandPolicy NoPolicy;
2301 SchedCandidate BotCand(NoPolicy);
2302 SchedCandidate TopCand(NoPolicy);
2303 Bot.setPolicy(BotCand.Policy, Top);
2304 Top.setPolicy(TopCand.Policy, Bot);
2306 // Prefer bottom scheduling when heuristics are silent.
2307 pickNodeFromQueue(Bot, DAG->getBotRPTracker(), BotCand);
2308 assert(BotCand.Reason != NoCand && "failed to find the first candidate");
2310 // If either Q has a single candidate that provides the least increase in
2311 // Excess pressure, we can immediately schedule from that Q.
2313 // RegionCriticalPSets summarizes the pressure within the scheduled region and
2314 // affects picking from either Q. If scheduling in one direction must
2315 // increase pressure for one of the excess PSets, then schedule in that
2316 // direction first to provide more freedom in the other direction.
2317 if ((BotCand.Reason == RegExcess && !BotCand.isRepeat(RegExcess))
2318 || (BotCand.Reason == RegCritical
2319 && !BotCand.isRepeat(RegCritical)))
2322 tracePick(BotCand, IsTopNode);
2325 // Check if the top Q has a better candidate.
2326 pickNodeFromQueue(Top, DAG->getTopRPTracker(), TopCand);
2327 assert(TopCand.Reason != NoCand && "failed to find the first candidate");
2329 // Choose the queue with the most important (lowest enum) reason.
2330 if (TopCand.Reason < BotCand.Reason) {
2332 tracePick(TopCand, IsTopNode);
2335 // Otherwise prefer the bottom candidate, in node order if all else failed.
2337 tracePick(BotCand, IsTopNode);
2341 /// Pick the best node to balance the schedule. Implements MachineSchedStrategy.
2342 SUnit *ConvergingScheduler::pickNode(bool &IsTopNode) {
2343 if (DAG->top() == DAG->bottom()) {
2344 assert(Top.Available.empty() && Top.Pending.empty() &&
2345 Bot.Available.empty() && Bot.Pending.empty() && "ReadyQ garbage");
2351 SU = Top.pickOnlyChoice();
2353 CandPolicy NoPolicy;
2354 SchedCandidate TopCand(NoPolicy);
2355 pickNodeFromQueue(Top, DAG->getTopRPTracker(), TopCand);
2356 assert(TopCand.Reason != NoCand && "failed to find the first candidate");
2361 else if (ForceBottomUp) {
2362 SU = Bot.pickOnlyChoice();
2364 CandPolicy NoPolicy;
2365 SchedCandidate BotCand(NoPolicy);
2366 pickNodeFromQueue(Bot, DAG->getBotRPTracker(), BotCand);
2367 assert(BotCand.Reason != NoCand && "failed to find the first candidate");
2373 SU = pickNodeBidirectional(IsTopNode);
2375 } while (SU->isScheduled);
2377 if (SU->isTopReady())
2378 Top.removeReady(SU);
2379 if (SU->isBottomReady())
2380 Bot.removeReady(SU);
2382 DEBUG(dbgs() << "Scheduling SU(" << SU->NodeNum << ") " << *SU->getInstr());
2386 void ConvergingScheduler::reschedulePhysRegCopies(SUnit *SU, bool isTop) {
2388 MachineBasicBlock::iterator InsertPos = SU->getInstr();
2391 SmallVectorImpl<SDep> &Deps = isTop ? SU->Preds : SU->Succs;
2393 // Find already scheduled copies with a single physreg dependence and move
2394 // them just above the scheduled instruction.
2395 for (SmallVectorImpl<SDep>::iterator I = Deps.begin(), E = Deps.end();
2397 if (I->getKind() != SDep::Data || !TRI->isPhysicalRegister(I->getReg()))
2399 SUnit *DepSU = I->getSUnit();
2400 if (isTop ? DepSU->Succs.size() > 1 : DepSU->Preds.size() > 1)
2402 MachineInstr *Copy = DepSU->getInstr();
2403 if (!Copy->isCopy())
2405 DEBUG(dbgs() << " Rescheduling physreg copy ";
2406 I->getSUnit()->dump(DAG));
2407 DAG->moveInstruction(Copy, InsertPos);
2411 /// Update the scheduler's state after scheduling a node. This is the same node
2412 /// that was just returned by pickNode(). However, ScheduleDAGMI needs to update
2413 /// it's state based on the current cycle before MachineSchedStrategy does.
2415 /// FIXME: Eventually, we may bundle physreg copies rather than rescheduling
2416 /// them here. See comments in biasPhysRegCopy.
2417 void ConvergingScheduler::schedNode(SUnit *SU, bool IsTopNode) {
2419 SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.CurrCycle);
2421 if (SU->hasPhysRegUses)
2422 reschedulePhysRegCopies(SU, true);
2425 SU->BotReadyCycle = std::max(SU->BotReadyCycle, Bot.CurrCycle);
2427 if (SU->hasPhysRegDefs)
2428 reschedulePhysRegCopies(SU, false);
2432 /// Create the standard converging machine scheduler. This will be used as the
2433 /// default scheduler if the target does not set a default.
2434 static ScheduleDAGInstrs *createConvergingSched(MachineSchedContext *C) {
2435 assert((!ForceTopDown || !ForceBottomUp) &&
2436 "-misched-topdown incompatible with -misched-bottomup");
2437 ScheduleDAGMI *DAG = new ScheduleDAGMI(C, new ConvergingScheduler());
2438 // Register DAG post-processors.
2440 // FIXME: extend the mutation API to allow earlier mutations to instantiate
2441 // data and pass it to later mutations. Have a single mutation that gathers
2442 // the interesting nodes in one pass.
2443 DAG->addMutation(new CopyConstrain(DAG->TII, DAG->TRI));
2444 if (EnableLoadCluster)
2445 DAG->addMutation(new LoadClusterMutation(DAG->TII, DAG->TRI));
2446 if (EnableMacroFusion)
2447 DAG->addMutation(new MacroFusion(DAG->TII));
2450 static MachineSchedRegistry
2451 ConvergingSchedRegistry("converge", "Standard converging scheduler.",
2452 createConvergingSched);
2454 //===----------------------------------------------------------------------===//
2455 // ILP Scheduler. Currently for experimental analysis of heuristics.
2456 //===----------------------------------------------------------------------===//
2459 /// \brief Order nodes by the ILP metric.
2461 const SchedDFSResult *DFSResult;
2462 const BitVector *ScheduledTrees;
2465 ILPOrder(bool MaxILP): DFSResult(0), ScheduledTrees(0), MaximizeILP(MaxILP) {}
2467 /// \brief Apply a less-than relation on node priority.
2469 /// (Return true if A comes after B in the Q.)
2470 bool operator()(const SUnit *A, const SUnit *B) const {
2471 unsigned SchedTreeA = DFSResult->getSubtreeID(A);
2472 unsigned SchedTreeB = DFSResult->getSubtreeID(B);
2473 if (SchedTreeA != SchedTreeB) {
2474 // Unscheduled trees have lower priority.
2475 if (ScheduledTrees->test(SchedTreeA) != ScheduledTrees->test(SchedTreeB))
2476 return ScheduledTrees->test(SchedTreeB);
2478 // Trees with shallower connections have have lower priority.
2479 if (DFSResult->getSubtreeLevel(SchedTreeA)
2480 != DFSResult->getSubtreeLevel(SchedTreeB)) {
2481 return DFSResult->getSubtreeLevel(SchedTreeA)
2482 < DFSResult->getSubtreeLevel(SchedTreeB);
2486 return DFSResult->getILP(A) < DFSResult->getILP(B);
2488 return DFSResult->getILP(A) > DFSResult->getILP(B);
2492 /// \brief Schedule based on the ILP metric.
2493 class ILPScheduler : public MachineSchedStrategy {
2494 /// In case all subtrees are eventually connected to a common root through
2495 /// data dependence (e.g. reduction), place an upper limit on their size.
2497 /// FIXME: A subtree limit is generally good, but in the situation commented
2498 /// above, where multiple similar subtrees feed a common root, we should
2499 /// only split at a point where the resulting subtrees will be balanced.
2500 /// (a motivating test case must be found).
2501 static const unsigned SubtreeLimit = 16;
2506 std::vector<SUnit*> ReadyQ;
2508 ILPScheduler(bool MaximizeILP): DAG(0), Cmp(MaximizeILP) {}
2510 virtual void initialize(ScheduleDAGMI *dag) {
2512 DAG->computeDFSResult();
2513 Cmp.DFSResult = DAG->getDFSResult();
2514 Cmp.ScheduledTrees = &DAG->getScheduledTrees();
2518 virtual void registerRoots() {
2519 // Restore the heap in ReadyQ with the updated DFS results.
2520 std::make_heap(ReadyQ.begin(), ReadyQ.end(), Cmp);
2523 /// Implement MachineSchedStrategy interface.
2524 /// -----------------------------------------
2526 /// Callback to select the highest priority node from the ready Q.
2527 virtual SUnit *pickNode(bool &IsTopNode) {
2528 if (ReadyQ.empty()) return NULL;
2529 std::pop_heap(ReadyQ.begin(), ReadyQ.end(), Cmp);
2530 SUnit *SU = ReadyQ.back();
2533 DEBUG(dbgs() << "Pick node " << "SU(" << SU->NodeNum << ") "
2534 << " ILP: " << DAG->getDFSResult()->getILP(SU)
2535 << " Tree: " << DAG->getDFSResult()->getSubtreeID(SU) << " @"
2536 << DAG->getDFSResult()->getSubtreeLevel(
2537 DAG->getDFSResult()->getSubtreeID(SU)) << '\n'
2538 << "Scheduling " << *SU->getInstr());
2542 /// \brief Scheduler callback to notify that a new subtree is scheduled.
2543 virtual void scheduleTree(unsigned SubtreeID) {
2544 std::make_heap(ReadyQ.begin(), ReadyQ.end(), Cmp);
2547 /// Callback after a node is scheduled. Mark a newly scheduled tree, notify
2548 /// DFSResults, and resort the priority Q.
2549 virtual void schedNode(SUnit *SU, bool IsTopNode) {
2550 assert(!IsTopNode && "SchedDFSResult needs bottom-up");
2553 virtual void releaseTopNode(SUnit *) { /*only called for top roots*/ }
2555 virtual void releaseBottomNode(SUnit *SU) {
2556 ReadyQ.push_back(SU);
2557 std::push_heap(ReadyQ.begin(), ReadyQ.end(), Cmp);
2562 static ScheduleDAGInstrs *createILPMaxScheduler(MachineSchedContext *C) {
2563 return new ScheduleDAGMI(C, new ILPScheduler(true));
2565 static ScheduleDAGInstrs *createILPMinScheduler(MachineSchedContext *C) {
2566 return new ScheduleDAGMI(C, new ILPScheduler(false));
2568 static MachineSchedRegistry ILPMaxRegistry(
2569 "ilpmax", "Schedule bottom-up for max ILP", createILPMaxScheduler);
2570 static MachineSchedRegistry ILPMinRegistry(
2571 "ilpmin", "Schedule bottom-up for min ILP", createILPMinScheduler);
2573 //===----------------------------------------------------------------------===//
2574 // Machine Instruction Shuffler for Correctness Testing
2575 //===----------------------------------------------------------------------===//
2579 /// Apply a less-than relation on the node order, which corresponds to the
2580 /// instruction order prior to scheduling. IsReverse implements greater-than.
2581 template<bool IsReverse>
2583 bool operator()(SUnit *A, SUnit *B) const {
2585 return A->NodeNum > B->NodeNum;
2587 return A->NodeNum < B->NodeNum;
2591 /// Reorder instructions as much as possible.
2592 class InstructionShuffler : public MachineSchedStrategy {
2596 // Using a less-than relation (SUnitOrder<false>) for the TopQ priority
2597 // gives nodes with a higher number higher priority causing the latest
2598 // instructions to be scheduled first.
2599 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<false> >
2601 // When scheduling bottom-up, use greater-than as the queue priority.
2602 PriorityQueue<SUnit*, std::vector<SUnit*>, SUnitOrder<true> >
2605 InstructionShuffler(bool alternate, bool topdown)
2606 : IsAlternating(alternate), IsTopDown(topdown) {}
2608 virtual void initialize(ScheduleDAGMI *) {
2613 /// Implement MachineSchedStrategy interface.
2614 /// -----------------------------------------
2616 virtual SUnit *pickNode(bool &IsTopNode) {
2620 if (TopQ.empty()) return NULL;
2623 } while (SU->isScheduled);
2628 if (BottomQ.empty()) return NULL;
2631 } while (SU->isScheduled);
2635 IsTopDown = !IsTopDown;
2639 virtual void schedNode(SUnit *SU, bool IsTopNode) {}
2641 virtual void releaseTopNode(SUnit *SU) {
2644 virtual void releaseBottomNode(SUnit *SU) {
2650 static ScheduleDAGInstrs *createInstructionShuffler(MachineSchedContext *C) {
2651 bool Alternate = !ForceTopDown && !ForceBottomUp;
2652 bool TopDown = !ForceBottomUp;
2653 assert((TopDown || !ForceTopDown) &&
2654 "-misched-topdown incompatible with -misched-bottomup");
2655 return new ScheduleDAGMI(C, new InstructionShuffler(Alternate, TopDown));
2657 static MachineSchedRegistry ShufflerRegistry(
2658 "shuffle", "Shuffle machine instructions alternating directions",
2659 createInstructionShuffler);
2662 //===----------------------------------------------------------------------===//
2663 // GraphWriter support for ScheduleDAGMI.
2664 //===----------------------------------------------------------------------===//
2669 template<> struct GraphTraits<
2670 ScheduleDAGMI*> : public GraphTraits<ScheduleDAG*> {};
2673 struct DOTGraphTraits<ScheduleDAGMI*> : public DefaultDOTGraphTraits {
2675 DOTGraphTraits (bool isSimple=false) : DefaultDOTGraphTraits(isSimple) {}
2677 static std::string getGraphName(const ScheduleDAG *G) {
2678 return G->MF.getName();
2681 static bool renderGraphFromBottomUp() {
2685 static bool isNodeHidden(const SUnit *Node) {
2686 return (Node->NumPreds > 10 || Node->NumSuccs > 10);
2689 static bool hasNodeAddressLabel(const SUnit *Node,
2690 const ScheduleDAG *Graph) {
2694 /// If you want to override the dot attributes printed for a particular
2695 /// edge, override this method.
2696 static std::string getEdgeAttributes(const SUnit *Node,
2698 const ScheduleDAG *Graph) {
2699 if (EI.isArtificialDep())
2700 return "color=cyan,style=dashed";
2702 return "color=blue,style=dashed";
2706 static std::string getNodeLabel(const SUnit *SU, const ScheduleDAG *G) {
2708 raw_string_ostream SS(Str);
2709 SS << "SU(" << SU->NodeNum << ')';
2712 static std::string getNodeDescription(const SUnit *SU, const ScheduleDAG *G) {
2713 return G->getGraphNodeLabel(SU);
2716 static std::string getNodeAttributes(const SUnit *N,
2717 const ScheduleDAG *Graph) {
2718 std::string Str("shape=Mrecord");
2719 const SchedDFSResult *DFS =
2720 static_cast<const ScheduleDAGMI*>(Graph)->getDFSResult();
2722 Str += ",style=filled,fillcolor=\"#";
2723 Str += DOT::getColorString(DFS->getSubtreeID(N));
2732 /// viewGraph - Pop up a ghostview window with the reachable parts of the DAG
2733 /// rendered using 'dot'.
2735 void ScheduleDAGMI::viewGraph(const Twine &Name, const Twine &Title) {
2737 ViewGraph(this, Name, false, Title);
2739 errs() << "ScheduleDAGMI::viewGraph is only available in debug builds on "
2740 << "systems with Graphviz or gv!\n";
2744 /// Out-of-line implementation with no arguments is handy for gdb.
2745 void ScheduleDAGMI::viewGraph() {
2746 viewGraph(getDAGName(), "Scheduling-Units Graph for " + getDAGName());