67       DEBUG(dbgs() << *II << " ");  in printDepMatrix()
68     DEBUG(dbgs() << "\n");  in printDepMatrix()
79     DEBUG(dbgs() << "Cannot handle loops of depth greater than "  in populateDependencyMatrix()
105   DEBUG(dbgs() << "Found " << MemInstr.size()  in populateDependencyMatrix()
120         DEBUG(dbgs() << "Found Dependency between Src=" << Src << " Des=" << Des  in populateDependencyMatrix()
125           DEBUG(dbgs() << "Flow dependence not handled");  in populateDependencyMatrix()
129           DEBUG(dbgs() << "Found Anti dependence \n");  in populateDependencyMatrix()
169             DEBUG(dbgs() << "Cannot handle more than " << MaxMemInstrCount  in populateDependencyMatrix()
281   DEBUG(dbgs() << "Calling populateWorklist called\n");  in populateWorklist()
464     DEBUG(dbgs() << "Worklist size = " << Worklist.size() << "\n");  in runOnFunction()
477         DEBUG(dbgs() << "Couldn't compute Backedge count\n");  in isComputableLoopNest()
481         DEBUG(dbgs() << "NumBackEdges is not equal to 1\n");  in isComputableLoopNest()
485         DEBUG(dbgs() << "Loop Doesn't have unique exit block\n");  in isComputableLoopNest()
503       DEBUG(dbgs() << "Loop doesn't contain minimum nesting level.\n");  in processLoopList()
507       DEBUG(dbgs() << "Not vaild loop candidate for interchange\n");  in processLoopList()
512     DEBUG(dbgs() << "Processing LoopList of size = " << LoopList.size()  in processLoopList()
517       DEBUG(dbgs() << "Populating Dependency matrix failed\n");  in processLoopList()
521     DEBUG(dbgs() << "Dependence before inter change \n");  in processLoopList()
543       DEBUG(dbgs() << "PHI Nodes in loop nest exit is not handled for now "  in processLoopList()
562       DEBUG(dbgs() << "Dependence after inter change \n");  in processLoopList()
574     DEBUG(dbgs() << "Processing Innder Loop Id = " << InnerLoopId  in processLoop()
582       DEBUG(dbgs() << "Not interchanging Loops. Cannot prove legality\n");  in processLoop()
585     DEBUG(dbgs() << "Loops are legal to interchange\n");  in processLoop()
588       DEBUG(dbgs() << "Interchanging Loops not profitable\n");  in processLoop()
595     DEBUG(dbgs() << "Loops interchanged\n");  in processLoop()
643   DEBUG(dbgs() << "Checking if Loops are Tightly Nested\n");  in tightlyNested()
659   DEBUG(dbgs() << "Checking instructions in Loop header and Loop latch \n");  in tightlyNested()
666   DEBUG(dbgs() << "Loops are perfectly nested \n");  in tightlyNested()
712           dbgs() << "Failed to recognize PHI as an induction or reduction.\n");  in findInductionAndReductions()
768     DEBUG(dbgs() << "We currently only support loops with 1 induction variable."  in currentLimitations()
790     DEBUG(dbgs() << "Loop structure not understood by pass\n");  in currentLimitations()
854     DEBUG(dbgs() << "Failed interchange InnerLoopId = " << InnerLoopId  in canInterchangeLoops()
885     DEBUG(dbgs() << "Not legal because of current transform limitation\n");  in canInterchangeLoops()
891     DEBUG(dbgs() << "Loops not tightly nested\n");  in canInterchangeLoops()
982   DEBUG(dbgs() << "Cost = " << Cost << "\n");  in isProfitable()
1026   DEBUG(dbgs() << "transform\n");  in transform()
1032     DEBUG(dbgs() << "Calling Split Inner Loop\n");  in transform()
1035       DEBUG(dbgs() << "Failed to find the point to split loop latch \n");  in transform()
1049     DEBUG(dbgs() << "splitInnerLoopLatch Done\n");  in transform()
1053     DEBUG(dbgs() << "splitInnerLoopHeader Done\n");  in transform()
1058     DEBUG(dbgs() << "adjustLoopLinks Failed\n");  in transform()
1101   DEBUG(dbgs() << "Output of splitInnerLoopHeader InnerLoopHeaderSucc & "  in splitInnerLoopHeader()
1130   DEBUG(dbgs() << "adjustLoopBranches called\n");  in adjustLoopBranches()