Lines Matching refs:Distance
249 // Returns the distance (or NULL) associated with a particular level.
252 return DV[Level - 1].Distance;
310 assert((Kind == Line || Kind == Distance) &&
311 "Kind should be Line (or Distance)");
319 assert((Kind == Line || Kind == Distance) &&
320 "Kind should be Line (or Distance)");
328 assert((Kind == Line || Kind == Distance) &&
329 "Kind should be Line (or Distance)");
334 // If constraint is a distance, returns D.
337 assert(Kind == Distance && "Kind should be Distance");
344 assert((Kind == Distance || Kind == Line || Kind == Point) &&
345 "Kind should be Distance, Line, or Point");
374 Kind = Distance;
402 OS << " Distance is " << *getD() <<
597 const SCEV *Distance = getDistance(II);
598 if (Distance)
599 OS << *Distance;
988 // Can prove independence. Failing that, can compute distance (and direction).
995 // The dependence distance is
1040 // Distance greater than trip count - no dependence
1047 // Can we compute distance?
1051 APInt Distance = ConstDelta; // these need to be initialized
1053 APInt::sdivrem(ConstDelta, ConstCoeff, Distance, Remainder);
1054 DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1058 // Coeff doesn't divide Distance, no dependence
1063 Result.DV[Level].Distance = SE->getConstant(Distance);
1064 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop);
1065 if (Distance.sgt(0))
1067 else if (Distance.slt(0))
1075 Result.DV[Level].Distance = Delta;
1082 DEBUG(dbgs() << "\t Distance = " << *Delta << "\n");
1083 Result.DV[Level].Distance = Delta; // since X/1 == X
1136 // If i = 0 (i.e., if c1 = c2), there's a dependence with distance = 0.
1137 // If i = upperbound, there's a dependence with distance = 0.
1174 Result.DV[Level].Distance = Delta; // = 0
1237 Result.DV[Level].Distance = SE->getConstant(Delta->getType(), 0);
1245 APInt Distance = APDelta; // these need to be initialzed
1247 APInt::sdivrem(APDelta, APCoeff, Distance, Remainder);
1255 DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1258 APInt Two = APInt(Distance.getBitWidth(), 2, true);
1259 Remainder = Distance.srem(Two);
2102 // It doesn't make sense to talk about distance or direction in this case,
3002 // Attempt to propagate a distance
3139 Level.Distance = CurConstraint.getD();
3141 if (!SE->isKnownNonZero(Level.Distance)) // if may be zero
3143 if (!SE->isKnownNonPositive(Level.Distance)) // if may be positive
3145 if (!SE->isKnownNonNegative(Level.Distance)) // if may be negative
3151 Level.Distance = nullptr;
3156 Level.Distance = nullptr;
