Lines Matching refs:Bound
2463 BoundInfo *Bound = new BoundInfo[MaxLevels + 1]; in banerjeeMIVtest() local
2470 Bound[K].Iterations = A[K].Iterations ? A[K].Iterations : B[K].Iterations; in banerjeeMIVtest()
2471 Bound[K].Direction = Dependence::DVEntry::ALL; in banerjeeMIVtest()
2472 Bound[K].DirSet = Dependence::DVEntry::NONE; in banerjeeMIVtest()
2473 findBoundsALL(A, B, Bound, K); in banerjeeMIVtest()
2476 if (Bound[K].Lower[Dependence::DVEntry::ALL]) in banerjeeMIVtest()
2477 DEBUG(dbgs() << *Bound[K].Lower[Dependence::DVEntry::ALL] << '\t'); in banerjeeMIVtest()
2480 if (Bound[K].Upper[Dependence::DVEntry::ALL]) in banerjeeMIVtest()
2481 DEBUG(dbgs() << *Bound[K].Upper[Dependence::DVEntry::ALL] << '\n'); in banerjeeMIVtest()
2489 if (testBounds(Dependence::DVEntry::ALL, 0, Bound, Delta)) { in banerjeeMIVtest()
2492 unsigned NewDeps = exploreDirections(1, A, B, Bound, in banerjeeMIVtest()
2499 Result.DV[K - 1].Direction = Old & Bound[K].DirSet; in banerjeeMIVtest()
2520 delete [] Bound; in banerjeeMIVtest()
2535 BoundInfo *Bound, in exploreDirections() argument
2544 Bound[K].DirSet |= Bound[K].Direction; in exploreDirections()
2546 switch (Bound[K].Direction) { in exploreDirections()
2572 findBoundsLT(A, B, Bound, Level); in exploreDirections()
2573 findBoundsGT(A, B, Bound, Level); in exploreDirections()
2574 findBoundsEQ(A, B, Bound, Level); in exploreDirections()
2578 if (Bound[Level].Lower[Dependence::DVEntry::LT]) in exploreDirections()
2579 DEBUG(dbgs() << *Bound[Level].Lower[Dependence::DVEntry::LT] << '\t'); in exploreDirections()
2582 if (Bound[Level].Upper[Dependence::DVEntry::LT]) in exploreDirections()
2583 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::LT] << '\n'); in exploreDirections()
2587 if (Bound[Level].Lower[Dependence::DVEntry::EQ]) in exploreDirections()
2588 DEBUG(dbgs() << *Bound[Level].Lower[Dependence::DVEntry::EQ] << '\t'); in exploreDirections()
2591 if (Bound[Level].Upper[Dependence::DVEntry::EQ]) in exploreDirections()
2592 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::EQ] << '\n'); in exploreDirections()
2596 if (Bound[Level].Lower[Dependence::DVEntry::GT]) in exploreDirections()
2597 DEBUG(dbgs() << *Bound[Level].Lower[Dependence::DVEntry::GT] << '\t'); in exploreDirections()
2600 if (Bound[Level].Upper[Dependence::DVEntry::GT]) in exploreDirections()
2601 DEBUG(dbgs() << *Bound[Level].Upper[Dependence::DVEntry::GT] << '\n'); in exploreDirections()
2610 if (testBounds(Dependence::DVEntry::LT, Level, Bound, Delta)) in exploreDirections()
2611 NewDeps += exploreDirections(Level + 1, A, B, Bound, in exploreDirections()
2615 if (testBounds(Dependence::DVEntry::EQ, Level, Bound, Delta)) in exploreDirections()
2616 NewDeps += exploreDirections(Level + 1, A, B, Bound, in exploreDirections()
2620 if (testBounds(Dependence::DVEntry::GT, Level, Bound, Delta)) in exploreDirections()
2621 NewDeps += exploreDirections(Level + 1, A, B, Bound, in exploreDirections()
2624 Bound[Level].Direction = Dependence::DVEntry::ALL; in exploreDirections()
2628 return exploreDirections(Level + 1, A, B, Bound, Loops, DepthExpanded, Delta); in exploreDirections()
2635 BoundInfo *Bound, in testBounds() argument
2637 Bound[Level].Direction = DirKind; in testBounds()
2638 if (const SCEV *LowerBound = getLowerBound(Bound)) in testBounds()
2641 if (const SCEV *UpperBound = getUpperBound(Bound)) in testBounds()
2665 BoundInfo *Bound, in findBoundsALL() argument
2667 Bound[K].Lower[Dependence::DVEntry::ALL] = nullptr; // Default value = -infinity. in findBoundsALL()
2668 Bound[K].Upper[Dependence::DVEntry::ALL] = nullptr; // Default value = +infinity. in findBoundsALL()
2669 if (Bound[K].Iterations) { in findBoundsALL()
2670 Bound[K].Lower[Dependence::DVEntry::ALL] = in findBoundsALL()
2672 Bound[K].Iterations); in findBoundsALL()
2673 Bound[K].Upper[Dependence::DVEntry::ALL] = in findBoundsALL()
2675 Bound[K].Iterations); in findBoundsALL()
2680 Bound[K].Lower[Dependence::DVEntry::ALL] = in findBoundsALL()
2683 Bound[K].Upper[Dependence::DVEntry::ALL] = in findBoundsALL()
2706 BoundInfo *Bound, in findBoundsEQ() argument
2708 Bound[K].Lower[Dependence::DVEntry::EQ] = nullptr; // Default value = -infinity. in findBoundsEQ()
2709 Bound[K].Upper[Dependence::DVEntry::EQ] = nullptr; // Default value = +infinity. in findBoundsEQ()
2710 if (Bound[K].Iterations) { in findBoundsEQ()
2713 Bound[K].Lower[Dependence::DVEntry::EQ] = in findBoundsEQ()
2714 SE->getMulExpr(NegativePart, Bound[K].Iterations); in findBoundsEQ()
2716 Bound[K].Upper[Dependence::DVEntry::EQ] = in findBoundsEQ()
2717 SE->getMulExpr(PositivePart, Bound[K].Iterations); in findBoundsEQ()
2725 Bound[K].Lower[Dependence::DVEntry::EQ] = NegativePart; // Zero in findBoundsEQ()
2728 Bound[K].Upper[Dependence::DVEntry::EQ] = PositivePart; // Zero in findBoundsEQ()
2748 BoundInfo *Bound, in findBoundsLT() argument
2750 Bound[K].Lower[Dependence::DVEntry::LT] = nullptr; // Default value = -infinity. in findBoundsLT()
2751 Bound[K].Upper[Dependence::DVEntry::LT] = nullptr; // Default value = +infinity. in findBoundsLT()
2752 if (Bound[K].Iterations) { in findBoundsLT()
2754 SE->getMinusSCEV(Bound[K].Iterations, in findBoundsLT()
2755 SE->getConstant(Bound[K].Iterations->getType(), 1)); in findBoundsLT()
2758 Bound[K].Lower[Dependence::DVEntry::LT] = in findBoundsLT()
2762 Bound[K].Upper[Dependence::DVEntry::LT] = in findBoundsLT()
2771 Bound[K].Lower[Dependence::DVEntry::LT] = SE->getNegativeSCEV(B[K].Coeff); in findBoundsLT()
2775 Bound[K].Upper[Dependence::DVEntry::LT] = SE->getNegativeSCEV(B[K].Coeff); in findBoundsLT()
2795 BoundInfo *Bound, in findBoundsGT() argument
2797 Bound[K].Lower[Dependence::DVEntry::GT] = nullptr; // Default value = -infinity. in findBoundsGT()
2798 Bound[K].Upper[Dependence::DVEntry::GT] = nullptr; // Default value = +infinity. in findBoundsGT()
2799 if (Bound[K].Iterations) { in findBoundsGT()
2801 SE->getMinusSCEV(Bound[K].Iterations, in findBoundsGT()
2802 SE->getConstant(Bound[K].Iterations->getType(), 1)); in findBoundsGT()
2805 Bound[K].Lower[Dependence::DVEntry::GT] = in findBoundsGT()
2809 Bound[K].Upper[Dependence::DVEntry::GT] = in findBoundsGT()
2817 Bound[K].Lower[Dependence::DVEntry::GT] = A[K].Coeff; in findBoundsGT()
2820 Bound[K].Upper[Dependence::DVEntry::GT] = A[K].Coeff; in findBoundsGT()
2887 const SCEV *DependenceAnalysis::getLowerBound(BoundInfo *Bound) const { in getLowerBound()
2888 const SCEV *Sum = Bound[1].Lower[Bound[1].Direction]; in getLowerBound()
2890 if (Bound[K].Lower[Bound[K].Direction]) in getLowerBound()
2891 Sum = SE->getAddExpr(Sum, Bound[K].Lower[Bound[K].Direction]); in getLowerBound()
2903 const SCEV *DependenceAnalysis::getUpperBound(BoundInfo *Bound) const { in getUpperBound()
2904 const SCEV *Sum = Bound[1].Upper[Bound[1].Direction]; in getUpperBound()
2906 if (Bound[K].Upper[Bound[K].Direction]) in getUpperBound()
2907 Sum = SE->getAddExpr(Sum, Bound[K].Upper[Bound[K].Direction]); in getUpperBound()