HomeSort by: relevance | last modified time | path
    Searched refs:GCD (Results 1 - 15 of 15) sorted by relevancy

  /src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/
gcd.c 21 /* This file can also be used to define gcd functions for other unsigned
25 # include "gcd.h"
27 # define GCD gcd
34 GCD (WORD_T a, WORD_T b)
  /src/external/gpl2/gettext/dist/gettext-tools/libgettextpo/
gcd.c 21 /* This file can also be used to define gcd functions for other unsigned
25 # include "gcd.h"
27 # define GCD gcd
34 GCD (WORD_T a, WORD_T b)
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
ConstraintSystem.h 28 uint32_t GCD = 1;
49 GCD = APIntOps::GreatestCommonDivisor({32, (uint32_t)A}, {32, GCD})
  /src/external/lgpl3/gmp/dist/demos/calc/
calc.h 66 GCD = 267, /* GCD */
101 #define GCD 267
calclex.l 44 { "gcd", GCD },
calc.y 76 printf (" gcd(a,b,..) greatest common divisor\n");
149 %token ABS BIN FIB GCD KRON LCM LUCNUM NEXTPRIME POWM ROOT SQRT
228 | GCD '(' gcdlist ')' /* value on stack */
calc.c 146 printf (" gcd(a,b,..) greatest common divisor\n");
264 GCD = 267, /* GCD */
299 #define GCD 267
358 YYSYMBOL_GCD = 12, /* GCD */
787 "HEX", "DECIMAL", "QUIT", "ABS", "BIN", "FIB", "GCD", "KRON", "LCM",
calclex.c 527 { "gcd", GCD },
  /src/external/apache2/llvm/dist/llvm/lib/MCA/
Support.cpp 28 // common multiple from the GCD.
29 unsigned GCD = GreatestCommonDivisor64(Denominator, RHS.Denominator);
30 unsigned LCM = (Denominator * RHS.Denominator) / GCD;
  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
ConstraintSystem.cpp 73 ((-1) * Constraints[LowerR][1] / GCD), M1))
76 (Constraints[UpperR][1] / GCD), M2))
93 GCD = NewGCD;
BasicAliasAnalysis.cpp 1137 APInt GCD;
1143 GCD = Scale.abs();
1145 GCD = APIntOps::GreatestCommonDivisor(GCD, Scale.abs());
1172 // 1. (...)*GCD + DecompGEP1.Offset with size V1Size
1174 // Using arithmetic modulo GCD, the accesses are at
1176 // into the range [V2Size..GCD), then we know they cannot overlap.
1177 APInt ModOffset = DecompGEP1.Offset.srem(GCD);
1179 ModOffset += GCD; // We want mod, not rem.
1182 (GCD - ModOffset).uge(V1Size.getValue())
    [all...]
ScalarEvolution.cpp 3274 static const APInt gcd(const SCEVConstant *C1, const SCEVConstant *C2) {
3314 APInt Factor = gcd(LHSCst, RHSCst);
6635 unsigned GCD = std::min(MulZeros, TZ);
6636 APInt DivAmt = APInt::getOneBitSet(BitWidth, TZ - GCD);
6638 MulOps.push_back(getConstant(OpC->getAPInt().lshr(GCD)));
8847 // 1. D = gcd(A, N)
8849 // The gcd of A and N may have only one prime factor: 2. The number of
11798 // Bail out when GCD does not evenly divide one of the terms.
11991 /// computation of a GCD (greatest common divisor) of base and stride. When
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/
Utils.cpp 816 int GCD = greatestCommonDivisor(OrigTy.getNumElements(),
818 return LLT::scalarOrVector(GCD, OrigElt);
826 unsigned GCD = greatestCommonDivisor(OrigSize, TargetSize);
827 if (GCD == OrigElt.getSizeInBits())
832 if (GCD < OrigElt.getSizeInBits())
833 return LLT::scalar(GCD);
834 return LLT::vector(GCD / OrigElt.getSizeInBits(), OrigElt);
844 unsigned GCD = greatestCommonDivisor(OrigSize, TargetSize);
845 return LLT::scalar(GCD);
LegalizerHelper.cpp 1388 // Unmerge the original values to the GCD type, and recombine to the next
1409 const int GCD = greatestCommonDivisor(SrcSize, WideSize);
1410 LLT GCDTy = LLT::scalar(GCD);
1420 if (GCD == SrcSize) {
1436 const int PartsPerGCD = WideSize / GCD;
1570 // ; unpack to GCD type, with extra dead defs
1580 // Directly unmerge to the destination without going through a GCD type
3707 // Unmerge the operands to smaller parts of GCD type.
  /src/external/lgpl3/gmp/dist/demos/
pexpr.c 95 AND, IOR, XOR, SLL, SRA, POPCNT, HAMDIST, GCD, LCM, SQRT, ROOT, FAC,
704 {"gcd", GCD, 0},
1039 case GCD:

Completed in 37 milliseconds