Lines Matching defs:Factor
850 // Get the cost of the scaling factor used in F for LU.
1462 // scaling factor is profitable before computing the actual ScaledReg for
1511 // Check the scaling factor cost with both the min and max offsets.
2418 if (const SCEVConstant *Factor =
2421 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2422 Factors.insert(Factor->getValue()->getValue().getSExtValue());
2423 } else if (const SCEVConstant *Factor =
2427 if (Factor->getValue()->getValue().getMinSignedBits() <= 64)
2428 Factors.insert(Factor->getValue()->getValue().getSExtValue());
3508 int64_t Factor = *I;
3511 if (Base.BaseOffset == INT64_MIN && Factor == -1)
3513 int64_t NewBaseOffset = (uint64_t)Base.BaseOffset * Factor;
3514 if (NewBaseOffset / Factor != Base.BaseOffset)
3523 if (Offset == INT64_MIN && Factor == -1)
3525 Offset = (uint64_t)Offset * Factor;
3526 if (Offset / Factor != LU.MinOffset)
3543 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
3561 if (F.UnfoldedOffset == INT64_MIN && Factor == -1)
3563 F.UnfoldedOffset = (uint64_t)F.UnfoldedOffset * Factor;
3564 if (F.UnfoldedOffset / Factor != Base.UnfoldedOffset)
3578 /// GenerateScales - Generate stride factor reuse formulae by making use of
3595 int64_t Factor = *I;
3597 Base.Scale = Factor;
3621 const SCEV *FactorS = SE.getConstant(IntTy, Factor);
3624 // Divide out the factor, ignoring high bits, since we'll be
