Lines Matching full:candidate
1135 /// Policy for scheduling the next instruction in the candidate's zone.
1168 // The best SUnit candidate.
1171 // The reason for this candidate.
1177 // Register pressure values for the best candidate.
1180 // Critical resource consumption of the best candidate.
1188 // Copy the status of another candidate without changing policy.
1190 assert(Best.Reason != NoCand && "uninitialized Sched candidate");
1445 SchedCandidate &Candidate);
1933 /// If this queue only has one ready candidate, return it. As a side effect,
2051 // If one candidate decreases and the other increases, go with it.
2097 /// Apply a set of heursitics to a new candidate. Heuristics are currently
2103 /// \param Cand provides the policy and current best candidate.
2104 /// \param TryCand refers to the next SUnit candidate, otherwise uninitialized.
2119 // Initialize the candidate if needed.
2288 /// Pick the best candidate from the top queue.
2324 /// Pick the best candidate node from either the top or bottom queue.
2346 assert(BotCand.Reason != NoCand && "failed to find the first candidate");
2348 // If either Q has a single candidate that provides the least increase in
2363 // Check if the top Q has a better candidate.
2365 assert(TopCand.Reason != NoCand && "failed to find the first candidate");
2373 // Otherwise prefer the bottom candidate, in node order if all else failed.
2394 assert(TopCand.Reason != NoCand && "failed to find the first candidate");
2405 assert(BotCand.Reason != NoCand && "failed to find the first candidate");
