177   LLVM_DEBUG(dbgs() << "Packet[" << TotalPackets << "]:\n");  in reserveResources()
179     LLVM_DEBUG(dbgs() << "\t[" << i << "] SU(");  in reserveResources()
180     LLVM_DEBUG(dbgs() << Packet[i]->NodeNum << ")\t");  in reserveResources()
181     LLVM_DEBUG(Packet[i]->getInstr()->dump());  in reserveResources()
192   LLVM_DEBUG(dbgs() << "********** MI Converging Scheduling VLIW "  in schedule()
210   LLVM_DEBUG(unsigned maxH = 0;  in schedule()
215   LLVM_DEBUG(unsigned maxD = 0;  in schedule()
220   LLVM_DEBUG(dump());  in schedule()
226     LLVM_DEBUG(  in schedule()
245   LLVM_DEBUG({  in schedule()
384   LLVM_DEBUG(dbgs() << "*** Next cycle " << Available.getName() << " cycle "  in bumpCycle()
409     LLVM_DEBUG(dbgs() << "*** Max instrs at cycle " << CurrCycle << '\n');  in bumpNode()
413     LLVM_DEBUG(dbgs() << "*** IssueCount " << IssueCount << " at cycle "  in bumpNode()
587   LLVM_DEBUG(if (verbose) dbgs()  in SchedulingCost()
592     LLVM_DEBUG(dbgs() << "H|");  in SchedulingCost()
599       LLVM_DEBUG(if (verbose) dbgs() << "LB|");  in SchedulingCost()
603     LLVM_DEBUG(if (verbose) {  in SchedulingCost()
614       LLVM_DEBUG(if (verbose) dbgs() << "A|");  in SchedulingCost()
616       LLVM_DEBUG(if (verbose) dbgs() << " |");  in SchedulingCost()
619       LLVM_DEBUG(if (verbose) dbgs() << "LB|");  in SchedulingCost()
623     LLVM_DEBUG(if (verbose) {  in SchedulingCost()
634       LLVM_DEBUG(if (verbose) dbgs() << "A|");  in SchedulingCost()
636       LLVM_DEBUG(if (verbose) dbgs() << " |");  in SchedulingCost()
658   LLVM_DEBUG(if (verbose) {  in SchedulingCost()
680     LLVM_DEBUG(if (verbose) {  in SchedulingCost()
695       LLVM_DEBUG(if (verbose) dbgs() << "C|");  in SchedulingCost()
699       LLVM_DEBUG(if (verbose) dbgs() << "C|");  in SchedulingCost()
711         LLVM_DEBUG(if (verbose) dbgs() << "Z|");  in SchedulingCost()
720         LLVM_DEBUG(if (verbose) dbgs() << "Z|");  in SchedulingCost()
736           LLVM_DEBUG(if (verbose) dbgs() << "D|");  in SchedulingCost()
744           LLVM_DEBUG(if (verbose) dbgs() << "D|");  in SchedulingCost()
750   LLVM_DEBUG(if (verbose) {  in SchedulingCost()
768   LLVM_DEBUG(if (SchedDebugVerboseLevel > 1)  in pickNodeFromQueue()
787       LLVM_DEBUG(traceCandidate("DCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
800         LLVM_DEBUG(traceCandidate("NCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
811       LLVM_DEBUG(traceCandidate("CCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
824         LLVM_DEBUG(traceCandidate("WCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
843         LLVM_DEBUG(traceCandidate("SPCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
861         LLVM_DEBUG(traceCandidate("TCAND", Q, *I, CurrentCost));  in pickNodeFromQueue()
883     LLVM_DEBUG(dbgs() << "Picked only Bottom\n");  in pickNodeBidrectional()
888     LLVM_DEBUG(dbgs() << "Picked only Top\n");  in pickNodeBidrectional()
906     LLVM_DEBUG(dbgs() << "Prefered Bottom Node\n");  in pickNodeBidrectional()
917     LLVM_DEBUG(dbgs() << "Prefered Top Node\n");  in pickNodeBidrectional()
924     LLVM_DEBUG(dbgs() << "Prefered Bottom Node SingleMax\n");  in pickNodeBidrectional()
929     LLVM_DEBUG(dbgs() << "Prefered Top Node SingleMax\n");  in pickNodeBidrectional()
934     LLVM_DEBUG(dbgs() << "Prefered Top Node Cost\n");  in pickNodeBidrectional()
939   LLVM_DEBUG(dbgs() << "Prefered Bottom in Node order\n");  in pickNodeBidrectional()
982   LLVM_DEBUG(dbgs() << "*** " << (IsTopNode ? "Top" : "Bottom")  in pickNode()