Lines Matching defs: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;
1057 // Can prove independence. Failing that, can compute distance (and direction).
1064 // The dependence distance is
1109 // Distance greater than trip count - no dependence
1116 // Can we compute distance?
1120 APInt Distance = ConstDelta; // these need to be initialized
1122 APInt::sdivrem(ConstDelta, ConstCoeff, Distance, Remainder);
1123 DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1127 // Coeff doesn't divide Distance, no dependence
1132 Result.DV[Level].Distance = SE->getConstant(Distance);
1133 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop);
1134 if (Distance.sgt(0))
1136 else if (Distance.slt(0))
1144 Result.DV[Level].Distance = Delta;
1151 DEBUG(dbgs() << "\t Distance = " << *Delta << "\n");
1152 Result.DV[Level].Distance = Delta; // since X/1 == X
1205 // If i = 0 (i.e., if c1 = c2), there's a dependence with distance = 0.
1206 // If i = upperbound, there's a dependence with distance = 0.
1243 Result.DV[Level].Distance = Delta; // = 0
1304 Result.DV[Level].Distance = SE->getZero(Delta->getType());
1312 APInt Distance = APDelta; // these need to be initialzed
1314 APInt::sdivrem(APDelta, APCoeff, Distance, Remainder);
1322 DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1325 APInt Two = APInt(Distance.getBitWidth(), 2, true);
1326 Remainder = Distance.srem(Two);
2169 // It doesn't make sense to talk about distance or direction in this case,
3063 // Attempt to propagate a distance
3200 Level.Distance = CurConstraint.getD();
3202 if (!SE->isKnownNonZero(Level.Distance)) // if may be zero
3204 if (!SE->isKnownNonPositive(Level.Distance)) // if may be positive
3206 if (!SE->isKnownNonNegative(Level.Distance)) // if may be negative
3212 Level.Distance = nullptr;
3217 Level.Distance = nullptr;