1 //===----- ScheduleDAGRRList.cpp - Reg pressure reduction list 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 // This implements bottom-up and top-down register pressure reduction list
11 // schedulers, using standard algorithms. The basic approach uses a priority
12 // queue of available nodes to schedule. One at a time, nodes are taken from
13 // the priority queue (thus in priority order), checked for legality to
14 // schedule, and emitted if legal.
16 //===----------------------------------------------------------------------===//
18 #define DEBUG_TYPE "pre-RA-sched"
19 #include "ScheduleDAGSDNodes.h"
20 #include "llvm/CodeGen/SchedulerRegistry.h"
21 #include "llvm/CodeGen/SelectionDAGISel.h"
22 #include "llvm/Target/TargetRegisterInfo.h"
23 #include "llvm/Target/TargetData.h"
24 #include "llvm/Target/TargetMachine.h"
25 #include "llvm/Target/TargetInstrInfo.h"
26 #include "llvm/Support/Debug.h"
27 #include "llvm/Support/Compiler.h"
28 #include "llvm/ADT/PriorityQueue.h"
29 #include "llvm/ADT/SmallSet.h"
30 #include "llvm/ADT/Statistic.h"
31 #include "llvm/ADT/STLExtras.h"
35 STATISTIC(NumBacktracks, "Number of times scheduler backtracked");
36 STATISTIC(NumUnfolds, "Number of nodes unfolded");
37 STATISTIC(NumDups, "Number of duplicated nodes");
38 STATISTIC(NumPRCopies, "Number of physical register copies");
40 static RegisterScheduler
41 burrListDAGScheduler("list-burr",
42 "Bottom-up register reduction list scheduling",
43 createBURRListDAGScheduler);
44 static RegisterScheduler
45 tdrListrDAGScheduler("list-tdrr",
46 "Top-down register reduction list scheduling",
47 createTDRRListDAGScheduler);
50 //===----------------------------------------------------------------------===//
51 /// ScheduleDAGRRList - The actual register reduction list scheduler
52 /// implementation. This supports both top-down and bottom-up scheduling.
54 class VISIBILITY_HIDDEN ScheduleDAGRRList : public ScheduleDAGSDNodes {
56 /// isBottomUp - This is true if the scheduling problem is bottom-up, false if
60 /// AvailableQueue - The priority queue to use for the available SUnits.
61 SchedulingPriorityQueue *AvailableQueue;
63 /// LiveRegDefs - A set of physical registers and their definition
64 /// that are "live". These nodes must be scheduled before any other nodes that
65 /// modifies the registers can be scheduled.
67 std::vector<SUnit*> LiveRegDefs;
68 std::vector<unsigned> LiveRegCycles;
70 /// Topo - A topological ordering for SUnits which permits fast IsReachable
71 /// and similar queries.
72 ScheduleDAGTopologicalSort Topo;
75 ScheduleDAGRRList(MachineFunction &mf,
77 SchedulingPriorityQueue *availqueue)
78 : ScheduleDAGSDNodes(mf), isBottomUp(isbottomup),
79 AvailableQueue(availqueue), Topo(SUnits) {
82 ~ScheduleDAGRRList() {
83 delete AvailableQueue;
88 /// IsReachable - Checks if SU is reachable from TargetSU.
89 bool IsReachable(const SUnit *SU, const SUnit *TargetSU) {
90 return Topo.IsReachable(SU, TargetSU);
93 /// WillCreateCycle - Returns true if adding an edge from SU to TargetSU will
95 bool WillCreateCycle(SUnit *SU, SUnit *TargetSU) {
96 return Topo.WillCreateCycle(SU, TargetSU);
99 /// AddPred - adds a predecessor edge to SUnit SU.
100 /// This returns true if this is a new predecessor.
101 /// Updates the topological ordering if required.
102 void AddPred(SUnit *SU, const SDep &D) {
103 Topo.AddPred(SU, D.getSUnit());
107 /// RemovePred - removes a predecessor edge from SUnit SU.
108 /// This returns true if an edge was removed.
109 /// Updates the topological ordering if required.
110 void RemovePred(SUnit *SU, const SDep &D) {
111 Topo.RemovePred(SU, D.getSUnit());
116 void ReleasePred(SUnit *SU, const SDep *PredEdge);
117 void ReleasePredecessors(SUnit *SU, unsigned CurCycle);
118 void ReleaseSucc(SUnit *SU, const SDep *SuccEdge);
119 void ReleaseSuccessors(SUnit *SU);
120 void CapturePred(SDep *PredEdge);
121 void ScheduleNodeBottomUp(SUnit*, unsigned);
122 void ScheduleNodeTopDown(SUnit*, unsigned);
123 void UnscheduleNodeBottomUp(SUnit*);
124 void BacktrackBottomUp(SUnit*, unsigned, unsigned&);
125 SUnit *CopyAndMoveSuccessors(SUnit*);
126 void InsertCopiesAndMoveSuccs(SUnit*, unsigned,
127 const TargetRegisterClass*,
128 const TargetRegisterClass*,
129 SmallVector<SUnit*, 2>&);
130 bool DelayForLiveRegsBottomUp(SUnit*, SmallVector<unsigned, 4>&);
131 void ListScheduleTopDown();
132 void ListScheduleBottomUp();
135 /// CreateNewSUnit - Creates a new SUnit and returns a pointer to it.
136 /// Updates the topological ordering if required.
137 SUnit *CreateNewSUnit(SDNode *N) {
138 unsigned NumSUnits = SUnits.size();
139 SUnit *NewNode = NewSUnit(N);
140 // Update the topological ordering.
141 if (NewNode->NodeNum >= NumSUnits)
142 Topo.InitDAGTopologicalSorting();
146 /// CreateClone - Creates a new SUnit from an existing one.
147 /// Updates the topological ordering if required.
148 SUnit *CreateClone(SUnit *N) {
149 unsigned NumSUnits = SUnits.size();
150 SUnit *NewNode = Clone(N);
151 // Update the topological ordering.
152 if (NewNode->NodeNum >= NumSUnits)
153 Topo.InitDAGTopologicalSorting();
157 /// ForceUnitLatencies - Return true, since register-pressure-reducing
158 /// scheduling doesn't need actual latency information.
159 bool ForceUnitLatencies() const { return true; }
161 } // end anonymous namespace
164 /// Schedule - Schedule the DAG using list scheduling.
165 void ScheduleDAGRRList::Schedule() {
166 DOUT << "********** List Scheduling **********\n";
169 LiveRegDefs.resize(TRI->getNumRegs(), NULL);
170 LiveRegCycles.resize(TRI->getNumRegs(), 0);
172 // Build the scheduling graph.
175 DEBUG(for (unsigned su = 0, e = SUnits.size(); su != e; ++su)
176 SUnits[su].dumpAll(this));
177 Topo.InitDAGTopologicalSorting();
179 AvailableQueue->initNodes(SUnits);
181 // Execute the actual scheduling loop Top-Down or Bottom-Up as appropriate.
183 ListScheduleBottomUp();
185 ListScheduleTopDown();
187 AvailableQueue->releaseState();
190 //===----------------------------------------------------------------------===//
191 // Bottom-Up Scheduling
192 //===----------------------------------------------------------------------===//
194 /// ReleasePred - Decrement the NumSuccsLeft count of a predecessor. Add it to
195 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
196 void ScheduleDAGRRList::ReleasePred(SUnit *SU, const SDep *PredEdge) {
197 SUnit *PredSU = PredEdge->getSUnit();
198 --PredSU->NumSuccsLeft;
201 if (PredSU->NumSuccsLeft < 0) {
202 cerr << "*** Scheduling failed! ***\n";
204 cerr << " has been released too many times!\n";
209 // If all the node's successors are scheduled, this node is ready
210 // to be scheduled. Ignore the special EntrySU node.
211 if (PredSU->NumSuccsLeft == 0 && PredSU != &EntrySU) {
212 PredSU->isAvailable = true;
213 AvailableQueue->push(PredSU);
217 void ScheduleDAGRRList::ReleasePredecessors(SUnit *SU, unsigned CurCycle) {
218 // Bottom up: release predecessors
219 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
221 ReleasePred(SU, &*I);
222 if (I->isAssignedRegDep()) {
223 // This is a physical register dependency and it's impossible or
224 // expensive to copy the register. Make sure nothing that can
225 // clobber the register is scheduled between the predecessor and
227 if (!LiveRegDefs[I->getReg()]) {
229 LiveRegDefs[I->getReg()] = I->getSUnit();
230 LiveRegCycles[I->getReg()] = CurCycle;
236 /// ScheduleNodeBottomUp - Add the node to the schedule. Decrement the pending
237 /// count of its predecessors. If a predecessor pending count is zero, add it to
238 /// the Available queue.
239 void ScheduleDAGRRList::ScheduleNodeBottomUp(SUnit *SU, unsigned CurCycle) {
240 DOUT << "*** Scheduling [" << CurCycle << "]: ";
241 DEBUG(SU->dump(this));
243 assert(CurCycle >= SU->getHeight() && "Node scheduled below its height!");
244 SU->setHeightToAtLeast(CurCycle);
245 Sequence.push_back(SU);
247 ReleasePredecessors(SU, CurCycle);
249 // Release all the implicit physical register defs that are live.
250 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
252 if (I->isAssignedRegDep()) {
253 if (LiveRegCycles[I->getReg()] == I->getSUnit()->getHeight()) {
254 assert(NumLiveRegs > 0 && "NumLiveRegs is already zero!");
255 assert(LiveRegDefs[I->getReg()] == SU &&
256 "Physical register dependency violated?");
258 LiveRegDefs[I->getReg()] = NULL;
259 LiveRegCycles[I->getReg()] = 0;
264 SU->isScheduled = true;
265 AvailableQueue->ScheduledNode(SU);
268 /// CapturePred - This does the opposite of ReleasePred. Since SU is being
269 /// unscheduled, incrcease the succ left count of its predecessors. Remove
270 /// them from AvailableQueue if necessary.
271 void ScheduleDAGRRList::CapturePred(SDep *PredEdge) {
272 SUnit *PredSU = PredEdge->getSUnit();
273 if (PredSU->isAvailable) {
274 PredSU->isAvailable = false;
275 if (!PredSU->isPending)
276 AvailableQueue->remove(PredSU);
279 ++PredSU->NumSuccsLeft;
282 /// UnscheduleNodeBottomUp - Remove the node from the schedule, update its and
283 /// its predecessor states to reflect the change.
284 void ScheduleDAGRRList::UnscheduleNodeBottomUp(SUnit *SU) {
285 DOUT << "*** Unscheduling [" << SU->getHeight() << "]: ";
286 DEBUG(SU->dump(this));
288 AvailableQueue->UnscheduledNode(SU);
290 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
293 if (I->isAssignedRegDep() && SU->getHeight() == LiveRegCycles[I->getReg()]) {
294 assert(NumLiveRegs > 0 && "NumLiveRegs is already zero!");
295 assert(LiveRegDefs[I->getReg()] == I->getSUnit() &&
296 "Physical register dependency violated?");
298 LiveRegDefs[I->getReg()] = NULL;
299 LiveRegCycles[I->getReg()] = 0;
303 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
305 if (I->isAssignedRegDep()) {
306 if (!LiveRegDefs[I->getReg()]) {
307 LiveRegDefs[I->getReg()] = SU;
310 if (I->getSUnit()->getHeight() < LiveRegCycles[I->getReg()])
311 LiveRegCycles[I->getReg()] = I->getSUnit()->getHeight();
315 SU->setHeightDirty();
316 SU->isScheduled = false;
317 SU->isAvailable = true;
318 AvailableQueue->push(SU);
321 /// BacktrackBottomUp - Backtrack scheduling to a previous cycle specified in
322 /// BTCycle in order to schedule a specific node.
323 void ScheduleDAGRRList::BacktrackBottomUp(SUnit *SU, unsigned BtCycle,
324 unsigned &CurCycle) {
326 while (CurCycle > BtCycle) {
327 OldSU = Sequence.back();
329 if (SU->isSucc(OldSU))
330 // Don't try to remove SU from AvailableQueue.
331 SU->isAvailable = false;
332 UnscheduleNodeBottomUp(OldSU);
336 assert(!SU->isSucc(OldSU) && "Something is wrong!");
341 /// CopyAndMoveSuccessors - Clone the specified node and move its scheduled
342 /// successors to the newly created node.
343 SUnit *ScheduleDAGRRList::CopyAndMoveSuccessors(SUnit *SU) {
344 if (SU->getNode()->getFlaggedNode())
347 SDNode *N = SU->getNode();
352 bool TryUnfold = false;
353 for (unsigned i = 0, e = N->getNumValues(); i != e; ++i) {
354 MVT VT = N->getValueType(i);
357 else if (VT == MVT::Other)
360 for (unsigned i = 0, e = N->getNumOperands(); i != e; ++i) {
361 const SDValue &Op = N->getOperand(i);
362 MVT VT = Op.getNode()->getValueType(Op.getResNo());
368 SmallVector<SDNode*, 2> NewNodes;
369 if (!TII->unfoldMemoryOperand(*DAG, N, NewNodes))
372 DOUT << "Unfolding SU # " << SU->NodeNum << "\n";
373 assert(NewNodes.size() == 2 && "Expected a load folding node!");
376 SDNode *LoadNode = NewNodes[0];
377 unsigned NumVals = N->getNumValues();
378 unsigned OldNumVals = SU->getNode()->getNumValues();
379 for (unsigned i = 0; i != NumVals; ++i)
380 DAG->ReplaceAllUsesOfValueWith(SDValue(SU->getNode(), i), SDValue(N, i));
381 DAG->ReplaceAllUsesOfValueWith(SDValue(SU->getNode(), OldNumVals-1),
382 SDValue(LoadNode, 1));
384 // LoadNode may already exist. This can happen when there is another
385 // load from the same location and producing the same type of value
386 // but it has different alignment or volatileness.
387 bool isNewLoad = true;
389 if (LoadNode->getNodeId() != -1) {
390 LoadSU = &SUnits[LoadNode->getNodeId()];
393 LoadSU = CreateNewSUnit(LoadNode);
394 LoadNode->setNodeId(LoadSU->NodeNum);
395 ComputeLatency(LoadSU);
398 SUnit *NewSU = CreateNewSUnit(N);
399 assert(N->getNodeId() == -1 && "Node already inserted!");
400 N->setNodeId(NewSU->NodeNum);
402 const TargetInstrDesc &TID = TII->get(N->getMachineOpcode());
403 for (unsigned i = 0; i != TID.getNumOperands(); ++i) {
404 if (TID.getOperandConstraint(i, TOI::TIED_TO) != -1) {
405 NewSU->isTwoAddress = true;
409 if (TID.isCommutable())
410 NewSU->isCommutable = true;
411 ComputeLatency(NewSU);
414 SmallVector<SDep, 4> ChainSuccs;
415 SmallVector<SDep, 4> LoadPreds;
416 SmallVector<SDep, 4> NodePreds;
417 SmallVector<SDep, 4> NodeSuccs;
418 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
422 else if (I->getSUnit()->getNode() &&
423 I->getSUnit()->getNode()->isOperandOf(LoadNode))
424 LoadPreds.push_back(*I);
426 NodePreds.push_back(*I);
428 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
431 ChainSuccs.push_back(*I);
433 NodeSuccs.push_back(*I);
436 if (ChainPred.getSUnit()) {
437 RemovePred(SU, ChainPred);
439 AddPred(LoadSU, ChainPred);
441 for (unsigned i = 0, e = LoadPreds.size(); i != e; ++i) {
442 const SDep &Pred = LoadPreds[i];
443 RemovePred(SU, Pred);
445 AddPred(LoadSU, Pred);
448 for (unsigned i = 0, e = NodePreds.size(); i != e; ++i) {
449 const SDep &Pred = NodePreds[i];
450 RemovePred(SU, Pred);
451 AddPred(NewSU, Pred);
453 for (unsigned i = 0, e = NodeSuccs.size(); i != e; ++i) {
454 SDep D = NodeSuccs[i];
455 SUnit *SuccDep = D.getSUnit();
457 RemovePred(SuccDep, D);
461 for (unsigned i = 0, e = ChainSuccs.size(); i != e; ++i) {
462 SDep D = ChainSuccs[i];
463 SUnit *SuccDep = D.getSUnit();
465 RemovePred(SuccDep, D);
472 AddPred(NewSU, SDep(LoadSU, SDep::Order, LoadSU->Latency));
476 AvailableQueue->addNode(LoadSU);
477 AvailableQueue->addNode(NewSU);
481 if (NewSU->NumSuccsLeft == 0) {
482 NewSU->isAvailable = true;
488 DOUT << "Duplicating SU # " << SU->NodeNum << "\n";
489 NewSU = CreateClone(SU);
491 // New SUnit has the exact same predecessors.
492 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
494 if (!I->isArtificial())
497 // Only copy scheduled successors. Cut them from old node's successor
498 // list and move them over.
499 SmallVector<std::pair<SUnit *, SDep>, 4> DelDeps;
500 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
502 if (I->isArtificial())
504 SUnit *SuccSU = I->getSUnit();
505 if (SuccSU->isScheduled) {
510 DelDeps.push_back(std::make_pair(SuccSU, D));
513 for (unsigned i = 0, e = DelDeps.size(); i != e; ++i)
514 RemovePred(DelDeps[i].first, DelDeps[i].second);
516 AvailableQueue->updateNode(SU);
517 AvailableQueue->addNode(NewSU);
523 /// InsertCopiesAndMoveSuccs - Insert register copies and move all
524 /// scheduled successors of the given SUnit to the last copy.
525 void ScheduleDAGRRList::InsertCopiesAndMoveSuccs(SUnit *SU, unsigned Reg,
526 const TargetRegisterClass *DestRC,
527 const TargetRegisterClass *SrcRC,
528 SmallVector<SUnit*, 2> &Copies) {
529 SUnit *CopyFromSU = CreateNewSUnit(NULL);
530 CopyFromSU->CopySrcRC = SrcRC;
531 CopyFromSU->CopyDstRC = DestRC;
533 SUnit *CopyToSU = CreateNewSUnit(NULL);
534 CopyToSU->CopySrcRC = DestRC;
535 CopyToSU->CopyDstRC = SrcRC;
537 // Only copy scheduled successors. Cut them from old node's successor
538 // list and move them over.
539 SmallVector<std::pair<SUnit *, SDep>, 4> DelDeps;
540 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
542 if (I->isArtificial())
544 SUnit *SuccSU = I->getSUnit();
545 if (SuccSU->isScheduled) {
547 D.setSUnit(CopyToSU);
549 DelDeps.push_back(std::make_pair(SuccSU, *I));
552 for (unsigned i = 0, e = DelDeps.size(); i != e; ++i)
553 RemovePred(DelDeps[i].first, DelDeps[i].second);
555 AddPred(CopyFromSU, SDep(SU, SDep::Data, SU->Latency, Reg));
556 AddPred(CopyToSU, SDep(CopyFromSU, SDep::Data, CopyFromSU->Latency, 0));
558 AvailableQueue->updateNode(SU);
559 AvailableQueue->addNode(CopyFromSU);
560 AvailableQueue->addNode(CopyToSU);
561 Copies.push_back(CopyFromSU);
562 Copies.push_back(CopyToSU);
567 /// getPhysicalRegisterVT - Returns the ValueType of the physical register
568 /// definition of the specified node.
569 /// FIXME: Move to SelectionDAG?
570 static MVT getPhysicalRegisterVT(SDNode *N, unsigned Reg,
571 const TargetInstrInfo *TII) {
572 const TargetInstrDesc &TID = TII->get(N->getMachineOpcode());
573 assert(TID.ImplicitDefs && "Physical reg def must be in implicit def list!");
574 unsigned NumRes = TID.getNumDefs();
575 for (const unsigned *ImpDef = TID.getImplicitDefs(); *ImpDef; ++ImpDef) {
580 return N->getValueType(NumRes);
583 /// DelayForLiveRegsBottomUp - Returns true if it is necessary to delay
584 /// scheduling of the given node to satisfy live physical register dependencies.
585 /// If the specific node is the last one that's available to schedule, do
586 /// whatever is necessary (i.e. backtracking or cloning) to make it possible.
587 bool ScheduleDAGRRList::DelayForLiveRegsBottomUp(SUnit *SU,
588 SmallVector<unsigned, 4> &LRegs){
589 if (NumLiveRegs == 0)
592 SmallSet<unsigned, 4> RegAdded;
593 // If this node would clobber any "live" register, then it's not ready.
594 for (SUnit::pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
596 if (I->isAssignedRegDep()) {
597 unsigned Reg = I->getReg();
598 if (LiveRegDefs[Reg] && LiveRegDefs[Reg] != I->getSUnit()) {
599 if (RegAdded.insert(Reg))
600 LRegs.push_back(Reg);
602 for (const unsigned *Alias = TRI->getAliasSet(Reg);
604 if (LiveRegDefs[*Alias] && LiveRegDefs[*Alias] != I->getSUnit()) {
605 if (RegAdded.insert(*Alias))
606 LRegs.push_back(*Alias);
611 for (SDNode *Node = SU->getNode(); Node; Node = Node->getFlaggedNode()) {
612 if (!Node->isMachineOpcode())
614 const TargetInstrDesc &TID = TII->get(Node->getMachineOpcode());
615 if (!TID.ImplicitDefs)
617 for (const unsigned *Reg = TID.ImplicitDefs; *Reg; ++Reg) {
618 if (LiveRegDefs[*Reg] && LiveRegDefs[*Reg] != SU) {
619 if (RegAdded.insert(*Reg))
620 LRegs.push_back(*Reg);
622 for (const unsigned *Alias = TRI->getAliasSet(*Reg);
624 if (LiveRegDefs[*Alias] && LiveRegDefs[*Alias] != SU) {
625 if (RegAdded.insert(*Alias))
626 LRegs.push_back(*Alias);
630 return !LRegs.empty();
634 /// ListScheduleBottomUp - The main loop of list scheduling for bottom-up
636 void ScheduleDAGRRList::ListScheduleBottomUp() {
637 unsigned CurCycle = 0;
639 // Release any predecessors of the special Exit node.
640 ReleasePredecessors(&ExitSU, CurCycle);
642 // Add root to Available queue.
643 if (!SUnits.empty()) {
644 SUnit *RootSU = &SUnits[DAG->getRoot().getNode()->getNodeId()];
645 assert(RootSU->Succs.empty() && "Graph root shouldn't have successors!");
646 RootSU->isAvailable = true;
647 AvailableQueue->push(RootSU);
650 // While Available queue is not empty, grab the node with the highest
651 // priority. If it is not ready put it back. Schedule the node.
652 SmallVector<SUnit*, 4> NotReady;
653 DenseMap<SUnit*, SmallVector<unsigned, 4> > LRegsMap;
654 Sequence.reserve(SUnits.size());
655 while (!AvailableQueue->empty()) {
656 bool Delayed = false;
658 SUnit *CurSU = AvailableQueue->pop();
660 SmallVector<unsigned, 4> LRegs;
661 if (!DelayForLiveRegsBottomUp(CurSU, LRegs))
664 LRegsMap.insert(std::make_pair(CurSU, LRegs));
666 CurSU->isPending = true; // This SU is not in AvailableQueue right now.
667 NotReady.push_back(CurSU);
668 CurSU = AvailableQueue->pop();
671 // All candidates are delayed due to live physical reg dependencies.
672 // Try backtracking, code duplication, or inserting cross class copies
674 if (Delayed && !CurSU) {
675 for (unsigned i = 0, e = NotReady.size(); i != e; ++i) {
676 SUnit *TrySU = NotReady[i];
677 SmallVector<unsigned, 4> &LRegs = LRegsMap[TrySU];
679 // Try unscheduling up to the point where it's safe to schedule
681 unsigned LiveCycle = CurCycle;
682 for (unsigned j = 0, ee = LRegs.size(); j != ee; ++j) {
683 unsigned Reg = LRegs[j];
684 unsigned LCycle = LiveRegCycles[Reg];
685 LiveCycle = std::min(LiveCycle, LCycle);
687 SUnit *OldSU = Sequence[LiveCycle];
688 if (!WillCreateCycle(TrySU, OldSU)) {
689 BacktrackBottomUp(TrySU, LiveCycle, CurCycle);
690 // Force the current node to be scheduled before the node that
691 // requires the physical reg dep.
692 if (OldSU->isAvailable) {
693 OldSU->isAvailable = false;
694 AvailableQueue->remove(OldSU);
696 AddPred(TrySU, SDep(OldSU, SDep::Order, /*Latency=*/1,
697 /*Reg=*/0, /*isNormalMemory=*/false,
698 /*isMustAlias=*/false, /*isArtificial=*/true));
699 // If one or more successors has been unscheduled, then the current
700 // node is no longer avaialable. Schedule a successor that's now
701 // available instead.
702 if (!TrySU->isAvailable)
703 CurSU = AvailableQueue->pop();
706 TrySU->isPending = false;
707 NotReady.erase(NotReady.begin()+i);
714 // Can't backtrack. If it's too expensive to copy the value, then try
715 // duplicate the nodes that produces these "too expensive to copy"
716 // values to break the dependency. In case even that doesn't work,
717 // insert cross class copies.
718 // If it's not too expensive, i.e. cost != -1, issue copies.
719 SUnit *TrySU = NotReady[0];
720 SmallVector<unsigned, 4> &LRegs = LRegsMap[TrySU];
721 assert(LRegs.size() == 1 && "Can't handle this yet!");
722 unsigned Reg = LRegs[0];
723 SUnit *LRDef = LiveRegDefs[Reg];
724 MVT VT = getPhysicalRegisterVT(LRDef->getNode(), Reg, TII);
725 const TargetRegisterClass *RC =
726 TRI->getPhysicalRegisterRegClass(Reg, VT);
727 const TargetRegisterClass *DestRC = TRI->getCrossCopyRegClass(RC);
729 // If cross copy register class is null, then it must be possible copy
730 // the value directly. Do not try duplicate the def.
733 NewDef = CopyAndMoveSuccessors(LRDef);
737 // Issue copies, these can be expensive cross register class copies.
738 SmallVector<SUnit*, 2> Copies;
739 InsertCopiesAndMoveSuccs(LRDef, Reg, DestRC, RC, Copies);
740 DOUT << "Adding an edge from SU #" << TrySU->NodeNum
741 << " to SU #" << Copies.front()->NodeNum << "\n";
742 AddPred(TrySU, SDep(Copies.front(), SDep::Order, /*Latency=*/1,
743 /*Reg=*/0, /*isNormalMemory=*/false,
744 /*isMustAlias=*/false,
745 /*isArtificial=*/true));
746 NewDef = Copies.back();
749 DOUT << "Adding an edge from SU #" << NewDef->NodeNum
750 << " to SU #" << TrySU->NodeNum << "\n";
751 LiveRegDefs[Reg] = NewDef;
752 AddPred(NewDef, SDep(TrySU, SDep::Order, /*Latency=*/1,
753 /*Reg=*/0, /*isNormalMemory=*/false,
754 /*isMustAlias=*/false,
755 /*isArtificial=*/true));
756 TrySU->isAvailable = false;
760 assert(CurSU && "Unable to resolve live physical register dependencies!");
763 // Add the nodes that aren't ready back onto the available list.
764 for (unsigned i = 0, e = NotReady.size(); i != e; ++i) {
765 NotReady[i]->isPending = false;
766 // May no longer be available due to backtracking.
767 if (NotReady[i]->isAvailable)
768 AvailableQueue->push(NotReady[i]);
773 ScheduleNodeBottomUp(CurSU, CurCycle);
777 // Reverse the order if it is bottom up.
778 std::reverse(Sequence.begin(), Sequence.end());
781 VerifySchedule(isBottomUp);
785 //===----------------------------------------------------------------------===//
786 // Top-Down Scheduling
787 //===----------------------------------------------------------------------===//
789 /// ReleaseSucc - Decrement the NumPredsLeft count of a successor. Add it to
790 /// the AvailableQueue if the count reaches zero. Also update its cycle bound.
791 void ScheduleDAGRRList::ReleaseSucc(SUnit *SU, const SDep *SuccEdge) {
792 SUnit *SuccSU = SuccEdge->getSUnit();
793 --SuccSU->NumPredsLeft;
796 if (SuccSU->NumPredsLeft < 0) {
797 cerr << "*** Scheduling failed! ***\n";
799 cerr << " has been released too many times!\n";
804 // If all the node's predecessors are scheduled, this node is ready
805 // to be scheduled. Ignore the special ExitSU node.
806 if (SuccSU->NumPredsLeft == 0 && SuccSU != &ExitSU) {
807 SuccSU->isAvailable = true;
808 AvailableQueue->push(SuccSU);
812 void ScheduleDAGRRList::ReleaseSuccessors(SUnit *SU) {
813 // Top down: release successors
814 for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
816 assert(!I->isAssignedRegDep() &&
817 "The list-tdrr scheduler doesn't yet support physreg dependencies!");
819 ReleaseSucc(SU, &*I);
823 /// ScheduleNodeTopDown - Add the node to the schedule. Decrement the pending
824 /// count of its successors. If a successor pending count is zero, add it to
825 /// the Available queue.
826 void ScheduleDAGRRList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
827 DOUT << "*** Scheduling [" << CurCycle << "]: ";
828 DEBUG(SU->dump(this));
830 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");
831 SU->setDepthToAtLeast(CurCycle);
832 Sequence.push_back(SU);
834 ReleaseSuccessors(SU);
835 SU->isScheduled = true;
836 AvailableQueue->ScheduledNode(SU);
839 /// ListScheduleTopDown - The main loop of list scheduling for top-down
841 void ScheduleDAGRRList::ListScheduleTopDown() {
842 unsigned CurCycle = 0;
844 // Release any successors of the special Entry node.
845 ReleaseSuccessors(&EntrySU);
847 // All leaves to Available queue.
848 for (unsigned i = 0, e = SUnits.size(); i != e; ++i) {
849 // It is available if it has no predecessors.
850 if (SUnits[i].Preds.empty()) {
851 AvailableQueue->push(&SUnits[i]);
852 SUnits[i].isAvailable = true;
856 // While Available queue is not empty, grab the node with the highest
857 // priority. If it is not ready put it back. Schedule the node.
858 Sequence.reserve(SUnits.size());
859 while (!AvailableQueue->empty()) {
860 SUnit *CurSU = AvailableQueue->pop();
863 ScheduleNodeTopDown(CurSU, CurCycle);
868 VerifySchedule(isBottomUp);
873 //===----------------------------------------------------------------------===//
874 // RegReductionPriorityQueue Implementation
875 //===----------------------------------------------------------------------===//
877 // This is a SchedulingPriorityQueue that schedules using Sethi Ullman numbers
878 // to reduce register pressure.
882 class RegReductionPriorityQueue;
884 /// Sorting functions for the Available queue.
885 struct bu_ls_rr_sort : public std::binary_function<SUnit*, SUnit*, bool> {
886 RegReductionPriorityQueue<bu_ls_rr_sort> *SPQ;
887 bu_ls_rr_sort(RegReductionPriorityQueue<bu_ls_rr_sort> *spq) : SPQ(spq) {}
888 bu_ls_rr_sort(const bu_ls_rr_sort &RHS) : SPQ(RHS.SPQ) {}
890 bool operator()(const SUnit* left, const SUnit* right) const;
893 struct td_ls_rr_sort : public std::binary_function<SUnit*, SUnit*, bool> {
894 RegReductionPriorityQueue<td_ls_rr_sort> *SPQ;
895 td_ls_rr_sort(RegReductionPriorityQueue<td_ls_rr_sort> *spq) : SPQ(spq) {}
896 td_ls_rr_sort(const td_ls_rr_sort &RHS) : SPQ(RHS.SPQ) {}
898 bool operator()(const SUnit* left, const SUnit* right) const;
900 } // end anonymous namespace
902 /// CalcNodeSethiUllmanNumber - Compute Sethi Ullman number.
903 /// Smaller number is the higher priority.
905 CalcNodeSethiUllmanNumber(const SUnit *SU, std::vector<unsigned> &SUNumbers) {
906 unsigned &SethiUllmanNumber = SUNumbers[SU->NodeNum];
907 if (SethiUllmanNumber != 0)
908 return SethiUllmanNumber;
911 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
913 if (I->isCtrl()) continue; // ignore chain preds
914 SUnit *PredSU = I->getSUnit();
915 unsigned PredSethiUllman = CalcNodeSethiUllmanNumber(PredSU, SUNumbers);
916 if (PredSethiUllman > SethiUllmanNumber) {
917 SethiUllmanNumber = PredSethiUllman;
919 } else if (PredSethiUllman == SethiUllmanNumber && !I->isCtrl())
923 SethiUllmanNumber += Extra;
925 if (SethiUllmanNumber == 0)
926 SethiUllmanNumber = 1;
928 return SethiUllmanNumber;
933 class VISIBILITY_HIDDEN RegReductionPriorityQueue
934 : public SchedulingPriorityQueue {
935 PriorityQueue<SUnit*, std::vector<SUnit*>, SF> Queue;
936 unsigned currentQueueId;
939 // SUnits - The SUnits for the current graph.
940 std::vector<SUnit> *SUnits;
942 const TargetInstrInfo *TII;
943 const TargetRegisterInfo *TRI;
944 ScheduleDAGRRList *scheduleDAG;
946 // SethiUllmanNumbers - The SethiUllman number for each node.
947 std::vector<unsigned> SethiUllmanNumbers;
950 RegReductionPriorityQueue(const TargetInstrInfo *tii,
951 const TargetRegisterInfo *tri) :
952 Queue(SF(this)), currentQueueId(0),
953 TII(tii), TRI(tri), scheduleDAG(NULL) {}
955 void initNodes(std::vector<SUnit> &sunits) {
957 // Add pseudo dependency edges for two-address nodes.
958 AddPseudoTwoAddrDeps();
959 // Calculate node priorities.
960 CalculateSethiUllmanNumbers();
963 void addNode(const SUnit *SU) {
964 unsigned SUSize = SethiUllmanNumbers.size();
965 if (SUnits->size() > SUSize)
966 SethiUllmanNumbers.resize(SUSize*2, 0);
967 CalcNodeSethiUllmanNumber(SU, SethiUllmanNumbers);
970 void updateNode(const SUnit *SU) {
971 SethiUllmanNumbers[SU->NodeNum] = 0;
972 CalcNodeSethiUllmanNumber(SU, SethiUllmanNumbers);
975 void releaseState() {
977 SethiUllmanNumbers.clear();
980 unsigned getNodePriority(const SUnit *SU) const {
981 assert(SU->NodeNum < SethiUllmanNumbers.size());
982 unsigned Opc = SU->getNode() ? SU->getNode()->getOpcode() : 0;
983 if (Opc == ISD::TokenFactor || Opc == ISD::CopyToReg)
984 // CopyToReg should be close to its uses to facilitate coalescing and
987 if (Opc == TargetInstrInfo::EXTRACT_SUBREG ||
988 Opc == TargetInstrInfo::INSERT_SUBREG)
989 // EXTRACT_SUBREG / INSERT_SUBREG should be close to its use to
990 // facilitate coalescing.
992 if (SU->NumSuccs == 0)
993 // If SU does not have a use, i.e. it doesn't produce a value that would
994 // be consumed (e.g. store), then it terminates a chain of computation.
995 // Give it a large SethiUllman number so it will be scheduled right
996 // before its predecessors that it doesn't lengthen their live ranges.
998 if (SU->NumPreds == 0)
999 // If SU does not have a def, schedule it close to its uses because it
1000 // does not lengthen any live ranges.
1002 return SethiUllmanNumbers[SU->NodeNum];
1005 unsigned size() const { return Queue.size(); }
1007 bool empty() const { return Queue.empty(); }
1009 void push(SUnit *U) {
1010 assert(!U->NodeQueueId && "Node in the queue already");
1011 U->NodeQueueId = ++currentQueueId;
1015 void push_all(const std::vector<SUnit *> &Nodes) {
1016 for (unsigned i = 0, e = Nodes.size(); i != e; ++i)
1021 if (empty()) return NULL;
1022 SUnit *V = Queue.top();
1028 void remove(SUnit *SU) {
1029 assert(!Queue.empty() && "Queue is empty!");
1030 assert(SU->NodeQueueId != 0 && "Not in queue!");
1031 Queue.erase_one(SU);
1032 SU->NodeQueueId = 0;
1035 void setScheduleDAG(ScheduleDAGRRList *scheduleDag) {
1036 scheduleDAG = scheduleDag;
1040 bool canClobber(const SUnit *SU, const SUnit *Op);
1041 void AddPseudoTwoAddrDeps();
1042 void CalculateSethiUllmanNumbers();
1045 typedef RegReductionPriorityQueue<bu_ls_rr_sort>
1046 BURegReductionPriorityQueue;
1048 typedef RegReductionPriorityQueue<td_ls_rr_sort>
1049 TDRegReductionPriorityQueue;
1052 /// closestSucc - Returns the scheduled cycle of the successor which is
1053 /// closet to the current cycle.
1054 static unsigned closestSucc(const SUnit *SU) {
1055 unsigned MaxHeight = 0;
1056 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1058 if (I->isCtrl()) continue; // ignore chain succs
1059 unsigned Height = I->getSUnit()->getHeight();
1060 // If there are bunch of CopyToRegs stacked up, they should be considered
1061 // to be at the same position.
1062 if (I->getSUnit()->getNode() &&
1063 I->getSUnit()->getNode()->getOpcode() == ISD::CopyToReg)
1064 Height = closestSucc(I->getSUnit())+1;
1065 if (Height > MaxHeight)
1071 /// calcMaxScratches - Returns an cost estimate of the worse case requirement
1072 /// for scratch registers. Live-in operands and live-out results don't count
1073 /// since they are "fixed".
1074 static unsigned calcMaxScratches(const SUnit *SU) {
1075 unsigned Scratches = 0;
1076 for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();
1078 if (I->isCtrl()) continue; // ignore chain preds
1079 if (!I->getSUnit()->getNode() ||
1080 I->getSUnit()->getNode()->getOpcode() != ISD::CopyFromReg)
1083 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1085 if (I->isCtrl()) continue; // ignore chain succs
1086 if (!I->getSUnit()->getNode() ||
1087 I->getSUnit()->getNode()->getOpcode() != ISD::CopyToReg)
1094 bool bu_ls_rr_sort::operator()(const SUnit *left, const SUnit *right) const {
1095 unsigned LPriority = SPQ->getNodePriority(left);
1096 unsigned RPriority = SPQ->getNodePriority(right);
1097 if (LPriority != RPriority)
1098 return LPriority > RPriority;
1100 // Try schedule def + use closer when Sethi-Ullman numbers are the same.
1105 // and the following instructions are both ready.
1109 // Then schedule t2 = op first.
1116 // This creates more short live intervals.
1117 unsigned LDist = closestSucc(left);
1118 unsigned RDist = closestSucc(right);
1120 return LDist < RDist;
1122 // Intuitively, it's good to push down instructions whose results are
1123 // liveout so their long live ranges won't conflict with other values
1124 // which are needed inside the BB. Further prioritize liveout instructions
1125 // by the number of operands which are calculated within the BB.
1126 unsigned LScratch = calcMaxScratches(left);
1127 unsigned RScratch = calcMaxScratches(right);
1128 if (LScratch != RScratch)
1129 return LScratch > RScratch;
1131 if (left->getHeight() != right->getHeight())
1132 return left->getHeight() > right->getHeight();
1134 if (left->getDepth() != right->getDepth())
1135 return left->getDepth() < right->getDepth();
1137 assert(left->NodeQueueId && right->NodeQueueId &&
1138 "NodeQueueId cannot be zero");
1139 return (left->NodeQueueId > right->NodeQueueId);
1144 RegReductionPriorityQueue<SF>::canClobber(const SUnit *SU, const SUnit *Op) {
1145 if (SU->isTwoAddress) {
1146 unsigned Opc = SU->getNode()->getMachineOpcode();
1147 const TargetInstrDesc &TID = TII->get(Opc);
1148 unsigned NumRes = TID.getNumDefs();
1149 unsigned NumOps = TID.getNumOperands() - NumRes;
1150 for (unsigned i = 0; i != NumOps; ++i) {
1151 if (TID.getOperandConstraint(i+NumRes, TOI::TIED_TO) != -1) {
1152 SDNode *DU = SU->getNode()->getOperand(i).getNode();
1153 if (DU->getNodeId() != -1 &&
1154 Op->OrigNode == &(*SUnits)[DU->getNodeId()])
1163 /// hasCopyToRegUse - Return true if SU has a value successor that is a
1165 static bool hasCopyToRegUse(const SUnit *SU) {
1166 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1168 if (I->isCtrl()) continue;
1169 const SUnit *SuccSU = I->getSUnit();
1170 if (SuccSU->getNode() && SuccSU->getNode()->getOpcode() == ISD::CopyToReg)
1176 /// canClobberPhysRegDefs - True if SU would clobber one of SuccSU's
1177 /// physical register defs.
1178 static bool canClobberPhysRegDefs(const SUnit *SuccSU, const SUnit *SU,
1179 const TargetInstrInfo *TII,
1180 const TargetRegisterInfo *TRI) {
1181 SDNode *N = SuccSU->getNode();
1182 unsigned NumDefs = TII->get(N->getMachineOpcode()).getNumDefs();
1183 const unsigned *ImpDefs = TII->get(N->getMachineOpcode()).getImplicitDefs();
1184 assert(ImpDefs && "Caller should check hasPhysRegDefs");
1185 const unsigned *SUImpDefs =
1186 TII->get(SU->getNode()->getMachineOpcode()).getImplicitDefs();
1189 for (unsigned i = NumDefs, e = N->getNumValues(); i != e; ++i) {
1190 MVT VT = N->getValueType(i);
1191 if (VT == MVT::Flag || VT == MVT::Other)
1193 if (!N->hasAnyUseOfValue(i))
1195 unsigned Reg = ImpDefs[i - NumDefs];
1196 for (;*SUImpDefs; ++SUImpDefs) {
1197 unsigned SUReg = *SUImpDefs;
1198 if (TRI->regsOverlap(Reg, SUReg))
1205 /// AddPseudoTwoAddrDeps - If two nodes share an operand and one of them uses
1206 /// it as a def&use operand. Add a pseudo control edge from it to the other
1207 /// node (if it won't create a cycle) so the two-address one will be scheduled
1208 /// first (lower in the schedule). If both nodes are two-address, favor the
1209 /// one that has a CopyToReg use (more likely to be a loop induction update).
1210 /// If both are two-address, but one is commutable while the other is not
1211 /// commutable, favor the one that's not commutable.
1213 void RegReductionPriorityQueue<SF>::AddPseudoTwoAddrDeps() {
1214 for (unsigned i = 0, e = SUnits->size(); i != e; ++i) {
1215 SUnit *SU = &(*SUnits)[i];
1216 if (!SU->isTwoAddress)
1219 SDNode *Node = SU->getNode();
1220 if (!Node || !Node->isMachineOpcode() || SU->getNode()->getFlaggedNode())
1223 unsigned Opc = Node->getMachineOpcode();
1224 const TargetInstrDesc &TID = TII->get(Opc);
1225 unsigned NumRes = TID.getNumDefs();
1226 unsigned NumOps = TID.getNumOperands() - NumRes;
1227 for (unsigned j = 0; j != NumOps; ++j) {
1228 if (TID.getOperandConstraint(j+NumRes, TOI::TIED_TO) == -1)
1230 SDNode *DU = SU->getNode()->getOperand(j).getNode();
1231 if (DU->getNodeId() == -1)
1233 const SUnit *DUSU = &(*SUnits)[DU->getNodeId()];
1234 if (!DUSU) continue;
1235 for (SUnit::const_succ_iterator I = DUSU->Succs.begin(),
1236 E = DUSU->Succs.end(); I != E; ++I) {
1237 if (I->isCtrl()) continue;
1238 SUnit *SuccSU = I->getSUnit();
1241 // Be conservative. Ignore if nodes aren't at roughly the same
1242 // depth and height.
1243 if (SuccSU->getHeight() < SU->getHeight() &&
1244 (SU->getHeight() - SuccSU->getHeight()) > 1)
1246 if (!SuccSU->getNode() || !SuccSU->getNode()->isMachineOpcode())
1248 // Don't constrain nodes with physical register defs if the
1249 // predecessor can clobber them.
1250 if (SuccSU->hasPhysRegDefs) {
1251 if (canClobberPhysRegDefs(SuccSU, SU, TII, TRI))
1254 // Don't constraint extract_subreg / insert_subreg these may be
1255 // coalesced away. We don't them close to their uses.
1256 unsigned SuccOpc = SuccSU->getNode()->getMachineOpcode();
1257 if (SuccOpc == TargetInstrInfo::EXTRACT_SUBREG ||
1258 SuccOpc == TargetInstrInfo::INSERT_SUBREG)
1260 if ((!canClobber(SuccSU, DUSU) ||
1261 (hasCopyToRegUse(SU) && !hasCopyToRegUse(SuccSU)) ||
1262 (!SU->isCommutable && SuccSU->isCommutable)) &&
1263 !scheduleDAG->IsReachable(SuccSU, SU)) {
1264 DOUT << "Adding a pseudo-two-addr edge from SU # " << SU->NodeNum
1265 << " to SU #" << SuccSU->NodeNum << "\n";
1266 scheduleDAG->AddPred(SU, SDep(SuccSU, SDep::Order, /*Latency=*/0,
1267 /*Reg=*/0, /*isNormalMemory=*/false,
1268 /*isMustAlias=*/false,
1269 /*isArtificial=*/true));
1276 /// CalculateSethiUllmanNumbers - Calculate Sethi-Ullman numbers of all
1277 /// scheduling units.
1279 void RegReductionPriorityQueue<SF>::CalculateSethiUllmanNumbers() {
1280 SethiUllmanNumbers.assign(SUnits->size(), 0);
1282 for (unsigned i = 0, e = SUnits->size(); i != e; ++i)
1283 CalcNodeSethiUllmanNumber(&(*SUnits)[i], SethiUllmanNumbers);
1286 /// LimitedSumOfUnscheduledPredsOfSuccs - Compute the sum of the unscheduled
1287 /// predecessors of the successors of the SUnit SU. Stop when the provided
1288 /// limit is exceeded.
1289 static unsigned LimitedSumOfUnscheduledPredsOfSuccs(const SUnit *SU,
1292 for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();
1294 const SUnit *SuccSU = I->getSUnit();
1295 for (SUnit::const_pred_iterator II = SuccSU->Preds.begin(),
1296 EE = SuccSU->Preds.end(); II != EE; ++II) {
1297 SUnit *PredSU = II->getSUnit();
1298 if (!PredSU->isScheduled)
1308 bool td_ls_rr_sort::operator()(const SUnit *left, const SUnit *right) const {
1309 unsigned LPriority = SPQ->getNodePriority(left);
1310 unsigned RPriority = SPQ->getNodePriority(right);
1311 bool LIsTarget = left->getNode() && left->getNode()->isMachineOpcode();
1312 bool RIsTarget = right->getNode() && right->getNode()->isMachineOpcode();
1313 bool LIsFloater = LIsTarget && left->NumPreds == 0;
1314 bool RIsFloater = RIsTarget && right->NumPreds == 0;
1315 unsigned LBonus = (LimitedSumOfUnscheduledPredsOfSuccs(left,1) == 1) ? 2 : 0;
1316 unsigned RBonus = (LimitedSumOfUnscheduledPredsOfSuccs(right,1) == 1) ? 2 : 0;
1318 if (left->NumSuccs == 0 && right->NumSuccs != 0)
1320 else if (left->NumSuccs != 0 && right->NumSuccs == 0)
1327 if (left->NumSuccs == 1)
1329 if (right->NumSuccs == 1)
1332 if (LPriority+LBonus != RPriority+RBonus)
1333 return LPriority+LBonus < RPriority+RBonus;
1335 if (left->getDepth() != right->getDepth())
1336 return left->getDepth() < right->getDepth();
1338 if (left->NumSuccsLeft != right->NumSuccsLeft)
1339 return left->NumSuccsLeft > right->NumSuccsLeft;
1341 assert(left->NodeQueueId && right->NodeQueueId &&
1342 "NodeQueueId cannot be zero");
1343 return (left->NodeQueueId > right->NodeQueueId);
1346 //===----------------------------------------------------------------------===//
1347 // Public Constructor Functions
1348 //===----------------------------------------------------------------------===//
1350 llvm::ScheduleDAGSDNodes *
1351 llvm::createBURRListDAGScheduler(SelectionDAGISel *IS, bool) {
1352 const TargetMachine &TM = IS->TM;
1353 const TargetInstrInfo *TII = TM.getInstrInfo();
1354 const TargetRegisterInfo *TRI = TM.getRegisterInfo();
1356 BURegReductionPriorityQueue *PQ = new BURegReductionPriorityQueue(TII, TRI);
1358 ScheduleDAGRRList *SD =
1359 new ScheduleDAGRRList(*IS->MF, true, PQ);
1360 PQ->setScheduleDAG(SD);
1364 llvm::ScheduleDAGSDNodes *
1365 llvm::createTDRRListDAGScheduler(SelectionDAGISel *IS, bool) {
1366 const TargetMachine &TM = IS->TM;
1367 const TargetInstrInfo *TII = TM.getInstrInfo();
1368 const TargetRegisterInfo *TRI = TM.getRegisterInfo();
1370 TDRegReductionPriorityQueue *PQ = new TDRegReductionPriorityQueue(TII, TRI);
1372 ScheduleDAGRRList *SD =
1373 new ScheduleDAGRRList(*IS->MF, false, PQ);
1374 PQ->setScheduleDAG(SD);