Lines Matching refs:Iterations
2427 // When we can't determine the number of iterations for a loop,
2452 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations;
2651 if (Bound[K].Iterations) {
2654 Bound[K].Iterations);
2657 Bound[K].Iterations);
2660 // If the difference is 0, we won't need to know the number of iterations.
2692 if (Bound[K].Iterations) {
2696 SE->getMulExpr(NegativePart, Bound[K].Iterations);
2699 SE->getMulExpr(PositivePart, Bound[K].Iterations);
2703 // we won't need to know the number of iterations.
2734 if (Bound[K].Iterations) {
2736 SE->getMinusSCEV(Bound[K].Iterations,
2737 SE->getConstant(Bound[K].Iterations->getType(), 1));
2749 // we won't need to know the number of iterations.
2781 if (Bound[K].Iterations) {
2783 SE->getMinusSCEV(Bound[K].Iterations,
2784 SE->getConstant(Bound[K].Iterations->getType(), 1));
2796 // we won't need to know the number of iterations.
2832 CI[K].Iterations = nullptr;
2840 CI[K].Iterations = collectUpperBound(L, Subscript->getType());
2853 if (CI[K].Iterations)
2854 DEBUG(dbgs() << *CI[K].Iterations);
