Lines Matching defs:SU

77   void releaseSucc(SUnit *SU, const SDep &D);
78   void releaseSuccessors(SUnit *SU);
79   void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
105 void ScheduleDAGVLIW::releaseSucc(SUnit *SU, const SDep &D) {
120   SuccSU->setDepthToAtLeast(SU->getDepth() + D.getLatency());
129 void ScheduleDAGVLIW::releaseSuccessors(SUnit *SU) {
131   for (SDep &Succ : SU->Succs) {
135     releaseSucc(SU, Succ);
142 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {
144   LLVM_DEBUG(dumpNode(*SU));
146   Sequence.push_back(SU);
147   assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");
148   SU->setDepthToAtLeast(CurCycle);
150   releaseSuccessors(SU);
151   SU->isScheduled = true;
152   AvailableQueue->scheduledNode(SU);
164   for (SUnit &SU : SUnits) {
166     if (SU.Preds.empty()) {
167       AvailableQueue->push(&SU);
168       SU.isAvailable = true;