Searched refs:GreatestCommonDivisor (Results 1 – 7 of 7) sorted by relevance
| /openbsd/gnu/llvm/llvm/include/llvm/Analysis/ |
| H A D | ConstraintSystem.h | 48 GCD = APIntOps::GreatestCommonDivisor({32, (uint32_t)A}, {32, GCD}) in addVariableRow()
|
| /openbsd/gnu/llvm/llvm/lib/Analysis/ |
| H A D | ConstraintSystem.cpp | 81 NewGCD = APIntOps::GreatestCommonDivisor({32, (uint32_t)NR.back()}, in eliminateUsingFM()
|
| H A D | DependenceAnalysis.cpp | 2423 RunningGCD = APIntOps::GreatestCommonDivisor(RunningGCD, ConstCoeff.abs()); in gcdMIVtest()
2442 RunningGCD = APIntOps::GreatestCommonDivisor(RunningGCD, ConstCoeff.abs()); in gcdMIVtest()
2466 ExtraGCD = APIntOps::GreatestCommonDivisor(ExtraGCD, in gcdMIVtest()
2479 RunningGCD = APIntOps::GreatestCommonDivisor(RunningGCD, ExtraGCD); in gcdMIVtest()
2523 RunningGCD = APIntOps::GreatestCommonDivisor(RunningGCD, ConstCoeff.abs()); in gcdMIVtest()
2540 RunningGCD = APIntOps::GreatestCommonDivisor(RunningGCD, ConstCoeff.abs()); in gcdMIVtest()
2553 RunningGCD = APIntOps::GreatestCommonDivisor(RunningGCD, ConstCoeff.abs()); in gcdMIVtest()
|
| H A D | BasicAliasAnalysis.cpp | 1143 GCD = APIntOps::GreatestCommonDivisor(GCD, ScaleForGCD.abs()); in aliasGEP()
|
| H A D | ScalarEvolution.cpp | 3592 return APIntOps::GreatestCommonDivisor(std::move(A), std::move(B)); in gcd()
|
| /openbsd/gnu/llvm/llvm/include/llvm/ADT/ |
| H A D | APInt.h | 2200 APInt GreatestCommonDivisor(APInt A, APInt B);
|
| /openbsd/gnu/llvm/llvm/lib/Support/ |
| H A D | APInt.cpp | 759 APInt llvm::APIntOps::GreatestCommonDivisor(APInt A, APInt B) { in GreatestCommonDivisor() function in llvm::APIntOps
|