Lines Matching full:trip

10 // trip counts.  See LoopUnroll.cpp for unrolling loops with compile-time
11 // trip counts.
14 // run-time trip count modulo the unroll factor is not 0.  When this is the
50           "Number of loops unrolled with run-time trip counts");
59 // Probability that the loop trip count is so small that after the prolog
61 // It is unlikely that the loop trip count is smaller than the unroll factor;
64 // Probability that the loop trip count is so small that we skip the unrolled
66 // It is unlikely that the loop trip count is smaller than the unroll factor;
72 /// 'extra' iterations if the run-time trip count modulo the
80 /// - Branch around the original loop if the trip count is less
201 /// 'extra' iterations if the run-time trip count modulo the
385       // Use an incrementing IV.  Pre-incr/post-incr is backedge/trip count.
386       // Subtle: NewIter can be 0 if we wrapped when computing the trip count,
545 /// run-time trip-count.
644   // Use Scalar Evolution to compute the trip count. This allows more loops to
649   // Only unroll loops with a computable trip count.
667     LLVM_DEBUG(dbgs() << "Could not compute trip count SCEV.\n");
678     LLVM_DEBUG(dbgs() << "High cost for expanding trip count scev!\n");
682   // This constraint lets us deal with an overflowing trip count easily; see the
687         << "Count failed constraint on overflow trip count calculation.\n");
763   //  extra iterations = run-time trip count % loop unroll factor
932     // Use an incrementing IV.  Pre-incr/post-incr is backedge/trip count.
933     // Subtle: TestVal can be 0 if we wrapped when computing the trip count,