Lines Matching defs:Q
511 const ReadyQueue &Q, SUnit *SU,
513 dbgs() << Label << " " << Q.getName() << " ";
526 ReadyQueue &Q) {
529 dbgs() << ">>> " << Q.getName() << "\n";
530 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
538 SchedulingCost(Q, *I, Candidate, RPDelta, true);
596 int ConvergingVLIWScheduler::SchedulingCost(ReadyQueue &Q, SUnit *SU,
608 << ((Q.getID() == TopQID) ? "(top|" : "(bot|"));
617 if (Q.getID() == TopQID) {
660 if (Q.getID() == TopQID) {
696 if (IsAvailableAmt && pressureChange(SU, Q.getID() != TopQID) > 0 &&
709 if (Q.getID() == TopQID && getWeakLeft(SU, true) == 0) {
718 } else if (Q.getID() == BotQID && getWeakLeft(SU, false) == 0) {
735 if (Q.getID() == TopQID) {
772 ReadyQueue &Q = Zone.Available;
774 readyQueueVerboseDump(RPTracker, Candidate, Q);
775 else Q.dump(););
782 for (ReadyQueue::iterator I = Q.begin(), E = Q.end(); I != E; ++I) {
788 int CurrentCost = SchedulingCost(Q, *I, Candidate, RPDelta, false);
792 LLVM_DEBUG(traceCandidate("DCAND", Q, *I, CurrentCost));
803 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) ||
804 (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) {
805 LLVM_DEBUG(traceCandidate("NCAND", Q, *I, CurrentCost));
816 LLVM_DEBUG(traceCandidate("CCAND", Q, *I, CurrentCost));
825 unsigned CurrWeak = getWeakLeft(*I, (Q.getID() == TopQID));
826 unsigned CandWeak = getWeakLeft(Candidate.SU, (Q.getID() == TopQID));
829 LLVM_DEBUG(traceCandidate("WCAND", Q, *I, CurrentCost));
840 if (Q.getID() == TopQID) {
848 LLVM_DEBUG(traceCandidate("SPCAND", Q, *I, CurrentCost));
864 if ((Q.getID() == TopQID && (*I)->NodeNum < Candidate.SU->NodeNum) ||
865 (Q.getID() == BotQID && (*I)->NodeNum > Candidate.SU->NodeNum)) {
866 LLVM_DEBUG(traceCandidate("TCAND", Q, *I, CurrentCost));
876 // Only consider node order if Candidate was chosen from this Q.
903 // If either Q has a single candidate that provides the least increase in
904 // Excess pressure, we can immediately schedule from that Q.
907 // affects picking from either Q. If scheduling in one direction must
915 // Check if the top Q has a better candidate.
926 // If either Q has a single candidate that minimizes pressure above the