Lines Matching refs:Factor
851 // Get the cost of the scaling factor used in F for LU.
1466 // scaling factor is profitable before computing the actual ScaledReg for
1515 // Check the scaling factor cost with both the min and max offsets.
2423 if (const SCEVConstant *Factor =
2426 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2427 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2428 } else if (const SCEVConstant *Factor =
2432 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2433 Factors.insert(Factor->getValue()->getValue().getSExtValue());
3511 int64_t Factor = *I;
3514 if (Base.BaseOffset == INT64_MIN && Factor == -1)
3516 int64_t NewBaseOffset = (uint64_t)Base.BaseOffset * Factor;
3517 if (NewBaseOffset / Factor != Base.BaseOffset)
3526 if (Offset == INT64_MIN && Factor == -1)
3528 Offset = (uint64_t)Offset * Factor;
3529 if (Offset / Factor != LU.MinOffset)
3546 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
3564 if (F.UnfoldedOffset == INT64_MIN && Factor == -1)
3566 F.UnfoldedOffset = (uint64_t)F.UnfoldedOffset * Factor;
3567 if (F.UnfoldedOffset / Factor != Base.UnfoldedOffset)
3581 /// GenerateScales - Generate stride factor reuse formulae by making use of
3598 int64_t Factor = *I;
3600 Base.Scale = Factor;
3624 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
3627 // Divide out the factor, ignoring high bits, since we'll be
