Lines Matching full:candidate
388 /// If this queue only has one ready candidate, return it. As a side effect,
469 SchedCandidate &Candidate,
528 /// Pick the best candidate from the top queue.
535 SchedCandidate &Candidate) {
541 // BestSU remains NULL if no top candidates beat the best existing candidate.
549 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
551 // Initialize the candidate if needed.
552 if (!Candidate.SU) {
553 Candidate.SU = *I;
554 Candidate.RPDelta = RPDelta;
555 Candidate.SCost = CurrentCost;
561 if (CurrentCost > Candidate.SCost) {
563 Candidate.SU = *I;
564 Candidate.RPDelta = RPDelta;
565 Candidate.SCost = CurrentCost;
571 // Only consider node order if Candidate was chosen from this Q.
578 /// Pick the best candidate node from either the top or bottom queue.
594 assert(BotResult != NoCand && "failed to find the first candidate");
596 // If either Q has a single candidate that provides the least increase in
607 // Check if the top Q has a better candidate.
611 assert(TopResult != NoCand && "failed to find the first candidate");
617 // If either Q has a single candidate that minimizes pressure above the
631 // Otherwise prefer the bottom candidate in node order.
650 assert(TopResult != NoCand && "failed to find the first candidate");
661 assert(BotResult != NoCand && "failed to find the first candidate");
