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()
184     SUnit *SU = SchedImpl->pickNode(IsTopNode);  in schedule()
228 void ConvergingVLIWScheduler::releaseTopNode(SUnit *SU) {  in releaseTopNode()
232   for (SUnit::succ_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in releaseTopNode()
245 void ConvergingVLIWScheduler::releaseBottomNode(SUnit *SU) {  in releaseBottomNode()
251   for (SUnit::succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in releaseBottomNode()
277 bool ConvergingVLIWScheduler::VLIWSchedBoundary::checkHazard(SUnit *SU) {  in checkHazard()
288 void ConvergingVLIWScheduler::VLIWSchedBoundary::releaseNode(SUnit *SU,  in releaseNode()
329 void ConvergingVLIWScheduler::VLIWSchedBoundary::bumpNode(SUnit *SU) {  in bumpNode()
367     SUnit *SU = *(Pending.begin()+i);  in releasePending()
387 void ConvergingVLIWScheduler::VLIWSchedBoundary::removeReady(SUnit *SU) {  in removeReady()
399 SUnit *ConvergingVLIWScheduler::VLIWSchedBoundary::pickOnlyChoice() {  in pickOnlyChoice()
418                                              SUnit *SU, PressureChange P) {  in traceCandidate()
431 static SUnit *getSingleUnscheduledPred(SUnit *SU) {  in getSingleUnscheduledPred()
432   SUnit *OnlyAvailablePred = nullptr;  in getSingleUnscheduledPred()
433   for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in getSingleUnscheduledPred()
435     SUnit &Pred = *I->getSUnit();  in getSingleUnscheduledPred()
449 static SUnit *getSingleUnscheduledSucc(SUnit *SU) {  in getSingleUnscheduledSucc()
450   SUnit *OnlyAvailableSucc = nullptr;  in getSingleUnscheduledSucc()
451   for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in getSingleUnscheduledSucc()
453     SUnit &Succ = *I->getSUnit();  in getSingleUnscheduledSucc()
474 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,  in SchedulingCost()
512     for (SUnit::const_succ_iterator I = SU->Succs.begin(), E = SU->Succs.end();  in SchedulingCost()
518     for (SUnit::const_pred_iterator I = SU->Preds.begin(), E = SU->Preds.end();  in SchedulingCost()
585 SUnit *ConvergingVLIWScheduler::pickNodeBidrectional(bool &IsTopNode) {  in pickNodeBidrectional()
588   if (SUnit *SU = Bot.pickOnlyChoice()) {  in pickNodeBidrectional()
592   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidrectional()
643 SUnit *ConvergingVLIWScheduler::pickNode(bool &IsTopNode) {  in pickNode()
649   SUnit *SU;  in pickNode()
691 void ConvergingVLIWScheduler::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()