Lines Matching refs:Upper
986 // This routine collects upper bound and extends or truncates if needed.
1058 // loop's upper bound. If a dependence exists, the dependence direction is
1263 // Check Delta/(2*ConstCoeff) against upper loop bound
2436 // U_k is the upper bound of the kth index, L_k is the lower bound of the Kth
2448 // When computing the upper bound, NULL denotes +inf;
2480 if (Bound[K].Upper[Dependence::DVEntry::ALL])
2481 DEBUG(dbgs() << *Bound[K].Upper[Dependence::DVEntry::ALL] << '\n');
2580 if (Bound[Level].Upper[Dependence::DVEntry::LT])
2581 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::LT] << '\n');
2589 if (Bound[Level].Upper[Dependence::DVEntry::EQ])
2590 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::EQ] << '\n');
2598 if (Bound[Level].Upper[Dependence::DVEntry::GT])
2599 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::GT] << '\n');
2644 // Computes the upper and lower bounds for level K
2656 // We must be careful to handle the case where the upper bound is unknown.
2658 // and the upper bound is always >= 0.
2662 Bound[K].Upper[Dependence::DVEntry::ALL] = nullptr; // Default value = +infinity.
2667 Bound[K].Upper[Dependence::DVEntry::ALL] =
2677 Bound[K].Upper[Dependence::DVEntry::ALL] =
2683 // Computes the upper and lower bounds for level K
2695 // We must be careful to handle the case where the upper bound is unknown.
2697 // and the upper bound is always >= 0.
2701 Bound[K].Upper[Dependence::DVEntry::EQ] = nullptr; // Default value = +infinity.
2708 Bound[K].Upper[Dependence::DVEntry::EQ] =
2720 Bound[K].Upper[Dependence::DVEntry::EQ] = PositivePart; // Zero
2725 // Computes the upper and lower bounds for level K
2737 // We must be careful to handle the case where the upper bound is unknown.
2741 Bound[K].Upper[Dependence::DVEntry::LT] = nullptr; // Default value = +infinity.
2751 Bound[K].Upper[Dependence::DVEntry::LT] =
2764 Bound[K].Upper[Dependence::DVEntry::LT] = SE->getNegativeSCEV(B[K].Coeff);
2769 // Computes the upper and lower bounds for level K
2781 // We must be careful to handle the case where the upper bound is unknown.
2785 Bound[K].Upper[Dependence::DVEntry::GT] = nullptr; // Default value = +infinity.
2795 Bound[K].Upper[Dependence::DVEntry::GT] =
2806 Bound[K].Upper[Dependence::DVEntry::GT] = A[K].Coeff;
2885 // computes the upper bound given the current direction settings
2886 // at each level. If the upper bound at any level is +inf,
2889 const SCEV *Sum = Bound[1].Upper[Bound[1].Direction];
2891 if (Bound[K].Upper[Bound[K].Direction])
2892 Sum = SE->getAddExpr(Sum, Bound[K].Upper[Bound[K].Direction]);
