Lines Matching defs:SU
81 void releaseSucc(SUnit *SU, const SDep &D);
82 void releaseSuccessors(SUnit *SU);
83 void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
109 void ScheduleDAGVLIW::releaseSucc(SUnit *SU, const SDep &D) {
124 SuccSU->setDepthToAtLeast(SU->getDepth() + D.getLatency());
133 void ScheduleDAGVLIW::releaseSuccessors(SUnit *SU) {
135 for (SDep &Succ : SU->Succs) {
139 releaseSucc(SU, Succ);
146 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
148 LLVM_DEBUG(dumpNode(*SU));
150 Sequence.push_back(SU);
151 assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");
152 SU->setDepthToAtLeast(CurCycle);
154 releaseSuccessors(SU);
155 SU->isScheduled = true;
156 AvailableQueue->scheduledNode(SU);
168 for (SUnit &SU : SUnits) {
170 if (SU.Preds.empty()) {
171 AvailableQueue->push(&SU);
172 SU.isAvailable = true;