Lines Matching defs:Distance
244 // Returns the distance (or NULL) associated with a particular level.
247 return DV[Level - 1].Distance;
305 assert((Kind == Line || Kind == Distance) &&
306 "Kind should be Line (or Distance)");
314 assert((Kind == Line || Kind == Distance) &&
315 "Kind should be Line (or Distance)");
323 assert((Kind == Line || Kind == Distance) &&
324 "Kind should be Line (or Distance)");
329 // If constraint is a distance, returns D.
332 assert(Kind == Distance && "Kind should be Distance");
339 assert((Kind == Distance || Kind == Line || Kind == Point) &&
340 "Kind should be Distance, Line, or Point");
369 Kind = Distance;
397 OS << " Distance is " << *getD() <<
592 const SCEV *Distance = getDistance(II);
593 if (Distance)
594 OS << *Distance;
983 // Can prove independence. Failing that, can compute distance (and direction).
990 // The dependence distance is
1035 // Distance greater than trip count - no dependence
1042 // Can we compute distance?
1046 APInt Distance = ConstDelta; // these need to be initialized
1048 APInt::sdivrem(ConstDelta, ConstCoeff, Distance, Remainder);
1049 DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1053 // Coeff doesn't divide Distance, no dependence
1058 Result.DV[Level].Distance = SE->getConstant(Distance);
1059 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop);
1060 if (Distance.sgt(0))
1062 else if (Distance.slt(0))
1070 Result.DV[Level].Distance = Delta;
1077 DEBUG(dbgs() << "\t Distance = " << *Delta << "\n");
1078 Result.DV[Level].Distance = Delta; // since X/1 == X
1131 // If i = 0 (i.e., if c1 = c2), there's a dependence with distance = 0.
1132 // If i = upperbound, there's a dependence with distance = 0.
1169 Result.DV[Level].Distance = Delta; // = 0
1232 Result.DV[Level].Distance = SE->getConstant(Delta->getType(), 0);
1240 APInt Distance = APDelta; // these need to be initialzed
1242 APInt::sdivrem(APDelta, APCoeff, Distance, Remainder);
1250 DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1253 APInt Two = APInt(Distance.getBitWidth(), 2, true);
1254 Remainder = Distance.srem(Two);
2097 // It doesn't make sense to talk about distance or direction in this case,
2997 // Attempt to propagate a distance
3134 Level.Distance = CurConstraint.getD();
3136 if (!SE->isKnownNonZero(Level.Distance)) // if may be zero
3138 if (!SE->isKnownNonPositive(Level.Distance)) // if may be positive
3140 if (!SE->isKnownNonNegative(Level.Distance)) // if may be negative
3146 Level.Distance = NULL;
3151 Level.Distance = NULL;
