Lines Matching full:iterations
2422 // When we can't determine the number of iterations for a loop,
2447 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations;
2646 if (Bound[K].Iterations) {
2649 Bound[K].Iterations);
2652 Bound[K].Iterations);
2655 // If the difference is 0, we won't need to know the number of iterations.
2687 if (Bound[K].Iterations) {
2691 SE->getMulExpr(NegativePart, Bound[K].Iterations);
2694 SE->getMulExpr(PositivePart, Bound[K].Iterations);
2698 // we won't need to know the number of iterations.
2729 if (Bound[K].Iterations) {
2731 SE->getMinusSCEV(Bound[K].Iterations,
2732 SE->getConstant(Bound[K].Iterations->getType(), 1));
2744 // we won't need to know the number of iterations.
2776 if (Bound[K].Iterations) {
2778 SE->getMinusSCEV(Bound[K].Iterations,
2779 SE->getConstant(Bound[K].Iterations->getType(), 1));
2791 // we won't need to know the number of iterations.
2827 CI[K].Iterations = NULL;
2835 CI[K].Iterations = collectUpperBound(L, Subscript->getType());
2848 if (CI[K].Iterations)
2849 DEBUG(dbgs() << *CI[K].Iterations);
