Lines Matching refs:dbgs
175 LLVM_DEBUG(dbgs() << "Found use of outer induction variable: "; U->dump()); in checkOuterInductionPhiUsers()
177 LLVM_DEBUG(dbgs() << "Did not match expected pattern, bailing\n"); in checkOuterInductionPhiUsers()
180 LLVM_DEBUG(dbgs() << "Use is optimisable\n"); in checkOuterInductionPhiUsers()
200 LLVM_DEBUG(dbgs() << "Checking linear i*M+j expression for: "; U->dump()); in matchLinearIVUser()
226 LLVM_DEBUG(dbgs() << "Matched multiplication: "; MatchedMul->dump()); in matchLinearIVUser()
227 LLVM_DEBUG(dbgs() << "Matched iteration count: "; MatchedItCount->dump()); in matchLinearIVUser()
234 LLVM_DEBUG(dbgs() << "Multiply has more than one use\n"); in matchLinearIVUser()
249 LLVM_DEBUG(dbgs() << "Looking for inner trip count: "; in matchLinearIVUser()
253 LLVM_DEBUG(dbgs() << "Found. This sse is optimisable\n"); in matchLinearIVUser()
259 LLVM_DEBUG(dbgs() << "Did not match expected pattern, bailing\n"); in matchLinearIVUser()
270 LLVM_DEBUG(dbgs() << "Checking User: "; U->dump()); in checkInnerInductionPhiUsers()
272 LLVM_DEBUG(dbgs() << "Use is inner loop increment, continuing\n"); in checkInnerInductionPhiUsers()
289 LLVM_DEBUG(dbgs() << "Use is the inner loop test, continuing\n"); in checkInnerInductionPhiUsers()
294 LLVM_DEBUG(dbgs() << "Not a linear IV user\n"); in checkInnerInductionPhiUsers()
297 LLVM_DEBUG(dbgs() << "Linear IV users found!\n"); in checkInnerInductionPhiUsers()
309 LLVM_DEBUG(dbgs() << "Found Increment: "; Increment->dump()); in setLoopComponents()
310 LLVM_DEBUG(dbgs() << "Found trip count: "; TripCount->dump()); in setLoopComponents()
311 LLVM_DEBUG(dbgs() << "Successfully found all loop components\n"); in setLoopComponents()
327 LLVM_DEBUG(dbgs() << "Backedge-taken count is not predictable\n"); in verifyTripCount()
352 LLVM_DEBUG(dbgs() << "Could not find valid trip count\n"); in verifyTripCount()
370 LLVM_DEBUG(dbgs() << "Could not find valid trip count\n"); in verifyTripCount()
375 LLVM_DEBUG(dbgs() << "Could not find valid trip count\n"); in verifyTripCount()
380 LLVM_DEBUG(dbgs() << "Could not find valid extended trip count\n"); in verifyTripCount()
392 LLVM_DEBUG(dbgs() << "Finding components of loop: " << L->getName() << "\n"); in findLoopComponents()
395 LLVM_DEBUG(dbgs() << "Loop is not in normal form\n"); in findLoopComponents()
402 LLVM_DEBUG(dbgs() << "Loop is not canonical\n"); in findLoopComponents()
410 LLVM_DEBUG(dbgs() << "Exiting and latch block are different\n"); in findLoopComponents()
419 LLVM_DEBUG(dbgs() << "Could not find induction PHI\n"); in findLoopComponents()
422 LLVM_DEBUG(dbgs() << "Found induction PHI: "; InductionPHI->dump()); in findLoopComponents()
437 LLVM_DEBUG(dbgs() << "Could not find valid comparison\n"); in findLoopComponents()
442 LLVM_DEBUG(dbgs() << "Found back branch: "; BackBranch->dump()); in findLoopComponents()
444 LLVM_DEBUG(dbgs() << "Found comparison: "; Compare->dump()); in findLoopComponents()
454 LLVM_DEBUG(dbgs() << "Could not find valid increment\n"); in findLoopComponents()
509 LLVM_DEBUG(dbgs() << "value modified in top of outer loop\n"); in checkPHIs()
520 LLVM_DEBUG(dbgs() << "could not find LCSSA PHI\n"); in checkPHIs()
528 dbgs() << "LCSSA PHI incoming value does not match latch value\n"); in checkPHIs()
532 LLVM_DEBUG(dbgs() << "PHI pair is safe:\n"); in checkPHIs()
533 LLVM_DEBUG(dbgs() << " Inner: "; InnerPHI.dump()); in checkPHIs()
534 LLVM_DEBUG(dbgs() << " Outer: "; OuterPHI->dump()); in checkPHIs()
543 LLVM_DEBUG(dbgs() << "found unsafe PHI in outer loop: "; OuterPHI.dump()); in checkPHIs()
548 LLVM_DEBUG(dbgs() << "checkPHIs: OK\n"); in checkPHIs()
569 LLVM_DEBUG(dbgs() << "Cannot flatten because instruction may have " in checkOuterLoopInsts()
593 LLVM_DEBUG(dbgs() << "Cost " << Cost << ": "; I.dump()); in checkOuterLoopInsts()
598 LLVM_DEBUG(dbgs() << "Cost of instructions that will be repeated: " in checkOuterLoopInsts()
603 LLVM_DEBUG(dbgs() << "checkOuterLoopInsts: not profitable, bailing.\n"); in checkOuterLoopInsts()
607 LLVM_DEBUG(dbgs() << "checkOuterLoopInsts: OK\n"); in checkOuterLoopInsts()
632 LLVM_DEBUG(dbgs() << "checkIVUsers: OK\n"; in checkIVUsers()
633 dbgs() << "Found " << FI.LinearIVUses.size() in checkIVUsers()
636 dbgs() << " "; in checkIVUsers()
678 dbgs() << "use of linear IV would be UB if overflow occurred: "; in checkOverflow()
717 LLVM_DEBUG(dbgs() << "inner loop trip count not invariant\n"); in CanFlattenLoopPair()
721 LLVM_DEBUG(dbgs() << "outer loop trip count not invariant\n"); in CanFlattenLoopPair()
743 LLVM_DEBUG(dbgs() << "CanFlattenLoopPair: OK\n"); in CanFlattenLoopPair()
752 LLVM_DEBUG(dbgs() << "Checks all passed, doing the transformation\n"); in DoFlattenLoopPair()
766 LLVM_DEBUG(dbgs() << "Created new trip count in preheader: "; in DoFlattenLoopPair()
819 LLVM_DEBUG(dbgs() << "Replacing: "; V->dump(); dbgs() << "with: "; in DoFlattenLoopPair()
842 LLVM_DEBUG(dbgs() << "Widening the IVs is disabled\n"); in CanWidenIV()
846 LLVM_DEBUG(dbgs() << "Try widening the IVs\n"); in CanWidenIV()
861 LLVM_DEBUG(dbgs() << "Can't widen the IV\n"); in CanWidenIV()
876 LLVM_DEBUG(dbgs() << "Created wide phi: "; WidePhi->dump()); in CanWidenIV()
877 LLVM_DEBUG(dbgs() << "Deleting old phi: "; WideIV.NarrowIV->dump()); in CanWidenIV()
910 dbgs() << "Loop flattening running on outer loop " in FlattenLoopPair()
946 LLVM_DEBUG(dbgs() << "Multiply would always overflow, so not profitable\n"); in FlattenLoopPair()
952 LLVM_DEBUG(dbgs() << "Multiply might overflow, not flattening\n"); in FlattenLoopPair()
960 dbgs() << "Can't check overflow efficiently, not flattening\n"); in FlattenLoopPair()
963 LLVM_DEBUG(dbgs() << "Multiply might overflow, versioning loop\n"); in FlattenLoopPair()
989 LLVM_DEBUG(dbgs() << "Multiply cannot overflow, modifying loop in-place\n"); in FlattenLoopPair()