Lines Matching full:trip

94                               "trip counts will never overflow"));
111 // inner loop trip count. We keep track of all different expressions on which
249     LLVM_DEBUG(dbgs() << "Looking for inner trip count: ";
310   LLVM_DEBUG(dbgs() << "Found trip count: "; TripCount->dump());
331   // Evaluating in the trip count's type can not overflow here as the overflow
346       // Find the extended backedge taken count and extended trip count using
352         LLVM_DEBUG(dbgs() << "Could not find valid trip count\n");
357     // to add one to get the trip count.
367   // the SCEV trip count is because the RHS is a ZExt or SExt instruction
368   // (and take the trip count to be the RHS).
370     LLVM_DEBUG(dbgs() << "Could not find valid trip count\n");
375     LLVM_DEBUG(dbgs() << "Could not find valid trip count\n");
380     LLVM_DEBUG(dbgs() << "Could not find valid extended trip count\n");
386 // Finds the induction variable, increment and trip count for a simple loop that
446   // Find increment and trip count.
457   // The trip count is the RHS of the compare. If this doesn't match the trip
458   // count computed by SCEV then this is because the trip count variable
714   // Both of the loop trip count values must be invariant in the outer loop
717     LLVM_DEBUG(dbgs() << "inner loop trip count not invariant\n");
721     LLVM_DEBUG(dbgs() << "outer loop trip count not invariant\n");
766     LLVM_DEBUG(dbgs() << "Created new trip count in preheader: ";
779   // Modify the trip count of the outer loop to be the product of the two
780   // trip counts.
856   // (OuterTripCount * InnerTripCount) as the new trip count is safe.
956       // If the trip count type isn't legal then it won't be possible to check