25   SUnit* LastSequentialCall = nullptr;  in postprocessDAG()
43 bool VLIWResourceModel::isResourceAvailable(SUnit *SU) {  in isResourceAvailable()
68     for (SUnit::const_succ_iterator I = Packet[i]->Succs.begin(),  in isResourceAvailable()
83 bool VLIWResourceModel::reserveResources(SUnit *SU) {  in reserveResources()
156   SmallVector<SUnit*, 8> TopRoots, BotRoots;  in schedule()
182   while (SUnit *SU = SchedImpl->pickNode(IsTopNode)) {  in schedule()
223 void ConvergingVLIWScheduler::releaseTopNode(SUnit *SU) {  in releaseTopNode()
227   for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in releaseTopNode()
240 void ConvergingVLIWScheduler::releaseBottomNode(SUnit *SU) {  in releaseBottomNode()
246   for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in releaseBottomNode()
272 bool ConvergingVLIWScheduler::VLIWSchedBoundary::checkHazard(SUnit *SU) {  in checkHazard()
283 void ConvergingVLIWScheduler::VLIWSchedBoundary::releaseNode(SUnit *SU,  in releaseNode()
324 void ConvergingVLIWScheduler::VLIWSchedBoundary::bumpNode(SUnit *SU) {  in bumpNode()
362     SUnit *SU = *(Pending.begin()+i);  in releasePending()
382 void ConvergingVLIWScheduler::VLIWSchedBoundary::removeReady(SUnit *SU) {  in removeReady()
394 SUnit *ConvergingVLIWScheduler::VLIWSchedBoundary::pickOnlyChoice() {  in pickOnlyChoice()
413                                              SUnit *SU, PressureChange P) {  in traceCandidate()
426 static SUnit *getSingleUnscheduledPred(SUnit *SU) {  in getSingleUnscheduledPred()
427   SUnit *OnlyAvailablePred = nullptr;  in getSingleUnscheduledPred()
428   for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in getSingleUnscheduledPred()
430     SUnit &Pred = *I->getSUnit();  in getSingleUnscheduledPred()
444 static SUnit *getSingleUnscheduledSucc(SUnit *SU) {  in getSingleUnscheduledSucc()
445   SUnit *OnlyAvailableSucc = nullptr;  in getSingleUnscheduledSucc()
446   for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in getSingleUnscheduledSucc()
448     SUnit &Succ = *I->getSUnit();  in getSingleUnscheduledSucc()
469 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,  in SchedulingCost()
507     for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in SchedulingCost()
513     for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in SchedulingCost()
580 SUnit *ConvergingVLIWScheduler::pickNodeBidrectional(bool &IsTopNode) {  in pickNodeBidrectional()
583   if (SUnit *SU = Bot.pickOnlyChoice()) {  in pickNodeBidrectional()
587   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidrectional()
638 SUnit *ConvergingVLIWScheduler::pickNode(bool &IsTopNode) {  in pickNode()
644   SUnit *SU;  in pickNode()
686 void ConvergingVLIWScheduler::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()