1 //===- InstrScheduling.cpp - Generic Instruction Scheduling support -------===//
3 // This file implements the llvm/CodeGen/InstrScheduling.h interface, along with
4 // generic support routines for instruction scheduling.
6 //===----------------------------------------------------------------------===//
8 #include "SchedPriorities.h"
9 #include "llvm/CodeGen/MachineInstr.h"
10 #include "llvm/CodeGen/MachineCodeForInstruction.h"
11 #include "llvm/CodeGen/MachineFunction.h"
12 #include "llvm/CodeGen/FunctionLiveVarInfo.h"
13 #include "llvm/Target/TargetMachine.h"
14 #include "llvm/BasicBlock.h"
15 #include "Support/CommandLine.h"
18 SchedDebugLevel_t SchedDebugLevel;
20 static cl::opt<SchedDebugLevel_t, true>
21 SDL_opt("dsched", cl::Hidden, cl::location(SchedDebugLevel),
22 cl::desc("enable instruction scheduling debugging information"),
24 clEnumValN(Sched_NoDebugInfo, "n", "disable debug output"),
25 clEnumValN(Sched_PrintMachineCode, "y", "print machine code after scheduling"),
26 clEnumValN(Sched_PrintSchedTrace, "t", "print trace of scheduling actions"),
27 clEnumValN(Sched_PrintSchedGraphs, "g", "print scheduling graphs"),
31 //************************* Internal Data Types *****************************/
34 class SchedulingManager;
37 //----------------------------------------------------------------------
40 // Represents a group of instructions scheduled to be issued
42 //----------------------------------------------------------------------
44 class InstrGroup: public NonCopyable {
46 inline const SchedGraphNode* operator[](unsigned int slotNum) const {
47 assert(slotNum < group.size());
48 return group[slotNum];
52 friend class InstrSchedule;
54 inline void addInstr(const SchedGraphNode* node, unsigned int slotNum) {
55 assert(slotNum < group.size());
56 group[slotNum] = node;
59 /*ctor*/ InstrGroup(unsigned int nslots)
60 : group(nslots, NULL) {}
62 /*ctor*/ InstrGroup(); // disable: DO NOT IMPLEMENT
65 std::vector<const SchedGraphNode*> group;
69 //----------------------------------------------------------------------
70 // class ScheduleIterator:
72 // Iterates over the machine instructions in the for a single basic block.
73 // The schedule is represented by an InstrSchedule object.
74 //----------------------------------------------------------------------
76 template<class _NodeType>
77 class ScheduleIterator : public forward_iterator<_NodeType, ptrdiff_t> {
81 const InstrSchedule& S;
83 typedef ScheduleIterator<_NodeType> _Self;
85 /*ctor*/ inline ScheduleIterator(const InstrSchedule& _schedule,
88 : cycleNum(_cycleNum), slotNum(_slotNum), S(_schedule) {
92 /*ctor*/ inline ScheduleIterator(const _Self& x)
93 : cycleNum(x.cycleNum), slotNum(x.slotNum), S(x.S) {}
95 inline bool operator==(const _Self& x) const {
96 return (slotNum == x.slotNum && cycleNum== x.cycleNum && &S==&x.S);
99 inline bool operator!=(const _Self& x) const { return !operator==(x); }
101 inline _NodeType* operator*() const {
102 assert(cycleNum < S.groups.size());
103 return (*S.groups[cycleNum])[slotNum];
105 inline _NodeType* operator->() const { return operator*(); }
107 _Self& operator++(); // Preincrement
108 inline _Self operator++(int) { // Postincrement
109 _Self tmp(*this); ++*this; return tmp;
112 static _Self begin(const InstrSchedule& _schedule);
113 static _Self end( const InstrSchedule& _schedule);
116 inline _Self& operator=(const _Self& x); // DISABLE -- DO NOT IMPLEMENT
117 void skipToNextInstr();
121 //----------------------------------------------------------------------
122 // class InstrSchedule:
124 // Represents the schedule of machine instructions for a single basic block.
125 //----------------------------------------------------------------------
127 class InstrSchedule: public NonCopyable {
129 const unsigned int nslots;
130 unsigned int numInstr;
131 std::vector<InstrGroup*> groups; // indexed by cycle number
132 std::vector<cycles_t> startTime; // indexed by node id
135 typedef ScheduleIterator<SchedGraphNode> iterator;
136 typedef ScheduleIterator<const SchedGraphNode> const_iterator;
139 const_iterator begin() const;
141 const_iterator end() const;
143 public: // constructors and destructor
144 /*ctor*/ InstrSchedule (unsigned int _nslots,
145 unsigned int _numNodes);
146 /*dtor*/ ~InstrSchedule ();
148 public: // accessor functions to query chosen schedule
149 const SchedGraphNode* getInstr (unsigned int slotNum,
151 const InstrGroup* igroup = this->getIGroup(c);
152 return (igroup == NULL)? NULL : (*igroup)[slotNum];
155 inline InstrGroup* getIGroup (cycles_t c) {
156 if ((unsigned)c >= groups.size())
158 if (groups[c] == NULL)
159 groups[c] = new InstrGroup(nslots);
163 inline const InstrGroup* getIGroup (cycles_t c) const {
164 assert((unsigned)c < groups.size());
168 inline cycles_t getStartTime (unsigned int nodeId) const {
169 assert(nodeId < startTime.size());
170 return startTime[nodeId];
173 unsigned int getNumInstructions() const {
177 inline void scheduleInstr (const SchedGraphNode* node,
178 unsigned int slotNum,
180 InstrGroup* igroup = this->getIGroup(cycle);
181 assert((*igroup)[slotNum] == NULL && "Slot already filled?");
182 igroup->addInstr(node, slotNum);
183 assert(node->getNodeId() < startTime.size());
184 startTime[node->getNodeId()] = cycle;
189 friend class iterator;
190 friend class const_iterator;
191 /*ctor*/ InstrSchedule (); // Disable: DO NOT IMPLEMENT.
196 InstrSchedule::InstrSchedule(unsigned int _nslots, unsigned int _numNodes)
199 groups(2 * _numNodes / _nslots), // 2 x lower-bound for #cycles
200 startTime(_numNodes, (cycles_t) -1) // set all to -1
206 InstrSchedule::~InstrSchedule()
208 for (unsigned c=0, NC=groups.size(); c < NC; c++)
209 if (groups[c] != NULL)
210 delete groups[c]; // delete InstrGroup objects
214 template<class _NodeType>
217 ScheduleIterator<_NodeType>::skipToNextInstr()
219 while(cycleNum < S.groups.size() && S.groups[cycleNum] == NULL)
220 ++cycleNum; // skip cycles with no instructions
222 while (cycleNum < S.groups.size() &&
223 (*S.groups[cycleNum])[slotNum] == NULL)
226 if (slotNum == S.nslots) {
229 while(cycleNum < S.groups.size() && S.groups[cycleNum] == NULL)
230 ++cycleNum; // skip cycles with no instructions
235 template<class _NodeType>
237 ScheduleIterator<_NodeType>&
238 ScheduleIterator<_NodeType>::operator++() // Preincrement
241 if (slotNum == S.nslots) {
249 template<class _NodeType>
250 ScheduleIterator<_NodeType>
251 ScheduleIterator<_NodeType>::begin(const InstrSchedule& _schedule)
253 return _Self(_schedule, 0, 0);
256 template<class _NodeType>
257 ScheduleIterator<_NodeType>
258 ScheduleIterator<_NodeType>::end(const InstrSchedule& _schedule)
260 return _Self(_schedule, _schedule.groups.size(), 0);
263 InstrSchedule::iterator
264 InstrSchedule::begin()
266 return iterator::begin(*this);
269 InstrSchedule::const_iterator
270 InstrSchedule::begin() const
272 return const_iterator::begin(*this);
275 InstrSchedule::iterator
278 return iterator::end(*this);
281 InstrSchedule::const_iterator
282 InstrSchedule::end() const
284 return const_iterator::end( *this);
288 //----------------------------------------------------------------------
289 // class DelaySlotInfo:
291 // Record information about delay slots for a single branch instruction.
292 // Delay slots are simply indexed by slot number 1 ... numDelaySlots
293 //----------------------------------------------------------------------
295 class DelaySlotInfo: public NonCopyable {
297 const SchedGraphNode* brNode;
298 unsigned int ndelays;
299 std::vector<const SchedGraphNode*> delayNodeVec;
300 cycles_t delayedNodeCycle;
301 unsigned int delayedNodeSlotNum;
304 /*ctor*/ DelaySlotInfo (const SchedGraphNode* _brNode,
306 : brNode(_brNode), ndelays(_ndelays),
307 delayedNodeCycle(0), delayedNodeSlotNum(0) {}
309 inline unsigned getNumDelays () {
313 inline const std::vector<const SchedGraphNode*>& getDelayNodeVec() {
317 inline void addDelayNode (const SchedGraphNode* node) {
318 delayNodeVec.push_back(node);
319 assert(delayNodeVec.size() <= ndelays && "Too many delay slot instrs!");
322 inline void recordChosenSlot (cycles_t cycle, unsigned slotNum) {
323 delayedNodeCycle = cycle;
324 delayedNodeSlotNum = slotNum;
327 unsigned scheduleDelayedNode (SchedulingManager& S);
331 //----------------------------------------------------------------------
332 // class SchedulingManager:
334 // Represents the schedule of machine instructions for a single basic block.
335 //----------------------------------------------------------------------
337 class SchedulingManager: public NonCopyable {
338 public: // publicly accessible data members
339 const unsigned nslots;
340 const TargetSchedInfo& schedInfo;
341 SchedPriorities& schedPrio;
342 InstrSchedule isched;
345 unsigned int totalInstrCount;
347 cycles_t nextEarliestIssueTime; // next cycle we can issue
349 std::vector<hash_set<const SchedGraphNode*> > choicesForSlot;
350 std::vector<const SchedGraphNode*> choiceVec; // indexed by node ptr
351 std::vector<int> numInClass; // indexed by sched class
352 std::vector<cycles_t> nextEarliestStartTime; // indexed by opCode
353 hash_map<const SchedGraphNode*, DelaySlotInfo*> delaySlotInfoForBranches;
354 // indexed by branch node ptr
357 SchedulingManager(const TargetMachine& _target, const SchedGraph* graph,
358 SchedPriorities& schedPrio);
359 ~SchedulingManager() {
360 for (hash_map<const SchedGraphNode*,
361 DelaySlotInfo*>::iterator I = delaySlotInfoForBranches.begin(),
362 E = delaySlotInfoForBranches.end(); I != E; ++I)
366 //----------------------------------------------------------------------
367 // Simplify access to the machine instruction info
368 //----------------------------------------------------------------------
370 inline const TargetInstrInfo& getInstrInfo () const {
371 return schedInfo.getInstrInfo();
374 //----------------------------------------------------------------------
375 // Interface for checking and updating the current time
376 //----------------------------------------------------------------------
378 inline cycles_t getTime () const {
382 inline cycles_t getEarliestIssueTime() const {
383 return nextEarliestIssueTime;
386 inline cycles_t getEarliestStartTimeForOp(MachineOpCode opCode) const {
387 assert(opCode < (int) nextEarliestStartTime.size());
388 return nextEarliestStartTime[opCode];
391 // Update current time to specified cycle
392 inline void updateTime (cycles_t c) {
394 schedPrio.updateTime(c);
397 //----------------------------------------------------------------------
398 // Functions to manage the choices for the current cycle including:
399 // -- a vector of choices by priority (choiceVec)
400 // -- vectors of the choices for each instruction slot (choicesForSlot[])
401 // -- number of choices in each sched class, used to check issue conflicts
402 // between choices for a single cycle
403 //----------------------------------------------------------------------
405 inline unsigned int getNumChoices () const {
406 return choiceVec.size();
409 inline unsigned getNumChoicesInClass (const InstrSchedClass& sc) const {
410 assert(sc < numInClass.size() && "Invalid op code or sched class!");
411 return numInClass[sc];
414 inline const SchedGraphNode* getChoice(unsigned int i) const {
415 // assert(i < choiceVec.size()); don't check here.
419 inline hash_set<const SchedGraphNode*>& getChoicesForSlot(unsigned slotNum) {
420 assert(slotNum < nslots);
421 return choicesForSlot[slotNum];
424 inline void addChoice (const SchedGraphNode* node) {
425 // Append the instruction to the vector of choices for current cycle.
426 // Increment numInClass[c] for the sched class to which the instr belongs.
427 choiceVec.push_back(node);
428 const InstrSchedClass& sc = schedInfo.getSchedClass(node->getOpCode());
429 assert(sc < numInClass.size());
433 inline void addChoiceToSlot (unsigned int slotNum,
434 const SchedGraphNode* node) {
435 // Add the instruction to the choice set for the specified slot
436 assert(slotNum < nslots);
437 choicesForSlot[slotNum].insert(node);
440 inline void resetChoices () {
442 for (unsigned int s=0; s < nslots; s++)
443 choicesForSlot[s].clear();
444 for (unsigned int c=0; c < numInClass.size(); c++)
448 //----------------------------------------------------------------------
449 // Code to query and manage the partial instruction schedule so far
450 //----------------------------------------------------------------------
452 inline unsigned int getNumScheduled () const {
453 return isched.getNumInstructions();
456 inline unsigned int getNumUnscheduled() const {
457 return totalInstrCount - isched.getNumInstructions();
460 inline bool isScheduled (const SchedGraphNode* node) const {
461 return (isched.getStartTime(node->getNodeId()) >= 0);
464 inline void scheduleInstr (const SchedGraphNode* node,
465 unsigned int slotNum,
468 assert(! isScheduled(node) && "Instruction already scheduled?");
470 // add the instruction to the schedule
471 isched.scheduleInstr(node, slotNum, cycle);
473 // update the earliest start times of all nodes that conflict with `node'
474 // and the next-earliest time anything can issue if `node' causes bubbles
475 updateEarliestStartTimes(node, cycle);
477 // remove the instruction from the choice sets for all slots
478 for (unsigned s=0; s < nslots; s++)
479 choicesForSlot[s].erase(node);
481 // and decrement the instr count for the sched class to which it belongs
482 const InstrSchedClass& sc = schedInfo.getSchedClass(node->getOpCode());
483 assert(sc < numInClass.size());
487 //----------------------------------------------------------------------
488 // Create and retrieve delay slot info for delayed instructions
489 //----------------------------------------------------------------------
491 inline DelaySlotInfo* getDelaySlotInfoForInstr(const SchedGraphNode* bn,
492 bool createIfMissing=false)
494 hash_map<const SchedGraphNode*, DelaySlotInfo*>::const_iterator
495 I = delaySlotInfoForBranches.find(bn);
496 if (I != delaySlotInfoForBranches.end())
499 if (!createIfMissing) return 0;
501 DelaySlotInfo *dinfo =
502 new DelaySlotInfo(bn, getInstrInfo().getNumDelaySlots(bn->getOpCode()));
503 return delaySlotInfoForBranches[bn] = dinfo;
507 SchedulingManager(); // DISABLED: DO NOT IMPLEMENT
508 void updateEarliestStartTimes(const SchedGraphNode* node, cycles_t schedTime);
513 SchedulingManager::SchedulingManager(const TargetMachine& target,
514 const SchedGraph* graph,
515 SchedPriorities& _schedPrio)
516 : nslots(target.getSchedInfo().getMaxNumIssueTotal()),
517 schedInfo(target.getSchedInfo()),
518 schedPrio(_schedPrio),
519 isched(nslots, graph->getNumNodes()),
520 totalInstrCount(graph->getNumNodes() - 2),
521 nextEarliestIssueTime(0),
522 choicesForSlot(nslots),
523 numInClass(target.getSchedInfo().getNumSchedClasses(), 0), // set all to 0
524 nextEarliestStartTime(target.getInstrInfo().getNumRealOpCodes(),
525 (cycles_t) 0) // set all to 0
529 // Note that an upper bound on #choices for each slot is = nslots since
530 // we use this vector to hold a feasible set of instructions, and more
531 // would be infeasible. Reserve that much memory since it is probably small.
532 for (unsigned int i=0; i < nslots; i++)
533 choicesForSlot[i].resize(nslots);
538 SchedulingManager::updateEarliestStartTimes(const SchedGraphNode* node,
541 if (schedInfo.numBubblesAfter(node->getOpCode()) > 0)
542 { // Update next earliest time before which *nothing* can issue.
543 nextEarliestIssueTime = std::max(nextEarliestIssueTime,
544 curTime + 1 + schedInfo.numBubblesAfter(node->getOpCode()));
547 const std::vector<MachineOpCode>&
548 conflictVec = schedInfo.getConflictList(node->getOpCode());
550 for (unsigned i=0; i < conflictVec.size(); i++)
552 MachineOpCode toOp = conflictVec[i];
553 cycles_t est=schedTime + schedInfo.getMinIssueGap(node->getOpCode(),toOp);
554 assert(toOp < (int) nextEarliestStartTime.size());
555 if (nextEarliestStartTime[toOp] < est)
556 nextEarliestStartTime[toOp] = est;
560 //************************* Internal Functions *****************************/
564 AssignInstructionsToSlots(class SchedulingManager& S, unsigned maxIssue)
566 // find the slot to start from, in the current cycle
567 unsigned int startSlot = 0;
568 cycles_t curTime = S.getTime();
570 assert(maxIssue > 0 && maxIssue <= S.nslots - startSlot);
572 // If only one instruction can be issued, do so.
574 for (unsigned s=startSlot; s < S.nslots; s++)
575 if (S.getChoicesForSlot(s).size() > 0) {
576 // found the one instruction
577 S.scheduleInstr(*S.getChoicesForSlot(s).begin(), s, curTime);
581 // Otherwise, choose from the choices for each slot
583 InstrGroup* igroup = S.isched.getIGroup(S.getTime());
584 assert(igroup != NULL && "Group creation failed?");
586 // Find a slot that has only a single choice, and take it.
587 // If all slots have 0 or multiple choices, pick the first slot with
588 // choices and use its last instruction (just to avoid shifting the vector).
590 for (numIssued = 0; numIssued < maxIssue; numIssued++) {
592 for (unsigned s=startSlot; s < S.nslots; s++)
593 if ((*igroup)[s] == NULL && S.getChoicesForSlot(s).size() == 1) {
594 chosenSlot = (int) s;
598 if (chosenSlot == -1)
599 for (unsigned s=startSlot; s < S.nslots; s++)
600 if ((*igroup)[s] == NULL && S.getChoicesForSlot(s).size() > 0) {
601 chosenSlot = (int) s;
605 if (chosenSlot != -1) {
606 // Insert the chosen instr in the chosen slot and
607 // erase it from all slots.
608 const SchedGraphNode* node= *S.getChoicesForSlot(chosenSlot).begin();
609 S.scheduleInstr(node, chosenSlot, curTime);
613 assert(numIssued > 0 && "Should not happen when maxIssue > 0!");
618 // For now, just assume we are scheduling within a single basic block.
619 // Get the machine instruction vector for the basic block and clear it,
620 // then append instructions in scheduled order.
621 // Also, re-insert the dummy PHI instructions that were at the beginning
622 // of the basic block, since they are not part of the schedule.
625 RecordSchedule(MachineBasicBlock &MBB, const SchedulingManager& S)
627 const TargetInstrInfo& mii = S.schedInfo.getInstrInfo();
630 // Lets make sure we didn't lose any instructions, except possibly
631 // some NOPs from delay slots. Also, PHIs are not included in the schedule.
632 unsigned numInstr = 0;
633 for (MachineBasicBlock::iterator I=MBB.begin(); I != MBB.end(); ++I)
634 if (! mii.isNop((*I)->getOpCode()) &&
635 ! mii.isDummyPhiInstr((*I)->getOpCode()))
637 assert(S.isched.getNumInstructions() >= numInstr &&
638 "Lost some non-NOP instructions during scheduling!");
641 if (S.isched.getNumInstructions() == 0)
642 return; // empty basic block!
644 // First find the dummy instructions at the start of the basic block
645 MachineBasicBlock::iterator I = MBB.begin();
646 for ( ; I != MBB.end(); ++I)
647 if (! mii.isDummyPhiInstr((*I)->getOpCode()))
650 // Erase all except the dummy PHI instructions from MBB, and
651 // pre-allocate create space for the ones we will put back in.
652 MBB.erase(I, MBB.end());
654 InstrSchedule::const_iterator NIend = S.isched.end();
655 for (InstrSchedule::const_iterator NI = S.isched.begin(); NI != NIend; ++NI)
656 MBB.push_back(const_cast<MachineInstr*>((*NI)->getMachineInstr()));
662 MarkSuccessorsReady(SchedulingManager& S, const SchedGraphNode* node)
664 // Check if any successors are now ready that were not already marked
665 // ready before, and that have not yet been scheduled.
667 for (sg_succ_const_iterator SI = succ_begin(node); SI !=succ_end(node); ++SI)
668 if (! (*SI)->isDummyNode()
669 && ! S.isScheduled(*SI)
670 && ! S.schedPrio.nodeIsReady(*SI))
672 // successor not scheduled and not marked ready; check *its* preds.
674 bool succIsReady = true;
675 for (sg_pred_const_iterator P=pred_begin(*SI); P != pred_end(*SI); ++P)
676 if (! (*P)->isDummyNode() && ! S.isScheduled(*P)) {
681 if (succIsReady) // add the successor to the ready list
682 S.schedPrio.insertReady(*SI);
687 // Choose up to `nslots' FEASIBLE instructions and assign each
688 // instruction to all possible slots that do not violate feasibility.
689 // FEASIBLE means it should be guaranteed that the set
690 // of chosen instructions can be issued in a single group.
693 // maxIssue : total number of feasible instructions
694 // S.choicesForSlot[i=0..nslots] : set of instructions feasible in slot i
697 FindSlotChoices(SchedulingManager& S,
698 DelaySlotInfo*& getDelaySlotInfo)
700 // initialize result vectors to empty
703 // find the slot to start from, in the current cycle
704 unsigned int startSlot = 0;
705 InstrGroup* igroup = S.isched.getIGroup(S.getTime());
706 for (int s = S.nslots - 1; s >= 0; s--)
707 if ((*igroup)[s] != NULL) {
712 // Make sure we pick at most one instruction that would break the group.
713 // Also, if we do pick one, remember which it was.
714 unsigned int indexForBreakingNode = S.nslots;
715 unsigned int indexForDelayedInstr = S.nslots;
716 DelaySlotInfo* delaySlotInfo = NULL;
718 getDelaySlotInfo = NULL;
720 // Choose instructions in order of priority.
721 // Add choices to the choice vector in the SchedulingManager class as
722 // we choose them so that subsequent choices will be correctly tested
723 // for feasibility, w.r.t. higher priority choices for the same cycle.
725 while (S.getNumChoices() < S.nslots - startSlot) {
726 const SchedGraphNode* nextNode=S.schedPrio.getNextHighest(S,S.getTime());
727 if (nextNode == NULL)
728 break; // no more instructions for this cycle
730 if (S.getInstrInfo().getNumDelaySlots(nextNode->getOpCode()) > 0) {
731 delaySlotInfo = S.getDelaySlotInfoForInstr(nextNode);
732 if (delaySlotInfo != NULL) {
733 if (indexForBreakingNode < S.nslots)
734 // cannot issue a delayed instr in the same cycle as one
735 // that breaks the issue group or as another delayed instr
738 indexForDelayedInstr = S.getNumChoices();
740 } else if (S.schedInfo.breaksIssueGroup(nextNode->getOpCode())) {
741 if (indexForBreakingNode < S.nslots)
742 // have a breaking instruction already so throw this one away
745 indexForBreakingNode = S.getNumChoices();
748 if (nextNode != NULL) {
749 S.addChoice(nextNode);
751 if (S.schedInfo.isSingleIssue(nextNode->getOpCode())) {
752 assert(S.getNumChoices() == 1 &&
753 "Prioritizer returned invalid instr for this cycle!");
758 if (indexForDelayedInstr < S.nslots)
759 break; // leave the rest for delay slots
762 assert(S.getNumChoices() <= S.nslots);
763 assert(! (indexForDelayedInstr < S.nslots &&
764 indexForBreakingNode < S.nslots) && "Cannot have both in a cycle");
766 // Assign each chosen instruction to all possible slots for that instr.
767 // But if only one instruction was chosen, put it only in the first
768 // feasible slot; no more analysis will be needed.
770 if (indexForDelayedInstr >= S.nslots &&
771 indexForBreakingNode >= S.nslots)
772 { // No instructions that break the issue group or that have delay slots.
773 // This is the common case, so handle it separately for efficiency.
775 if (S.getNumChoices() == 1) {
776 MachineOpCode opCode = S.getChoice(0)->getOpCode();
778 for (s=startSlot; s < S.nslots; s++)
779 if (S.schedInfo.instrCanUseSlot(opCode, s))
781 assert(s < S.nslots && "No feasible slot for this opCode?");
782 S.addChoiceToSlot(s, S.getChoice(0));
784 for (unsigned i=0; i < S.getNumChoices(); i++) {
785 MachineOpCode opCode = S.getChoice(i)->getOpCode();
786 for (unsigned int s=startSlot; s < S.nslots; s++)
787 if (S.schedInfo.instrCanUseSlot(opCode, s))
788 S.addChoiceToSlot(s, S.getChoice(i));
791 } else if (indexForDelayedInstr < S.nslots) {
792 // There is an instruction that needs delay slots.
793 // Try to assign that instruction to a higher slot than any other
794 // instructions in the group, so that its delay slots can go
798 assert(indexForDelayedInstr == S.getNumChoices() - 1 &&
799 "Instruction with delay slots should be last choice!");
800 assert(delaySlotInfo != NULL && "No delay slot info for instr?");
802 const SchedGraphNode* delayedNode = S.getChoice(indexForDelayedInstr);
803 MachineOpCode delayOpCode = delayedNode->getOpCode();
804 unsigned ndelays= S.getInstrInfo().getNumDelaySlots(delayOpCode);
806 unsigned delayedNodeSlot = S.nslots;
809 // Find the last possible slot for the delayed instruction that leaves
810 // at least `d' slots vacant after it (d = #delay slots)
811 for (int s = S.nslots-ndelays-1; s >= (int) startSlot; s--)
812 if (S.schedInfo.instrCanUseSlot(delayOpCode, s)) {
817 highestSlotUsed = -1;
818 for (unsigned i=0; i < S.getNumChoices() - 1; i++) {
819 // Try to assign every other instruction to a lower numbered
820 // slot than delayedNodeSlot.
821 MachineOpCode opCode =S.getChoice(i)->getOpCode();
822 bool noSlotFound = true;
824 for (s=startSlot; s < delayedNodeSlot; s++)
825 if (S.schedInfo.instrCanUseSlot(opCode, s)) {
826 S.addChoiceToSlot(s, S.getChoice(i));
830 // No slot before `delayedNodeSlot' was found for this opCode
831 // Use a later slot, and allow some delay slots to fall in
834 for ( ; s < S.nslots; s++)
835 if (S.schedInfo.instrCanUseSlot(opCode, s)) {
836 S.addChoiceToSlot(s, S.getChoice(i));
840 assert(s < S.nslots && "No feasible slot for instruction?");
842 highestSlotUsed = std::max(highestSlotUsed, (int) s);
845 assert(highestSlotUsed <= (int) S.nslots-1 && "Invalid slot used?");
847 // We will put the delayed node in the first slot after the
848 // highest slot used. But we just mark that for now, and
849 // schedule it separately because we want to schedule the delay
850 // slots for the node at the same time.
851 cycles_t dcycle = S.getTime();
852 unsigned int dslot = highestSlotUsed + 1;
853 if (dslot == S.nslots) {
857 delaySlotInfo->recordChosenSlot(dcycle, dslot);
858 getDelaySlotInfo = delaySlotInfo;
860 // There is an instruction that breaks the issue group.
861 // For such an instruction, assign to the last possible slot in
862 // the current group, and then don't assign any other instructions
864 assert(indexForBreakingNode < S.nslots);
865 const SchedGraphNode* breakingNode=S.getChoice(indexForBreakingNode);
866 unsigned breakingSlot = INT_MAX;
867 unsigned int nslotsToUse = S.nslots;
869 // Find the last possible slot for this instruction.
870 for (int s = S.nslots-1; s >= (int) startSlot; s--)
871 if (S.schedInfo.instrCanUseSlot(breakingNode->getOpCode(), s)) {
875 assert(breakingSlot < S.nslots &&
876 "No feasible slot for `breakingNode'?");
878 // Higher priority instructions than the one that breaks the group:
879 // These can be assigned to all slots, but will be assigned only
880 // to earlier slots if possible.
882 i < S.getNumChoices() && i < indexForBreakingNode; i++)
884 MachineOpCode opCode =S.getChoice(i)->getOpCode();
886 // If a higher priority instruction cannot be assigned to
887 // any earlier slots, don't schedule the breaking instruction.
889 bool foundLowerSlot = false;
890 nslotsToUse = S.nslots; // May be modified in the loop
891 for (unsigned int s=startSlot; s < nslotsToUse; s++)
892 if (S.schedInfo.instrCanUseSlot(opCode, s)) {
893 if (breakingSlot < S.nslots && s < breakingSlot) {
894 foundLowerSlot = true;
895 nslotsToUse = breakingSlot; // RESETS LOOP UPPER BOUND!
898 S.addChoiceToSlot(s, S.getChoice(i));
902 breakingSlot = INT_MAX; // disable breaking instr
905 // Assign the breaking instruction (if any) to a single slot
906 // Otherwise, just ignore the instruction. It will simply be
907 // scheduled in a later cycle.
908 if (breakingSlot < S.nslots) {
909 S.addChoiceToSlot(breakingSlot, breakingNode);
910 nslotsToUse = breakingSlot;
912 nslotsToUse = S.nslots;
914 // For lower priority instructions than the one that breaks the
915 // group, only assign them to slots lower than the breaking slot.
916 // Otherwise, just ignore the instruction.
917 for (unsigned i=indexForBreakingNode+1; i < S.getNumChoices(); i++) {
918 MachineOpCode opCode = S.getChoice(i)->getOpCode();
919 for (unsigned int s=startSlot; s < nslotsToUse; s++)
920 if (S.schedInfo.instrCanUseSlot(opCode, s))
921 S.addChoiceToSlot(s, S.getChoice(i));
923 } // endif (no delay slots and no breaking slots)
925 return S.getNumChoices();
930 ChooseOneGroup(SchedulingManager& S)
932 assert(S.schedPrio.getNumReady() > 0
933 && "Don't get here without ready instructions.");
935 cycles_t firstCycle = S.getTime();
936 DelaySlotInfo* getDelaySlotInfo = NULL;
938 // Choose up to `nslots' feasible instructions and their possible slots.
939 unsigned numIssued = FindSlotChoices(S, getDelaySlotInfo);
941 while (numIssued == 0) {
942 S.updateTime(S.getTime()+1);
943 numIssued = FindSlotChoices(S, getDelaySlotInfo);
946 AssignInstructionsToSlots(S, numIssued);
948 if (getDelaySlotInfo != NULL)
949 numIssued += getDelaySlotInfo->scheduleDelayedNode(S);
951 // Print trace of scheduled instructions before newly ready ones
952 if (SchedDebugLevel >= Sched_PrintSchedTrace) {
953 for (cycles_t c = firstCycle; c <= S.getTime(); c++) {
954 std::cerr << " Cycle " << (long)c <<" : Scheduled instructions:\n";
955 const InstrGroup* igroup = S.isched.getIGroup(c);
956 for (unsigned int s=0; s < S.nslots; s++) {
958 if ((*igroup)[s] != NULL)
959 std::cerr << * ((*igroup)[s])->getMachineInstr() << "\n";
961 std::cerr << "<none>\n";
971 ForwardListSchedule(SchedulingManager& S)
974 const SchedGraphNode* node;
976 S.schedPrio.initialize();
978 while ((N = S.schedPrio.getNumReady()) > 0) {
979 cycles_t nextCycle = S.getTime();
981 // Choose one group of instructions for a cycle, plus any delay slot
982 // instructions (which may overflow into successive cycles).
983 // This will advance S.getTime() to the last cycle in which
984 // instructions are actually issued.
986 unsigned numIssued = ChooseOneGroup(S);
987 assert(numIssued > 0 && "Deadlock in list scheduling algorithm?");
989 // Notify the priority manager of scheduled instructions and mark
990 // any successors that may now be ready
992 for (cycles_t c = nextCycle; c <= S.getTime(); c++) {
993 const InstrGroup* igroup = S.isched.getIGroup(c);
994 for (unsigned int s=0; s < S.nslots; s++)
995 if ((node = (*igroup)[s]) != NULL) {
996 S.schedPrio.issuedReadyNodeAt(S.getTime(), node);
997 MarkSuccessorsReady(S, node);
1001 // Move to the next the next earliest cycle for which
1002 // an instruction can be issued, or the next earliest in which
1003 // one will be ready, or to the next cycle, whichever is latest.
1005 S.updateTime(std::max(S.getTime() + 1,
1006 std::max(S.getEarliestIssueTime(),
1007 S.schedPrio.getEarliestReadyTime())));
1012 //---------------------------------------------------------------------
1013 // Code for filling delay slots for delayed terminator instructions
1014 // (e.g., BRANCH and RETURN). Delay slots for non-terminator
1015 // instructions (e.g., CALL) are not handled here because they almost
1016 // always can be filled with instructions from the call sequence code
1017 // before a call. That's preferable because we incur many tradeoffs here
1018 // when we cannot find single-cycle instructions that can be reordered.
1019 //----------------------------------------------------------------------
1022 NodeCanFillDelaySlot(const SchedulingManager& S,
1023 const SchedGraphNode* node,
1024 const SchedGraphNode* brNode,
1025 bool nodeIsPredecessor)
1027 assert(! node->isDummyNode());
1029 // don't put a branch in the delay slot of another branch
1030 if (S.getInstrInfo().isBranch(node->getOpCode()))
1033 // don't put a single-issue instruction in the delay slot of a branch
1034 if (S.schedInfo.isSingleIssue(node->getOpCode()))
1037 // don't put a load-use dependence in the delay slot of a branch
1038 const TargetInstrInfo& mii = S.getInstrInfo();
1040 for (SchedGraphNode::const_iterator EI = node->beginInEdges();
1041 EI != node->endInEdges(); ++EI)
1042 if (! (*EI)->getSrc()->isDummyNode()
1043 && mii.isLoad((*EI)->getSrc()->getOpCode())
1044 && (*EI)->getDepType() == SchedGraphEdge::CtrlDep)
1047 // for now, don't put an instruction that does not have operand
1048 // interlocks in the delay slot of a branch
1049 if (! S.getInstrInfo().hasOperandInterlock(node->getOpCode()))
1052 // Finally, if the instruction preceeds the branch, we make sure the
1053 // instruction can be reordered relative to the branch. We simply check
1054 // if the instr. has only 1 outgoing edge, viz., a CD edge to the branch.
1056 if (nodeIsPredecessor) {
1057 bool onlyCDEdgeToBranch = true;
1058 for (SchedGraphNode::const_iterator OEI = node->beginOutEdges();
1059 OEI != node->endOutEdges(); ++OEI)
1060 if (! (*OEI)->getSink()->isDummyNode()
1061 && ((*OEI)->getSink() != brNode
1062 || (*OEI)->getDepType() != SchedGraphEdge::CtrlDep))
1064 onlyCDEdgeToBranch = false;
1068 if (!onlyCDEdgeToBranch)
1077 MarkNodeForDelaySlot(SchedulingManager& S,
1079 SchedGraphNode* node,
1080 const SchedGraphNode* brNode,
1081 bool nodeIsPredecessor)
1083 if (nodeIsPredecessor) {
1084 // If node is in the same basic block (i.e., preceeds brNode),
1085 // remove it and all its incident edges from the graph. Make sure we
1086 // add dummy edges for pred/succ nodes that become entry/exit nodes.
1087 graph->eraseIncidentEdges(node, /*addDummyEdges*/ true);
1089 // If the node was from a target block, add the node to the graph
1090 // and add a CD edge from brNode to node.
1091 assert(0 && "NOT IMPLEMENTED YET");
1094 DelaySlotInfo* dinfo = S.getDelaySlotInfoForInstr(brNode, /*create*/ true);
1095 dinfo->addDelayNode(node);
1100 FindUsefulInstructionsForDelaySlots(SchedulingManager& S,
1101 SchedGraphNode* brNode,
1102 std::vector<SchedGraphNode*>& sdelayNodeVec)
1104 const TargetInstrInfo& mii = S.getInstrInfo();
1106 mii.getNumDelaySlots(brNode->getOpCode());
1111 sdelayNodeVec.reserve(ndelays);
1113 // Use a separate vector to hold the feasible multi-cycle nodes.
1114 // These will be used if not enough single-cycle nodes are found.
1116 std::vector<SchedGraphNode*> mdelayNodeVec;
1118 for (sg_pred_iterator P = pred_begin(brNode);
1119 P != pred_end(brNode) && sdelayNodeVec.size() < ndelays; ++P)
1120 if (! (*P)->isDummyNode() &&
1121 ! mii.isNop((*P)->getOpCode()) &&
1122 NodeCanFillDelaySlot(S, *P, brNode, /*pred*/ true))
1124 if (mii.maxLatency((*P)->getOpCode()) > 1)
1125 mdelayNodeVec.push_back(*P);
1127 sdelayNodeVec.push_back(*P);
1130 // If not enough single-cycle instructions were found, select the
1131 // lowest-latency multi-cycle instructions and use them.
1132 // Note that this is the most efficient code when only 1 (or even 2)
1133 // values need to be selected.
1135 while (sdelayNodeVec.size() < ndelays && mdelayNodeVec.size() > 0) {
1137 mii.maxLatency(mdelayNodeVec[0]->getOpCode());
1138 unsigned minIndex = 0;
1139 for (unsigned i=1; i < mdelayNodeVec.size(); i++)
1142 mii.maxLatency(mdelayNodeVec[i]->getOpCode());
1149 sdelayNodeVec.push_back(mdelayNodeVec[minIndex]);
1150 if (sdelayNodeVec.size() < ndelays) // avoid the last erase!
1151 mdelayNodeVec.erase(mdelayNodeVec.begin() + minIndex);
1156 // Remove the NOPs currently in delay slots from the graph.
1157 // Mark instructions specified in sdelayNodeVec to replace them.
1158 // If not enough useful instructions were found, mark the NOPs to be used
1159 // for filling delay slots, otherwise, otherwise just discard them.
1161 static void ReplaceNopsWithUsefulInstr(SchedulingManager& S,
1162 SchedGraphNode* node,
1163 // FIXME: passing vector BY VALUE!!!
1164 std::vector<SchedGraphNode*> sdelayNodeVec,
1167 std::vector<SchedGraphNode*> nopNodeVec; // this will hold unused NOPs
1168 const TargetInstrInfo& mii = S.getInstrInfo();
1169 const MachineInstr* brInstr = node->getMachineInstr();
1170 unsigned ndelays= mii.getNumDelaySlots(brInstr->getOpCode());
1171 assert(ndelays > 0 && "Unnecessary call to replace NOPs");
1173 // Remove the NOPs currently in delay slots from the graph.
1174 // If not enough useful instructions were found, use the NOPs to
1175 // fill delay slots, otherwise, just discard them.
1177 unsigned int firstDelaySlotIdx = node->getOrigIndexInBB() + 1;
1178 MachineBasicBlock& MBB = node->getMachineBasicBlock();
1179 assert(MBB[firstDelaySlotIdx - 1] == brInstr &&
1180 "Incorrect instr. index in basic block for brInstr");
1182 // First find all useful instructions already in the delay slots
1183 // and USE THEM. We'll throw away the unused alternatives below
1185 for (unsigned i=firstDelaySlotIdx; i < firstDelaySlotIdx + ndelays; ++i)
1186 if (! mii.isNop(MBB[i]->getOpCode()))
1187 sdelayNodeVec.insert(sdelayNodeVec.begin(),
1188 graph->getGraphNodeForInstr(MBB[i]));
1190 // Then find the NOPs and keep only as many as are needed.
1191 // Put the rest in nopNodeVec to be deleted.
1192 for (unsigned i=firstDelaySlotIdx; i < firstDelaySlotIdx + ndelays; ++i)
1193 if (mii.isNop(MBB[i]->getOpCode()))
1194 if (sdelayNodeVec.size() < ndelays)
1195 sdelayNodeVec.push_back(graph->getGraphNodeForInstr(MBB[i]));
1197 nopNodeVec.push_back(graph->getGraphNodeForInstr(MBB[i]));
1199 //remove the MI from the Machine Code For Instruction
1200 const TerminatorInst *TI = MBB.getBasicBlock()->getTerminator();
1201 MachineCodeForInstruction& llvmMvec =
1202 MachineCodeForInstruction::get((const Instruction *)TI);
1204 for(MachineCodeForInstruction::iterator mciI=llvmMvec.begin(),
1205 mciE=llvmMvec.end(); mciI!=mciE; ++mciI){
1207 llvmMvec.erase(mciI);
1211 assert(sdelayNodeVec.size() >= ndelays);
1213 // If some delay slots were already filled, throw away that many new choices
1214 if (sdelayNodeVec.size() > ndelays)
1215 sdelayNodeVec.resize(ndelays);
1217 // Mark the nodes chosen for delay slots. This removes them from the graph.
1218 for (unsigned i=0; i < sdelayNodeVec.size(); i++)
1219 MarkNodeForDelaySlot(S, graph, sdelayNodeVec[i], node, true);
1221 // And remove the unused NOPs from the graph.
1222 for (unsigned i=0; i < nopNodeVec.size(); i++)
1223 graph->eraseIncidentEdges(nopNodeVec[i], /*addDummyEdges*/ true);
1227 // For all delayed instructions, choose instructions to put in the delay
1228 // slots and pull those out of the graph. Mark them for the delay slots
1229 // in the DelaySlotInfo object for that graph node. If no useful work
1230 // is found for a delay slot, use the NOP that is currently in that slot.
1232 // We try to fill the delay slots with useful work for all instructions
1233 // EXCEPT CALLS AND RETURNS.
1234 // For CALLs and RETURNs, it is nearly always possible to use one of the
1235 // call sequence instrs and putting anything else in the delay slot could be
1236 // suboptimal. Also, it complicates generating the calling sequence code in
1240 ChooseInstructionsForDelaySlots(SchedulingManager& S, MachineBasicBlock &MBB,
1243 const TargetInstrInfo& mii = S.getInstrInfo();
1245 Instruction *termInstr = (Instruction*)MBB.getBasicBlock()->getTerminator();
1246 MachineCodeForInstruction &termMvec=MachineCodeForInstruction::get(termInstr);
1247 std::vector<SchedGraphNode*> delayNodeVec;
1248 const MachineInstr* brInstr = NULL;
1250 if (termInstr->getOpcode() != Instruction::Ret)
1252 // To find instructions that need delay slots without searching the full
1253 // machine code, we assume that the only delayed instructions are CALLs
1254 // or instructions generated for the terminator inst.
1255 // Find the first branch instr in the sequence of machine instrs for term
1258 while (first < termMvec.size() &&
1259 ! mii.isBranch(termMvec[first]->getOpCode()))
1263 assert(first < termMvec.size() &&
1264 "No branch instructions for BR? Ok, but weird! Delete assertion.");
1266 brInstr = (first < termMvec.size())? termMvec[first] : NULL;
1268 // Compute a vector of the nodes chosen for delay slots and then
1269 // mark delay slots to replace NOPs with these useful instructions.
1271 if (brInstr != NULL) {
1272 SchedGraphNode* brNode = graph->getGraphNodeForInstr(brInstr);
1273 FindUsefulInstructionsForDelaySlots(S, brNode, delayNodeVec);
1274 ReplaceNopsWithUsefulInstr(S, brNode, delayNodeVec, graph);
1278 // Also mark delay slots for other delayed instructions to hold NOPs.
1279 // Simply passing in an empty delayNodeVec will have this effect.
1281 delayNodeVec.clear();
1282 for (unsigned i=0; i < MBB.size(); ++i)
1283 if (MBB[i] != brInstr &&
1284 mii.getNumDelaySlots(MBB[i]->getOpCode()) > 0)
1286 SchedGraphNode* node = graph->getGraphNodeForInstr(MBB[i]);
1287 ReplaceNopsWithUsefulInstr(S, node, delayNodeVec, graph);
1293 // Schedule the delayed branch and its delay slots
1296 DelaySlotInfo::scheduleDelayedNode(SchedulingManager& S)
1298 assert(delayedNodeSlotNum < S.nslots && "Illegal slot for branch");
1299 assert(S.isched.getInstr(delayedNodeSlotNum, delayedNodeCycle) == NULL
1300 && "Slot for branch should be empty");
1302 unsigned int nextSlot = delayedNodeSlotNum;
1303 cycles_t nextTime = delayedNodeCycle;
1305 S.scheduleInstr(brNode, nextSlot, nextTime);
1307 for (unsigned d=0; d < ndelays; d++) {
1309 if (nextSlot == S.nslots) {
1314 // Find the first feasible instruction for this delay slot
1315 // Note that we only check for issue restrictions here.
1316 // We do *not* check for flow dependences but rely on pipeline
1317 // interlocks to resolve them. Machines without interlocks
1318 // will require this code to be modified.
1319 for (unsigned i=0; i < delayNodeVec.size(); i++) {
1320 const SchedGraphNode* dnode = delayNodeVec[i];
1321 if ( ! S.isScheduled(dnode)
1322 && S.schedInfo.instrCanUseSlot(dnode->getOpCode(), nextSlot)
1323 && instrIsFeasible(S, dnode->getOpCode()))
1325 assert(S.getInstrInfo().hasOperandInterlock(dnode->getOpCode())
1326 && "Instructions without interlocks not yet supported "
1327 "when filling branch delay slots");
1328 S.scheduleInstr(dnode, nextSlot, nextTime);
1334 // Update current time if delay slots overflowed into later cycles.
1335 // Do this here because we know exactly which cycle is the last cycle
1336 // that contains delay slots. The next loop doesn't compute that.
1337 if (nextTime > S.getTime())
1338 S.updateTime(nextTime);
1340 // Now put any remaining instructions in the unfilled delay slots.
1341 // This could lead to suboptimal performance but needed for correctness.
1342 nextSlot = delayedNodeSlotNum;
1343 nextTime = delayedNodeCycle;
1344 for (unsigned i=0; i < delayNodeVec.size(); i++)
1345 if (! S.isScheduled(delayNodeVec[i])) {
1346 do { // find the next empty slot
1348 if (nextSlot == S.nslots) {
1352 } while (S.isched.getInstr(nextSlot, nextTime) != NULL);
1354 S.scheduleInstr(delayNodeVec[i], nextSlot, nextTime);
1362 // Check if the instruction would conflict with instructions already
1363 // chosen for the current cycle
1366 ConflictsWithChoices(const SchedulingManager& S,
1367 MachineOpCode opCode)
1369 // Check if the instruction must issue by itself, and some feasible
1370 // choices have already been made for this cycle
1371 if (S.getNumChoices() > 0 && S.schedInfo.isSingleIssue(opCode))
1374 // For each class that opCode belongs to, check if there are too many
1375 // instructions of that class.
1377 const InstrSchedClass sc = S.schedInfo.getSchedClass(opCode);
1378 return (S.getNumChoicesInClass(sc) == S.schedInfo.getMaxIssueForClass(sc));
1382 //************************* External Functions *****************************/
1385 //---------------------------------------------------------------------------
1386 // Function: ViolatesMinimumGap
1389 // Check minimum gap requirements relative to instructions scheduled in
1391 // Note that we do not need to consider `nextEarliestIssueTime' here because
1392 // that is also captured in the earliest start times for each opcode.
1393 //---------------------------------------------------------------------------
1396 ViolatesMinimumGap(const SchedulingManager& S,
1397 MachineOpCode opCode,
1398 const cycles_t inCycle)
1400 return (inCycle < S.getEarliestStartTimeForOp(opCode));
1404 //---------------------------------------------------------------------------
1405 // Function: instrIsFeasible
1408 // Check if any issue restrictions would prevent the instruction from
1409 // being issued in the current cycle
1410 //---------------------------------------------------------------------------
1413 instrIsFeasible(const SchedulingManager& S,
1414 MachineOpCode opCode)
1416 // skip the instruction if it cannot be issued due to issue restrictions
1417 // caused by previously issued instructions
1418 if (ViolatesMinimumGap(S, opCode, S.getTime()))
1421 // skip the instruction if it cannot be issued due to issue restrictions
1422 // caused by previously chosen instructions for the current cycle
1423 if (ConflictsWithChoices(S, opCode))
1429 //---------------------------------------------------------------------------
1430 // Function: ScheduleInstructionsWithSSA
1433 // Entry point for instruction scheduling on SSA form.
1434 // Schedules the machine instructions generated by instruction selection.
1435 // Assumes that register allocation has not been done, i.e., operands
1436 // are still in SSA form.
1437 //---------------------------------------------------------------------------
1440 class InstructionSchedulingWithSSA : public FunctionPass {
1441 const TargetMachine ⌖
1443 inline InstructionSchedulingWithSSA(const TargetMachine &T) : target(T) {}
1445 const char *getPassName() const { return "Instruction Scheduling"; }
1447 // getAnalysisUsage - We use LiveVarInfo...
1448 virtual void getAnalysisUsage(AnalysisUsage &AU) const {
1449 AU.addRequired<FunctionLiveVarInfo>();
1450 AU.setPreservesCFG();
1453 bool runOnFunction(Function &F);
1455 } // end anonymous namespace
1458 bool InstructionSchedulingWithSSA::runOnFunction(Function &F)
1460 SchedGraphSet graphSet(&F, target);
1462 if (SchedDebugLevel >= Sched_PrintSchedGraphs) {
1463 std::cerr << "\n*** SCHEDULING GRAPHS FOR INSTRUCTION SCHEDULING\n";
1467 for (SchedGraphSet::const_iterator GI=graphSet.begin(), GE=graphSet.end();
1470 SchedGraph* graph = (*GI);
1471 MachineBasicBlock &MBB = graph->getBasicBlock();
1473 if (SchedDebugLevel >= Sched_PrintSchedTrace)
1474 std::cerr << "\n*** TRACE OF INSTRUCTION SCHEDULING OPERATIONS\n\n";
1477 SchedPriorities schedPrio(&F, graph, getAnalysis<FunctionLiveVarInfo>());
1478 SchedulingManager S(target, graph, schedPrio);
1480 ChooseInstructionsForDelaySlots(S, MBB, graph); // modifies graph
1481 ForwardListSchedule(S); // computes schedule in S
1482 RecordSchedule(MBB, S); // records schedule in BB
1485 if (SchedDebugLevel >= Sched_PrintMachineCode) {
1486 std::cerr << "\n*** Machine instructions after INSTRUCTION SCHEDULING\n";
1487 MachineFunction::get(&F).dump();
1494 FunctionPass *createInstructionSchedulingWithSSAPass(const TargetMachine &tgt) {
1495 return new InstructionSchedulingWithSSA(tgt);