Cross Reference: /external/llvm/lib/Analysis/DependenceAnalysis.cpp

Lines Matching refs:Iterations
2494 // When we can't determine the number of iterations for a loop,
2519     Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations;
2718   if (Bound[K].Iterations) {
2721                      Bound[K].Iterations);
2724                      Bound[K].Iterations);
2727     // If the difference is 0, we won't need to know the number of iterations.
2759   if (Bound[K].Iterations) {
2763       SE->getMulExpr(NegativePart, Bound[K].Iterations);
2766       SE->getMulExpr(PositivePart, Bound[K].Iterations);
2770     // we won't need to know the number of iterations.
2801   if (Bound[K].Iterations) {
2803         Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType()));
2815     // we won't need to know the number of iterations.
2847   if (Bound[K].Iterations) {
2849         Bound[K].Iterations, SE->getOne(Bound[K].Iterations->getType()));
2861     // we won't need to know the number of iterations.
2897     CI[K].Iterations = nullptr;
2905     CI[K].Iterations = collectUpperBound(L, Subscript->getType());
2918     if (CI[K].Iterations)
2919       DEBUG(dbgs() << *CI[K].Iterations);
OpenGrok
