68       DEBUG(dbgs() << *II << " ");  in printDepMatrix()
69     DEBUG(dbgs() << "\n");  in printDepMatrix()
80     DEBUG(dbgs() << "Cannot handle loops of depth greater than "  in populateDependencyMatrix()
106   DEBUG(dbgs() << "Found " << MemInstr.size()  in populateDependencyMatrix()
121         DEBUG(dbgs() << "Found Dependency between Src=" << Src << " Des=" << Des  in populateDependencyMatrix()
126           DEBUG(dbgs() << "Flow dependence not handled");  in populateDependencyMatrix()
130           DEBUG(dbgs() << "Found Anti dependence \n");  in populateDependencyMatrix()
170             DEBUG(dbgs() << "Cannot handle more than " << MaxMemInstrCount  in populateDependencyMatrix()
282   DEBUG(dbgs() << "Calling populateWorklist called\n");  in populateWorklist()
465     DEBUG(dbgs() << "Worklist size = " << Worklist.size() << "\n");  in runOnFunction()
479         DEBUG(dbgs() << "Couldn't compute Backedge count\n");  in isComputableLoopNest()
483         DEBUG(dbgs() << "NumBackEdges is not equal to 1\n");  in isComputableLoopNest()
487         DEBUG(dbgs() << "Loop Doesn't have unique exit block\n");  in isComputableLoopNest()
505       DEBUG(dbgs() << "Loop doesn't contain minimum nesting level.\n");  in processLoopList()
509       DEBUG(dbgs() << "Not vaild loop candidate for interchange\n");  in processLoopList()
514     DEBUG(dbgs() << "Processing LoopList of size = " << LoopList.size()  in processLoopList()
519       DEBUG(dbgs() << "Populating Dependency matrix failed\n");  in processLoopList()
523     DEBUG(dbgs() << "Dependence before inter change \n");  in processLoopList()
545       DEBUG(dbgs() << "PHI Nodes in loop nest exit is not handled for now "  in processLoopList()
564       DEBUG(dbgs() << "Dependence after inter change \n");  in processLoopList()
576     DEBUG(dbgs() << "Processing Innder Loop Id = " << InnerLoopId  in processLoop()
584       DEBUG(dbgs() << "Not interchanging Loops. Cannot prove legality\n");  in processLoop()
587     DEBUG(dbgs() << "Loops are legal to interchange\n");  in processLoop()
590       DEBUG(dbgs() << "Interchanging Loops not profitable\n");  in processLoop()
597     DEBUG(dbgs() << "Loops interchanged\n");  in processLoop()
645   DEBUG(dbgs() << "Checking if Loops are Tightly Nested\n");  in tightlyNested()
661   DEBUG(dbgs() << "Checking instructions in Loop header and Loop latch \n");  in tightlyNested()
668   DEBUG(dbgs() << "Loops are perfectly nested \n");  in tightlyNested()
714           dbgs() << "Failed to recognize PHI as an induction or reduction.\n");  in findInductionAndReductions()
770     DEBUG(dbgs() << "We currently only support loops with 1 induction variable."  in currentLimitations()
792     DEBUG(dbgs() << "Loop structure not understood by pass\n");  in currentLimitations()
857     DEBUG(dbgs() << "Failed interchange InnerLoopId = " << InnerLoopId  in canInterchangeLoops()
888     DEBUG(dbgs() << "Not legal because of current transform limitation\n");  in canInterchangeLoops()
894     DEBUG(dbgs() << "Loops not tightly nested\n");  in canInterchangeLoops()
986   DEBUG(dbgs() << "Cost = " << Cost << "\n");  in isProfitable()
1030   DEBUG(dbgs() << "transform\n");  in transform()
1036     DEBUG(dbgs() << "Calling Split Inner Loop\n");  in transform()
1039       DEBUG(dbgs() << "Failed to find the point to split loop latch \n");  in transform()
1053     DEBUG(dbgs() << "splitInnerLoopLatch Done\n");  in transform()
1057     DEBUG(dbgs() << "splitInnerLoopHeader Done\n");  in transform()
1062     DEBUG(dbgs() << "adjustLoopLinks Failed\n");  in transform()
1113   DEBUG(dbgs() << "Output of splitInnerLoopHeader InnerLoopHeaderSucc & "  in splitInnerLoopHeader()
1156   DEBUG(dbgs() << "adjustLoopBranches called\n");  in adjustLoopBranches()