Lines Matching refs:Reason
1132 static const char *getReasonStr(ConvergingScheduler::CandReason Reason);
1171 // The reason for this candidate.
1172 CandReason Reason;
1184 : Policy(policy), SU(NULL), Reason(NoCand), RepeatReasonSet(0) {}
1190 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
1192 Reason = Best.Reason;
1877 // If we stall for any reason, bump the cycle.
2010 ConvergingScheduler::CandReason Reason) {
2012 TryCand.Reason = Reason;
2016 if (Cand.Reason > Reason)
2017 Cand.Reason = Reason;
2020 Cand.setRepeat(Reason);
2027 ConvergingScheduler::CandReason Reason) {
2029 TryCand.Reason = Reason;
2033 if (Cand.Reason > Reason)
2034 Cand.Reason = Reason;
2037 Cand.setRepeat(Reason);
2045 ConvergingScheduler::CandReason Reason) {
2049 Reason);
2053 Reason)) {
2062 return tryGreater(TryRank, CandRank, TryCand, Cand, Reason);
2121 TryCand.Reason = NodeOrder;
2208 TryCand.Reason = NodeOrder;
2214 ConvergingScheduler::CandReason Reason) {
2215 switch (Reason) {
2232 llvm_unreachable("Unknown reason!");
2239 switch (Cand.Reason) {
2270 dbgs() << " SU(" << Cand.SU->NodeNum << ") " << getReasonStr(Cand.Reason);
2308 if (TryCand.Reason != NoCand) {
2321 << ConvergingScheduler::getReasonStr(Cand.Reason) << '\n');
2346 assert(BotCand.Reason != NoCand && "failed to find the first candidate");
2355 if ((BotCand.Reason == RegExcess && !BotCand.isRepeat(RegExcess))
2356 || (BotCand.Reason == RegCritical
2365 assert(TopCand.Reason != NoCand && "failed to find the first candidate");
2367 // Choose the queue with the most important (lowest enum) reason.
2368 if (TopCand.Reason < BotCand.Reason) {
2394 assert(TopCand.Reason != NoCand && "failed to find the first candidate");
2405 assert(BotCand.Reason != NoCand && "failed to find the first candidate");
