Searched refs:GCD (Results 1 - 3 of 3) sorted by relevance

/freebsd-12-stable/contrib/llvm-project/llvm/lib/MCA/
H A DSupport.cpp28 // common multiple from the GCD.
29 unsigned GCD = GreatestCommonDivisor64(Denominator, RHS.Denominator); local
30 unsigned LCM = (Denominator * RHS.Denominator) / GCD;
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DLegalizerHelper.cpp178 int GCD = greatestCommonDivisor(OrigTy.getNumElements(), local
180 return LLT::scalarOrVector(GCD, OrigTy.getElementType());
190 int GCD = greatestCommonDivisor(OrigTy.getSizeInBits(), local
192 return LLT::scalar(GCD);
1227 // Unmerge the original values to the GCD type, and recombine to the next
1248 const int GCD = greatestCommonDivisor(SrcSize, WideSize); local
1249 LLT GCDTy = LLT::scalar(GCD);
1259 if (GCD == SrcSize) {
1275 const int PartsPerGCD = WideSize / GCD;
/freebsd-12-stable/contrib/llvm-project/llvm/lib/Analysis/
H A DScalarEvolution.cpp6318 unsigned GCD = std::min(MulZeros, TZ);
6319 APInt DivAmt = APInt::getOneBitSet(BitWidth, TZ - GCD);
6321 MulOps.push_back(getConstant(OpC->getAPInt().lshr(GCD)));
11141 // Bail out when GCD does not evenly divide one of the terms.
11335 /// computation of a GCD (greatest common divisor) of base and stride. When

Completed in 279 milliseconds