Lines Matching defs:Dist

1591   int Dist = Val / Size;
1595   if (!StrictCheck || Dist * Size == Val)
1596     return Dist;
1778 /// Given a dependence-distance \p Dist between two
1791                                      const SCEV &MaxBTC, const SCEV &Dist,
1796   //      (**) |Dist| > MaxBTC * Step
1801   // We basically want to check if the absolute distance (|Dist/Step|)
1816   const SCEV *CastedDist = &Dist;
1818   uint64_t DistTypeSizeBits = DL.getTypeSizeInBits(Dist.getType());
1821   // The dependence distance can be positive/negative, so we sign extend Dist;
1825     CastedProduct = SE.getZeroExtendExpr(Product, Dist.getType());
1827     CastedDist = SE.getNoopOrSignExtend(&Dist, Product->getType());
1829   // Is  Dist - (MaxBTC * Step) > 0 ?
1830   // (If so, then we have proven (**) because |Dist| >= Dist)
1835   // Second try: Is  -Dist - (MaxBTC * Step) > 0 ?
1836   // (If so, then we have proven (**) because |Dist| >= -1*Dist)
1918   const SCEV *Dist = SE.getMinusSCEV(Sink, Src);
1923                     << ": " << *Dist << "\n");
2004   return DepDistanceStrideAndSizeInfo(Dist, MaxStride, CommonStride,
2021   auto &[Dist, MaxStride, CommonStride, ShouldRetryWithRuntimeCheck,
2026   if (isa<SCEVCouldNotCompute>(Dist)) {
2044                          *Dist, MaxStride, TypeByteSize))
2047   const SCEVConstant *ConstDist = dyn_cast<SCEVConstant>(Dist);
2064     Dist = SE.applyLoopGuards(Dist, *LoopGuards);
2068   if (SE.isKnownNonPositive(Dist)) {
2069     if (SE.isKnownNonNegative(Dist)) {
2110   int64_t MinDistance = SE.getSignedRangeMin(Dist).getSExtValue();
2173   // We know that Dist is positive, but it may not be constant. Use the signed