Home | History | Annotate | Download | only in Scalar

Lines Matching refs:Factor

855 // Get the cost of the scaling factor used in F for LU.
1454 // scaling factor is profitable before computing the actual ScaledReg for
1503 // Check the scaling factor cost with both the min and max offsets.
2401 if (const SCEVConstant *Factor =
2404 if (Factor->getAPInt().getMinSignedBits() <= 64)
2405 Factors.insert(Factor->getAPInt().getSExtValue());
2406 } else if (const SCEVConstant *Factor =
2410 if (Factor->getAPInt().getMinSignedBits() <= 64)
2411 Factors.insert(Factor->getAPInt().getSExtValue());
3476 for (int64_t Factor : Factors) {
3478 if (Base.BaseOffset == INT64_MIN && Factor == -1)
3480 int64_t NewBaseOffset = (uint64_t)Base.BaseOffset * Factor;
3481 if (NewBaseOffset / Factor != Base.BaseOffset)
3490 if (Offset == INT64_MIN && Factor == -1)
3492 Offset = (uint64_t)Offset * Factor;
3493 if (Offset / Factor != LU.MinOffset)
3510 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
3528 if (F.UnfoldedOffset == INT64_MIN && Factor == -1)
3530 F.UnfoldedOffset = (uint64_t)F.UnfoldedOffset * Factor;
3531 if (F.UnfoldedOffset / Factor != Base.UnfoldedOffset)
3545 /// Generate stride factor reuse formulae by making use of scaled-offset address
3560 for (int64_t Factor : Factors) {
3561 Base.Scale = Factor;
3585 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
3588 // Divide out the factor, ignoring high bits, since we'll be
4885 for (int64_t Factor : Factors) {
4888 OS << '*' << Factor;