182   LLVM_DEBUG(dbgs() << "Packet[" << TotalPackets << "]:\n");  in reserveResources()
184     LLVM_DEBUG(dbgs() << "\t[" << i << "] SU(");  in reserveResources()
185     LLVM_DEBUG(dbgs() << Packet[i]->NodeNum << ")\t");  in reserveResources()
186     LLVM_DEBUG(Packet[i]->getInstr()->dump());  in reserveResources()
202   LLVM_DEBUG(dbgs() << "********** MI Converging Scheduling VLIW "  in schedule()
220   LLVM_DEBUG({  in schedule()
227   LLVM_DEBUG({  in schedule()
234   LLVM_DEBUG(dump());  in schedule()
242     LLVM_DEBUG(  in schedule()
262   LLVM_DEBUG({  in schedule()
406   LLVM_DEBUG(dbgs() << "*** Next cycle " << Available.getName() << " cycle "  in bumpCycle()
431     LLVM_DEBUG(dbgs() << "*** Max instrs at cycle " << CurrCycle << '\n');  in bumpNode()
434     LLVM_DEBUG(dbgs() << "*** IssueCount " << IssueCount << " at cycle "  in bumpNode()
604   LLVM_DEBUG(if (verbose) dbgs()  in SchedulingCost()
609     LLVM_DEBUG(dbgs() << "H|");  in SchedulingCost()
616       LLVM_DEBUG(if (verbose) dbgs() << "LB|");  in SchedulingCost()
620     LLVM_DEBUG(if (verbose) {  in SchedulingCost()
631       LLVM_DEBUG(if (verbose) dbgs() << "A|");  in SchedulingCost()
633       LLVM_DEBUG(if (verbose) dbgs() << " |");  in SchedulingCost()
636       LLVM_DEBUG(if (verbose) dbgs() << "LB|");  in SchedulingCost()
640     LLVM_DEBUG(if (verbose) {  in SchedulingCost()
651       LLVM_DEBUG(if (verbose) dbgs() << "A|");  in SchedulingCost()
653       LLVM_DEBUG(if (verbose) dbgs() << " |");  in SchedulingCost()
675   LLVM_DEBUG(if (verbose) {  in SchedulingCost()
697     LLVM_DEBUG(if (verbose) {  in SchedulingCost()
712         LLVM_DEBUG(if (verbose) dbgs() << "Z|");  in SchedulingCost()
721         LLVM_DEBUG(if (verbose) dbgs() << "Z|");  in SchedulingCost()
737           LLVM_DEBUG(if (verbose) dbgs() << "D|");  in SchedulingCost()
745           LLVM_DEBUG(if (verbose) dbgs() << "D|");  in SchedulingCost()
751   LLVM_DEBUG(if (verbose) {  in SchedulingCost()
770   LLVM_DEBUG(if (SchedDebugVerboseLevel > 1)  in pickNodeFromQueue()
789       LLVM_DEBUG(traceCandidate("DCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
802         LLVM_DEBUG(traceCandidate("NCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
813       LLVM_DEBUG(traceCandidate("CCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
826         LLVM_DEBUG(traceCandidate("WCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
845         LLVM_DEBUG(traceCandidate("SPCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
863         LLVM_DEBUG(traceCandidate("TCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
885     LLVM_DEBUG(dbgs() << "Picked only Bottom\n");  in pickNodeBidrectional()
890     LLVM_DEBUG(dbgs() << "Picked only Top\n");  in pickNodeBidrectional()
908     LLVM_DEBUG(dbgs() << "Prefered Bottom Node\n");  in pickNodeBidrectional()
919     LLVM_DEBUG(dbgs() << "Prefered Top Node\n");  in pickNodeBidrectional()
926     LLVM_DEBUG(dbgs() << "Prefered Bottom Node SingleMax\n");  in pickNodeBidrectional()
931     LLVM_DEBUG(dbgs() << "Prefered Top Node SingleMax\n");  in pickNodeBidrectional()
936     LLVM_DEBUG(dbgs() << "Prefered Top Node Cost\n");  in pickNodeBidrectional()
941   LLVM_DEBUG(dbgs() << "Prefered Bottom in Node order\n");  in pickNodeBidrectional()
984   LLVM_DEBUG(dbgs() << "*** " << (IsTopNode ? "Top" : "Bottom")  in pickNode()