Lines Matching refs:Upper
922 // This routine collects upper bound and extends if needed.
995 // loop's upper bound. If a dependence exists, the dependence direction is
1209 // Check Delta/(2*ConstCoeff) against upper loop bound
2412 // U_k is the upper bound of the kth index, L_k is the lower bound of the Kth
2424 // When computing the upper bound, NULL denotes +inf;
2457 if (Bound[K].Upper[Dependence::DVEntry::ALL])
2458 DEBUG(dbgs() << *Bound[K].Upper[Dependence::DVEntry::ALL] << '\n');
2559 if (Bound[Level].Upper[Dependence::DVEntry::LT])
2560 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::LT] << '\n');
2568 if (Bound[Level].Upper[Dependence::DVEntry::EQ])
2569 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::EQ] << '\n');
2577 if (Bound[Level].Upper[Dependence::DVEntry::GT])
2578 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::GT] << '\n');
2625 // Computes the upper and lower bounds for level K
2637 // We must be careful to handle the case where the upper bound is unknown.
2639 // and the upper bound is always >= 0.
2645 Bound[K].Upper[Dependence::DVEntry::ALL] = NULL; // Default value = +infinity.
2650 Bound[K].Upper[Dependence::DVEntry::ALL] =
2660 Bound[K].Upper[Dependence::DVEntry::ALL] =
2666 // Computes the upper and lower bounds for level K
2678 // We must be careful to handle the case where the upper bound is unknown.
2680 // and the upper bound is always >= 0.
2686 Bound[K].Upper[Dependence::DVEntry::EQ] = NULL; // Default value = +infinity.
2693 Bound[K].Upper[Dependence::DVEntry::EQ] =
2705 Bound[K].Upper[Dependence::DVEntry::EQ] = PositivePart; // Zero
2710 // Computes the upper and lower bounds for level K
2722 // We must be careful to handle the case where the upper bound is unknown.
2728 Bound[K].Upper[Dependence::DVEntry::LT] = NULL; // Default value = +infinity.
2739 Bound[K].Upper[Dependence::DVEntry::LT] =
2752 Bound[K].Upper[Dependence::DVEntry::LT] = SE->getNegativeSCEV(B[K].Coeff);
2757 // Computes the upper and lower bounds for level K
2769 // We must be careful to handle the case where the upper bound is unknown.
2775 Bound[K].Upper[Dependence::DVEntry::GT] = NULL; // Default value = +infinity.
2786 Bound[K].Upper[Dependence::DVEntry::GT] =
2797 Bound[K].Upper[Dependence::DVEntry::GT] = A[K].Coeff;
2877 // computes the upper bound given the current direction settings
2878 // at each level. If the upper bound at any level is +inf,
2881 const SCEV *Sum = Bound[1].Upper[Bound[1].Direction];
2883 if (Bound[K].Upper[Bound[K].Direction])
2884 Sum = SE->getAddExpr(Sum, Bound[K].Upper[Bound[K].Direction]);
