Lines Matching refs:Factor
297 // If there is a constant factor, it will be first.
766 // this multiplication factor will perform the exact division by
2313 // that there's a factor provided by one of the other terms. We need to
2315 APInt Factor = gcd(LHSCst, RHSCst);
2316 if (!Factor.isIntN(1)) {
2318 getConstant(LHSCst->getValue()->getValue().udiv(Factor)));
2320 getConstant(RHSCst->getValue()->getValue().udiv(Factor)));
4131 // to factor simple cases.
5580 // The gcd of A and N may have only one prime factor: 2. The number of
5587 // B is divisible by D if and only if the multiplicity of prime factor 2 for B
5588 // is not less than multiplicity of this prime factor for D.
