reference, declarationdefinition
definition → references, declarations, derived classes, virtual overrides
reference to multiple definitions → definitions
unreferenced

References

include/llvm/CodeGen/MachineScheduler.h
  959     TopCand.SU = nullptr;
lib/CodeGen/MachineScheduler.cpp
 2740   TopCand.SU = nullptr;
 3173   if (!TopCand.isValid() || TopCand.SU->isScheduled ||
 3173   if (!TopCand.isValid() || TopCand.SU->isScheduled ||
 3174       TopCand.Policy != TopPolicy) {
 3175     TopCand.reset(CandPolicy());
 3176     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);
 3177     assert(TopCand.Reason != NoCand && "failed to find the first candidate");
 3179     LLVM_DEBUG(traceCandidate(TopCand));
 3185       assert(TCand.SU == TopCand.SU &&
 3193   assert(TopCand.isValid());
 3195   TopCand.Reason = NoCand;
 3196   tryCandidate(Cand, TopCand, nullptr);
 3197   if (TopCand.Reason != NoCand) {
 3198     Cand.setBest(TopCand);
 3220         TopCand.reset(NoPolicy);
 3221         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);
 3222         assert(TopCand.Reason != NoCand && "failed to find a candidate");
 3223         tracePick(TopCand);
 3224         SU = TopCand.SU;
lib/Target/AMDGPU/GCNSchedStrategy.cpp
  212   if (!TopCand.isValid() || TopCand.SU->isScheduled ||
  212   if (!TopCand.isValid() || TopCand.SU->isScheduled ||
  213       TopCand.Policy != TopPolicy) {
  214     TopCand.reset(CandPolicy());
  215     pickNodeFromQueue(Top, TopPolicy, DAG->getTopRPTracker(), TopCand);
  216     assert(TopCand.Reason != NoCand && "failed to find the first candidate");
  218     LLVM_DEBUG(traceCandidate(TopCand));
  224       assert(TCand.SU == TopCand.SU &&
  231   LLVM_DEBUG(dbgs() << "Top Cand: "; traceCandidate(TopCand);
  234   if (TopCand.Reason == BotCand.Reason) {
  236     GenericSchedulerBase::CandReason TopReason = TopCand.Reason;
  237     TopCand.Reason = NoCand;
  238     GenericScheduler::tryCandidate(Cand, TopCand, nullptr);
  239     if (TopCand.Reason != NoCand) {
  240       Cand.setBest(TopCand);
  242       TopCand.Reason = TopReason;
  245     if (TopCand.Reason == RegExcess && TopCand.RPDelta.Excess.getUnitInc() <= 0) {
  245     if (TopCand.Reason == RegExcess && TopCand.RPDelta.Excess.getUnitInc() <= 0) {
  246       Cand = TopCand;
  249     } else if (TopCand.Reason == RegCritical && TopCand.RPDelta.CriticalMax.getUnitInc() <= 0) {
  249     } else if (TopCand.Reason == RegCritical && TopCand.RPDelta.CriticalMax.getUnitInc() <= 0) {
  250       Cand = TopCand;
  254       if (BotCand.Reason > TopCand.Reason) {
  255         Cand = TopCand;
  281         TopCand.reset(NoPolicy);
  282         pickNodeFromQueue(Top, NoPolicy, DAG->getTopRPTracker(), TopCand);
  283         assert(TopCand.Reason != NoCand && "failed to find a candidate");
  284         SU = TopCand.SU;