87   void releaseSucc(SUnit *SU, const SDep &D);
88   void releaseSuccessors(SUnit *SU);
89   void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
116 void ScheduleDAGVLIW::releaseSucc(SUnit *SU, const SDep &D) {  in releaseSucc()  argument
131   SuccSU->setDepthToAtLeast(SU->getDepth() + D.getLatency());  in releaseSucc()
140 void ScheduleDAGVLIW::releaseSuccessors(SUnit *SU) {  in releaseSuccessors()  argument
142   for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in releaseSuccessors()
147     releaseSucc(SU, *I);  in releaseSuccessors()
154 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {  in scheduleNodeTopDown()  argument
156   DEBUG(SU->dump(this));  in scheduleNodeTopDown()
158   Sequence.push_back(SU);  in scheduleNodeTopDown()
159   assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");  in scheduleNodeTopDown()
160   SU->setDepthToAtLeast(CurCycle);  in scheduleNodeTopDown()
162   releaseSuccessors(SU);  in scheduleNodeTopDown()
163   SU->isScheduled = true;  in scheduleNodeTopDown()
164   AvailableQueue->scheduledNode(SU);  in scheduleNodeTopDown()