Lines Matching refs:LLVM_DEBUG
168 LLVM_DEBUG(dbgs() << "Found use of outer induction variable: "; U->dump()); in checkOuterInductionPhiUsers()
170 LLVM_DEBUG(dbgs() << "Did not match expected pattern, bailing\n"); in checkOuterInductionPhiUsers()
173 LLVM_DEBUG(dbgs() << "Use is optimisable\n"); in checkOuterInductionPhiUsers()
193 LLVM_DEBUG(dbgs() << "Checking linear i*M+j expression for: "; U->dump()); in matchLinearIVUser()
219 LLVM_DEBUG(dbgs() << "Matched multiplication: "; MatchedMul->dump()); in matchLinearIVUser()
220 LLVM_DEBUG(dbgs() << "Matched iteration count: "; MatchedItCount->dump()); in matchLinearIVUser()
227 LLVM_DEBUG(dbgs() << "Multiply has more than one use\n"); in matchLinearIVUser()
242 LLVM_DEBUG(dbgs() << "Looking for inner trip count: "; in matchLinearIVUser()
246 LLVM_DEBUG(dbgs() << "Found. This sse is optimisable\n"); in matchLinearIVUser()
252 LLVM_DEBUG(dbgs() << "Did not match expected pattern, bailing\n"); in matchLinearIVUser()
263 LLVM_DEBUG(dbgs() << "Checking User: "; U->dump()); in checkInnerInductionPhiUsers()
265 LLVM_DEBUG(dbgs() << "Use is inner loop increment, continuing\n"); in checkInnerInductionPhiUsers()
282 LLVM_DEBUG(dbgs() << "Use is the inner loop test, continuing\n"); in checkInnerInductionPhiUsers()
287 LLVM_DEBUG(dbgs() << "Not a linear IV user\n"); in checkInnerInductionPhiUsers()
290 LLVM_DEBUG(dbgs() << "Linear IV users found!\n"); in checkInnerInductionPhiUsers()
302 LLVM_DEBUG(dbgs() << "Found Increment: "; Increment->dump()); in setLoopComponents()
303 LLVM_DEBUG(dbgs() << "Found trip count: "; TripCount->dump()); in setLoopComponents()
304 LLVM_DEBUG(dbgs() << "Successfully found all loop components\n"); in setLoopComponents()
320 LLVM_DEBUG(dbgs() << "Backedge-taken count is not predictable\n"); in verifyTripCount()
345 LLVM_DEBUG(dbgs() << "Could not find valid trip count\n"); in verifyTripCount()
363 LLVM_DEBUG(dbgs() << "Could not find valid trip count\n"); in verifyTripCount()
368 LLVM_DEBUG(dbgs() << "Could not find valid trip count\n"); in verifyTripCount()
373 LLVM_DEBUG(dbgs() << "Could not find valid extended trip count\n"); in verifyTripCount()
385 LLVM_DEBUG(dbgs() << "Finding components of loop: " << L->getName() << "\n"); in findLoopComponents()
388 LLVM_DEBUG(dbgs() << "Loop is not in normal form\n"); in findLoopComponents()
395 LLVM_DEBUG(dbgs() << "Loop is not canonical\n"); in findLoopComponents()
403 LLVM_DEBUG(dbgs() << "Exiting and latch block are different\n"); in findLoopComponents()
412 LLVM_DEBUG(dbgs() << "Could not find induction PHI\n"); in findLoopComponents()
415 LLVM_DEBUG(dbgs() << "Found induction PHI: "; InductionPHI->dump()); in findLoopComponents()
430 LLVM_DEBUG(dbgs() << "Could not find valid comparison\n"); in findLoopComponents()
435 LLVM_DEBUG(dbgs() << "Found back branch: "; BackBranch->dump()); in findLoopComponents()
437 LLVM_DEBUG(dbgs() << "Found comparison: "; Compare->dump()); in findLoopComponents()
447 LLVM_DEBUG(dbgs() << "Could not find valid increment\n"); in findLoopComponents()
502 LLVM_DEBUG(dbgs() << "value modified in top of outer loop\n"); in checkPHIs()
513 LLVM_DEBUG(dbgs() << "could not find LCSSA PHI\n"); in checkPHIs()
520 LLVM_DEBUG( in checkPHIs()
525 LLVM_DEBUG(dbgs() << "PHI pair is safe:\n"); in checkPHIs()
526 LLVM_DEBUG(dbgs() << " Inner: "; InnerPHI.dump()); in checkPHIs()
527 LLVM_DEBUG(dbgs() << " Outer: "; OuterPHI->dump()); in checkPHIs()
536 LLVM_DEBUG(dbgs() << "found unsafe PHI in outer loop: "; OuterPHI.dump()); in checkPHIs()
541 LLVM_DEBUG(dbgs() << "checkPHIs: OK\n"); in checkPHIs()
562 LLVM_DEBUG(dbgs() << "Cannot flatten because instruction may have " in checkOuterLoopInsts()
586 LLVM_DEBUG(dbgs() << "Cost " << Cost << ": "; I.dump()); in checkOuterLoopInsts()
591 LLVM_DEBUG(dbgs() << "Cost of instructions that will be repeated: " in checkOuterLoopInsts()
596 LLVM_DEBUG(dbgs() << "checkOuterLoopInsts: not profitable, bailing.\n"); in checkOuterLoopInsts()
600 LLVM_DEBUG(dbgs() << "checkOuterLoopInsts: OK\n"); in checkOuterLoopInsts()
625 LLVM_DEBUG(dbgs() << "checkIVUsers: OK\n"; in checkIVUsers()
670 LLVM_DEBUG( in checkOverflow()
710 LLVM_DEBUG(dbgs() << "inner loop trip count not invariant\n"); in CanFlattenLoopPair()
714 LLVM_DEBUG(dbgs() << "outer loop trip count not invariant\n"); in CanFlattenLoopPair()
736 LLVM_DEBUG(dbgs() << "CanFlattenLoopPair: OK\n"); in CanFlattenLoopPair()
745 LLVM_DEBUG(dbgs() << "Checks all passed, doing the transformation\n"); in DoFlattenLoopPair()
758 LLVM_DEBUG(dbgs() << "Created new trip count in preheader: "; in DoFlattenLoopPair()
806 LLVM_DEBUG(dbgs() << "Replacing: "; V->dump(); dbgs() << "with: "; in DoFlattenLoopPair()
829 LLVM_DEBUG(dbgs() << "Widening the IVs is disabled\n"); in CanWidenIV()
833 LLVM_DEBUG(dbgs() << "Try widening the IVs\n"); in CanWidenIV()
848 LLVM_DEBUG(dbgs() << "Can't widen the IV\n"); in CanWidenIV()
863 LLVM_DEBUG(dbgs() << "Created wide phi: "; WidePhi->dump()); in CanWidenIV()
864 LLVM_DEBUG(dbgs() << "Deleting old phi: "; WideIV.NarrowIV->dump()); in CanWidenIV()
895 LLVM_DEBUG( in FlattenLoopPair()
933 LLVM_DEBUG(dbgs() << "Multiply would always overflow, so not profitable\n"); in FlattenLoopPair()
936 LLVM_DEBUG(dbgs() << "Multiply might overflow, not flattening\n"); in FlattenLoopPair()
940 LLVM_DEBUG(dbgs() << "Multiply cannot overflow, modifying loop in-place\n"); in FlattenLoopPair()