reference, declaration → definition definition → references, declarations, derived classes, virtual overrides reference to multiple definitions → definitions unreferenced |
958 Top.releaseNode(SU, SU->TopReadyCycle);
lib/CodeGen/MachineScheduler.cpp2722 Top.init(DAG, SchedModel, &Rem); 2730 if (!Top.HazardRec) { 2731 Top.HazardRec = 3137 if (SUnit *SU = Top.pickOnlyChoice()) { 3145 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); 3149 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); 3176 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); 3184 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); 3210 assert(Top.Available.empty() && Top.Pending.empty() && 3210 assert(Top.Available.empty() && Top.Pending.empty() && 3217 SU = Top.pickOnlyChoice(); 3221 pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand); 3244 Top.removeReady(SU); 3286 SU->TopReadyCycle = std::max(SU->TopReadyCycle, Top.getCurrCycle()); 3287 Top.bumpNode(SU);lib/Target/AMDGPU/GCNSchedStrategy.cpp
177 if (SUnit *SU = Top.pickOnlyChoice()) { 184 setPolicy(BotPolicy, /*IsPostRA=*/false, Bot, &Top); 188 setPolicy(TopPolicy, /*IsPostRA=*/false, Top, &Bot); 215 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand); 223 pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TCand); 271 assert(Top.Available.empty() && Top.Pending.empty() && 271 assert(Top.Available.empty() && Top.Pending.empty() && 278 SU = Top.pickOnlyChoice(); 282 pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand); 303 Top.removeReady(SU);