633       DEBUG(dbgs() << "missed hint " << PrintReg(Hint, TRI) << '\n');  in tryAssign()
649   DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " is available at cost " << Cost  in tryAssign()
679     DEBUG(dbgs() << "can reassign: " << VirtReg << " from "  in canReassign()
708     DEBUG(dbgs() << "should evict: " << B << " w= " << B.weight << '\n');  in shouldEvict()
814   DEBUG(dbgs() << "evicting " << PrintReg(PhysReg, TRI)  in evictInterference()
878       DEBUG(dbgs() << TRI->getRegClassName(RC) << " minimum cost = " << MinCost  in tryEvict()
887       DEBUG(dbgs() << "Only trying the first " << OrderLimit << " regs.\n");  in tryEvict()
898       DEBUG(dbgs() << PrintReg(PhysReg, TRI) << " would clobber CSR "  in tryEvict()
1083   DEBUG(dbgs() << ", v=" << Visited);  in growRegion()
1101   DEBUG(dbgs() << "Compact region bundles");  in calcCompactRegion()
1110     DEBUG(dbgs() << ", none.\n");  in calcCompactRegion()
1118     DEBUG(dbgs() << ", none.\n");  in calcCompactRegion()
1125     dbgs() << " EB#" << i;  in calcCompactRegion()
1126     dbgs() << ".\n";  in calcCompactRegion()
1210   DEBUG(dbgs() << "splitAroundRegion with " << NumGlobalIntvs << " globals.\n");  in splitAroundRegion()
1247       DEBUG(dbgs() << "BB#" << BI.MBB->getNumber() << " isolated.\n");  in splitAroundRegion()
1329         DEBUG(dbgs() << "Main interval covers the same " << OrigBlocks  in splitAroundRegion()
1360     DEBUG(dbgs() << "Cost of isolating all blocks = ";  in tryRegionSplit()
1361                  MBFI->printBlockFreq(dbgs(), BestCost) << '\n');  in tryRegionSplit()
1412       DEBUG(dbgs() << PrintReg(PhysReg, TRI) << "\tno positive bundles\n");  in calculateRegionSplitCost()
1415     DEBUG(dbgs() << PrintReg(PhysReg, TRI) << "\tstatic = ";  in calculateRegionSplitCost()
1416                  MBFI->printBlockFreq(dbgs(), Cost));  in calculateRegionSplitCost()
1420           dbgs() << " worse than no bundles\n";  in calculateRegionSplitCost()
1422           dbgs() << " worse than "  in calculateRegionSplitCost()
1433       DEBUG(dbgs() << " no bundles.\n");  in calculateRegionSplitCost()
1439       dbgs() << ", total = "; MBFI->printBlockFreq(dbgs(), Cost)  in calculateRegionSplitCost()
1443         dbgs() << " EB#" << i;  in calculateRegionSplitCost()
1444       dbgs() << ".\n";  in calculateRegionSplitCost()
1472       DEBUG(dbgs() << "Split for " << PrintReg(Cand.PhysReg, TRI) << " in "  in doRegionSplit()
1485       DEBUG(dbgs() << "Split for compact region in " << B << " bundles, intv "  in doRegionSplit()
1587   DEBUG(dbgs() << "Split around " << Uses.size() << " individual instrs.\n");  in tryInstructionSplit()
1602         DEBUG(dbgs() << "    skip:\t" << Uses[i] << '\t' << *MI);  in tryInstructionSplit()
1612     DEBUG(dbgs() << "All uses were copies.\n");  in tryInstructionSplit()
1733     dbgs() << "tryLocalSplit: ";  in tryLocalSplit()
1735       dbgs() << ' ' << Uses[i];  in tryLocalSplit()
1736     dbgs() << '\n';  in tryLocalSplit()
1745     DEBUG(dbgs() << RMS.size() << " regmasks in block:");  in tryLocalSplit()
1759       DEBUG(dbgs() << ' ' << RMS[ri] << ':' << Uses[i] << '-' << Uses[i+1]);  in tryLocalSplit()
1766     DEBUG(dbgs() << '\n');  in tryLocalSplit()
1825       DEBUG(dbgs() << PrintReg(PhysReg, TRI) << ' '  in tryLocalSplit()
1831         DEBUG(dbgs() << " all\n");  in tryLocalSplit()
1856         DEBUG(dbgs() << " w=" << EstWeight);  in tryLocalSplit()
1861             DEBUG(dbgs() << " (best)");  in tryLocalSplit()
1872           DEBUG(dbgs() << " shrink\n");  in tryLocalSplit()
1886         DEBUG(dbgs() << " end\n");  in tryLocalSplit()
1890       DEBUG(dbgs() << " extend\n");  in tryLocalSplit()
1899   DEBUG(dbgs() << "Best local split range: " << Uses[BestBefore]  in tryLocalSplit()
1921     DEBUG(dbgs() << "Tagging non-progress ranges: ");  in tryLocalSplit()
1926         DEBUG(dbgs() << PrintReg(LREdit.get(i)));  in tryLocalSplit()
1928     DEBUG(dbgs() << '\n');  in tryLocalSplit()
2010       DEBUG(dbgs() << "Early abort: too many interferences.\n");  in mayRecolorAllInterferences()
2021         DEBUG(dbgs() << "Early abort: the inteference is not recolorable.\n");  in mayRecolorAllInterferences()
2074   DEBUG(dbgs() << "Try last chance recoloring for " << VirtReg << '\n');  in tryLastChanceRecoloring()
2083     DEBUG(dbgs() << "Abort because max depth has been reached.\n");  in tryLastChanceRecoloring()
2099     DEBUG(dbgs() << "Try to assign: " << VirtReg << " to "  in tryLastChanceRecoloring()
2107       DEBUG(dbgs() << "Some inteferences are not with virtual registers.\n");  in tryLastChanceRecoloring()
2116       DEBUG(dbgs() << "Some inteferences cannot be recolored.\n");  in tryLastChanceRecoloring()
2155     DEBUG(dbgs() << "Fail to assign: " << VirtReg << " to "  in tryLastChanceRecoloring()
2191     DEBUG(dbgs() << "Try to recolor: " << *LI << '\n');  in tryRecoloringCandidates()
2196     DEBUG(dbgs() << "Recoloring of " << *LI  in tryRecoloringCandidates()
2363   DEBUG(dbgs() << "Trying to reconcile hints for: " << PrintReg(Reg, TRI) << '('  in tryHintRecoloring()
2385     DEBUG(dbgs() << PrintReg(Reg, TRI) << '(' << PrintReg(CurrPhys, TRI)  in tryHintRecoloring()
2394       DEBUG(dbgs() << "Checking profitability:\n");  in tryHintRecoloring()
2397       DEBUG(dbgs() << "Old Cost: " << OldCopiesCost.getFrequency()  in tryHintRecoloring()
2400         DEBUG(dbgs() << "=> Not profitable.\n");  in tryHintRecoloring()
2406       DEBUG(dbgs() << "=> Profitable.\n");  in tryHintRecoloring()
2492   DEBUG(dbgs() << StageName[Stage]  in selectOrSplitImpl()
2519     DEBUG(dbgs() << "wait for second round\n");  in selectOrSplitImpl()
2542     DEBUG(dbgs() << "Do as if this register is in memory\n");  in selectOrSplitImpl()
2560   DEBUG(dbgs() << "********** GREEDY REGISTER ALLOCATION **********\n"  in runOnMachineFunction()