179     void ReleaseSucc(SUnit *SU, SDep *SuccEdge);
180     void ReleaseSuccessors(SUnit *SU);
181     void ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle);
245     if (SUnit *SU = Sequence[i])  in dumpSchedule()  local
246       SU->dump(this);  in dumpSchedule()
403     for (const SUnit &SU : SUnits) {  in schedule()
404       SU.dumpAll(this);  in schedule()
438 void SchedulePostRATDList::ReleaseSucc(SUnit *SU, SDep *SuccEdge) {  in ReleaseSucc()  argument
473 void SchedulePostRATDList::ReleaseSuccessors(SUnit *SU) {  in ReleaseSuccessors()  argument
474   for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in ReleaseSuccessors()
476     ReleaseSucc(SU, &*I);  in ReleaseSuccessors()
483 void SchedulePostRATDList::ScheduleNodeTopDown(SUnit *SU, unsigned CurCycle) {  in ScheduleNodeTopDown()  argument
485   DEBUG(SU->dump(this));  in ScheduleNodeTopDown()
487   Sequence.push_back(SU);  in ScheduleNodeTopDown()
488   assert(CurCycle >= SU->getDepth() &&  in ScheduleNodeTopDown()
490   SU->setDepthToAtLeast(CurCycle);  in ScheduleNodeTopDown()
492   ReleaseSuccessors(SU);  in ScheduleNodeTopDown()
493   SU->isScheduled = true;  in ScheduleNodeTopDown()
494   AvailableQueue.scheduledNode(SU);  in ScheduleNodeTopDown()
662     if (SUnit *SU = Sequence[i])  in EmitSchedule()  local
663       BB->splice(RegionEnd, BB, SU->getInstr());  in EmitSchedule()