Lines Matching refs:ConvergingVLIWScheduler

202 void ConvergingVLIWScheduler::initialize(ScheduleDAGMI *dag) {  in initialize()
228 void ConvergingVLIWScheduler::releaseTopNode(SUnit *SU) {  in releaseTopNode()
245 void ConvergingVLIWScheduler::releaseBottomNode(SUnit *SU) {  in releaseBottomNode()
277 bool ConvergingVLIWScheduler::VLIWSchedBoundary::checkHazard(SUnit *SU) {  in checkHazard()
288 void ConvergingVLIWScheduler::VLIWSchedBoundary::releaseNode(SUnit *SU,  in releaseNode()
303 void ConvergingVLIWScheduler::VLIWSchedBoundary::bumpCycle() {  in bumpCycle()
329 void ConvergingVLIWScheduler::VLIWSchedBoundary::bumpNode(SUnit *SU) {  in bumpNode()
359 void ConvergingVLIWScheduler::VLIWSchedBoundary::releasePending() {  in releasePending()
387 void ConvergingVLIWScheduler::VLIWSchedBoundary::removeReady(SUnit *SU) {  in removeReady()
399 SUnit *ConvergingVLIWScheduler::VLIWSchedBoundary::pickOnlyChoice() {  in pickOnlyChoice()
416 void ConvergingVLIWScheduler::traceCandidate(const char *Label,  in traceCandidate()
474 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,  in SchedulingCost()
539 ConvergingVLIWScheduler::CandResult ConvergingVLIWScheduler::
585 SUnit *ConvergingVLIWScheduler::pickNodeBidrectional(bool &IsTopNode) {  in pickNodeBidrectional()
643 SUnit *ConvergingVLIWScheduler::pickNode(bool &IsTopNode) {  in pickNode()
691 void ConvergingVLIWScheduler::schedNode(SUnit *SU, bool IsTopNode) {  in schedNode()