89   void scheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
154 void ScheduleDAGVLIW::scheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {  in scheduleNodeTopDown()  argument
155   DEBUG(dbgs() << "*** Scheduling [" << CurCycle << "]: ");  in scheduleNodeTopDown()
159   assert(CurCycle >= SU->getDepth() && "Node scheduled above its depth!");  in scheduleNodeTopDown()
160   SU->setDepthToAtLeast(CurCycle);  in scheduleNodeTopDown()
170   unsigned CurCycle = 0;  in listScheduleTopDown()  local
192       if (PendingQueue[i]->getDepth() == CurCycle) {  in listScheduleTopDown()
200         assert(PendingQueue[i]->getDepth() > CurCycle && "Negative latency?");  in listScheduleTopDown()
209       ++CurCycle;  in listScheduleTopDown()
240       scheduleNodeTopDown(FoundSUnit, CurCycle);  in listScheduleTopDown()
246         ++CurCycle;  in listScheduleTopDown()
253       ++CurCycle;  in listScheduleTopDown()
262       ++CurCycle;  in listScheduleTopDown()