Lines Matching defs:Distance
278 return DV[Level - 1].Distance;
336 assert((Kind == Line || Kind == Distance) &&
337 "Kind should be Line (or Distance)");
345 assert((Kind == Line || Kind == Distance) &&
346 "Kind should be Line (or Distance)");
354 assert((Kind == Line || Kind == Distance) &&
355 "Kind should be Line (or Distance)");
363 assert(Kind == Distance && "Kind should be Distance");
370 assert((Kind == Distance || Kind == Line || Kind == Point) &&
371 "Kind should be Distance, Line, or Point");
394 Kind = Distance;
418 OS << " Distance is " << *getD() <<
613 const SCEV *Distance = getDistance(II);
614 if (Distance)
615 OS << *Distance;
1172 // Distance greater than trip count - no dependence
1183 APInt Distance = ConstDelta; // these need to be initialized
1185 APInt::sdivrem(ConstDelta, ConstCoeff, Distance, Remainder);
1186 LLVM_DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1190 // Coeff doesn't divide Distance, no dependence
1195 Result.DV[Level].Distance = SE->getConstant(Distance);
1196 NewConstraint.setDistance(SE->getConstant(Distance), CurLoop);
1197 if (Distance.sgt(0))
1199 else if (Distance.slt(0))
1207 Result.DV[Level].Distance = Delta;
1214 LLVM_DEBUG(dbgs() << "\t Distance = " << *Delta << "\n");
1215 Result.DV[Level].Distance = Delta; // since X/1 == X
1302 Result.DV[Level].Distance = Delta; // = 0
1363 Result.DV[Level].Distance = SE->getZero(Delta->getType());
1371 APInt Distance = APDelta; // these need to be initialzed
1373 APInt::sdivrem(APDelta, APCoeff, Distance, Remainder);
1381 LLVM_DEBUG(dbgs() << "\t Distance = " << Distance << "\n");
1384 APInt Two = APInt(Distance.getBitWidth(), 2, true);
1385 Remainder = Distance.srem(Two);
3217 Level.Distance = CurConstraint.getD();
3219 if (!SE->isKnownNonZero(Level.Distance)) // if may be zero
3221 if (!SE->isKnownNonPositive(Level.Distance)) // if may be positive
3223 if (!SE->isKnownNonNegative(Level.Distance)) // if may be negative
3229 Level.Distance = nullptr;
3234 Level.Distance = nullptr;