Lines Matching defs:gcd

39   // `gcd` is positive.
40   DynamicAPInt gcd = llvm::gcd(abs(dividend.front()), divisor);
50     gcd = llvm::gcd(abs(dividend[i]), gcd);
51     if (gcd == 1)
57                  [gcd](DynamicAPInt &n) { return floorDiv(n, gcd); });
58   divisor /= gcd;
343   DynamicAPInt gcd(0);
345     gcd = llvm::gcd(gcd, abs(elem));
346     if (gcd == 1)
347       return gcd;
349   return gcd;
353   DynamicAPInt gcd = gcdRange(range);
354   if ((gcd == 0) || (gcd == 1))
355     return gcd;
357     elem /= gcd;
358   return gcd;
364   DynamicAPInt gcd = llvm::gcd(gcdRange(num), denom);
365   if (gcd == 1)
368     coeff /= gcd;
369   denom /= gcd;