Lines Matching refs:gcd
2726 static const APInt gcd(const SCEVConstant *C1, const SCEVConstant *C2) {
2768 APInt Factor = gcd(LHSCst, RHSCst);
5945 // 1. D = gcd(A, N)
5947 // The gcd of A and N may have only one prime factor: 2. The number of
7671 // Bail out when GCD does not evenly divide one of the terms.
7901 /// computation of a GCD (greatest common divisor) of base and stride. When
