97 bool VLIWResourceModel::isResourceAvailable(SUnit *SU, bool IsTop) {  in isResourceAvailable()
138 bool VLIWResourceModel::reserveResources(SUnit *SU, bool IsTop) {  in reserveResources()
228     SUnit *SU = SchedImpl->pickNode(IsTopNode);  in schedule()  local
288 void ConvergingVLIWScheduler::releaseTopNode(SUnit *SU) {  in releaseTopNode()
304 void ConvergingVLIWScheduler::releaseBottomNode(SUnit *SU) {  in releaseBottomNode()
336 bool ConvergingVLIWScheduler::VLIWSchedBoundary::checkHazard(SUnit *SU) {  in checkHazard()
347 void ConvergingVLIWScheduler::VLIWSchedBoundary::releaseNode(SUnit *SU,  in releaseNode()
389 void ConvergingVLIWScheduler::VLIWSchedBoundary::bumpNode(SUnit *SU) {  in bumpNode()
427     SUnit *SU = *(Pending.begin()+i);  in releasePending()  local
447 void ConvergingVLIWScheduler::VLIWSchedBoundary::removeReady(SUnit *SU) {  in removeReady()
485       const ReadyQueue &Q, SUnit *SU, int Cost, PressureChange P) {  in traceCandidate()
521 static inline bool isSingleUnscheduledPred(SUnit *SU, SUnit *SU2) {  in isSingleUnscheduledPred()
536 static inline bool isSingleUnscheduledSucc(SUnit *SU, SUnit *SU2) {  in isSingleUnscheduledSucc()
553 int ConvergingVLIWScheduler::pressureChange(const SUnit *SU, bool isBotUp) {  in pressureChange()
576 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,  in SchedulingCost()
882   if (SUnit *SU = Bot.pickOnlyChoice()) {  in pickNodeBidrectional()  local
887   if (SUnit *SU = Top.pickOnlyChoice()) {  in pickNodeBidrectional()  local
951   SUnit *SU;  in pickNode()  local
994 void ConvergingVLIWScheduler::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()