| /netbsd-src/crypto/external/bsd/openssl/dist/test/recipes/10-test_bn_data/ |
| H A D | bngcd.txt | 8 # GCD tests.
10 # These test vectors satisfy gcd(A, B) = GCD.
15 GCD = 0
20 GCD = 1
25 GCD = 1
30 GCD = 70030ffeeea3deaea19387f4f1d0f460a6954a2a9cb98290602ac09036143ef8eb9692f3eac22961811083e073ee0…
35 GCD = 231f16458c487346cf50a17beec83632f25d19abeea1097c746533cd3e35207b7efd75dc3e9c663a64b6861e88579…
42 GCD = 3
46 GCD = 5
50 GCD = 7
[all …]
|
| /netbsd-src/crypto/external/bsd/openssl.old/dist/test/recipes/10-test_bn_data/ |
| H A D | bngcd.txt | 8 # GCD tests.
10 # These test vectors satisfy gcd(A, B) = GCD.
15 GCD = 0
20 GCD = 1
25 GCD = 1
30 GCD = 70030ffeeea3deaea19387f4f1d0f460a6954a2a9cb98290602ac09036143ef8eb9692f3eac22961811083e073ee0…
35 GCD = 231f16458c487346cf50a17beec83632f25d19abeea1097c746533cd3e35207b7efd75dc3e9c663a64b6861e88579…
42 GCD = 3
46 GCD = 5
50 GCD = 7
[all …]
|
| /netbsd-src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
| H A D | ConstraintSystem.h | 28 uint32_t GCD = 1; variable
49 GCD = APIntOps::GreatestCommonDivisor({32, (uint32_t)A}, {32, GCD}) in addVariableRow()
|
| /netbsd-src/external/gpl2/gettext/dist/gettext-tools/libgettextpo/ |
| H A D | gcd.c | 27 # define GCD gcd macro
34 GCD (WORD_T a, WORD_T b) in GCD() function
|
| /netbsd-src/external/gpl2/gettext/dist/gettext-tools/gnulib-lib/ |
| H A D | gcd.c | 27 # define GCD gcd macro
34 GCD (WORD_T a, WORD_T b) in GCD() function
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/Analysis/ |
| H A D | ConstraintSystem.cpp | 73 ((-1) * Constraints[LowerR][1] / GCD), M1)) in eliminateUsingFM()
76 (Constraints[UpperR][1] / GCD), M2)) in eliminateUsingFM()
93 GCD = NewGCD; in eliminateUsingFM()
|
| H A D | BasicAliasAnalysis.cpp | 1137 APInt GCD; in aliasGEP() local
1143 GCD = Scale.abs(); in aliasGEP()
1145 GCD = APIntOps::GreatestCommonDivisor(GCD, Scale.abs()); in aliasGEP()
1177 APInt ModOffset = DecompGEP1.Offset.srem(GCD); in aliasGEP()
1179 ModOffset += GCD; // We want mod, not rem. in aliasGEP()
1182 (GCD - ModOffset).uge(V1Size.getValue())) in aliasGEP()
|
| /netbsd-src/external/lgpl3/gmp/dist/demos/calc/ |
| H A D | calc.h | 66 GCD = 267, /* GCD */ enumerator
101 #define GCD 267 macro
|
| H A D | calc.y | 149 %token ABS BIN FIB GCD KRON LCM LUCNUM NEXTPRIME POWM ROOT SQRT
228 | GCD '(' gcdlist ')' /* value on stack */
|
| H A D | calclex.l | 44 { "gcd", GCD },
|
| H A D | calc.c | 264 GCD = 267, /* GCD */ enumerator
299 #define GCD 267 macro
|
| H A D | calclex.c | 527 { "gcd", GCD },
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/MCA/ |
| H A D | Support.cpp | 29 unsigned GCD = GreatestCommonDivisor64(Denominator, RHS.Denominator); in operator +=() local
30 unsigned LCM = (Denominator * RHS.Denominator) / GCD; in operator +=()
|
| /netbsd-src/external/apache2/llvm/dist/llvm/lib/CodeGen/GlobalISel/ |
| H A D | Utils.cpp | 816 int GCD = greatestCommonDivisor(OrigTy.getNumElements(), in getGCDType() local
818 return LLT::scalarOrVector(GCD, OrigElt); in getGCDType()
826 unsigned GCD = greatestCommonDivisor(OrigSize, TargetSize); in getGCDType() local
827 if (GCD == OrigElt.getSizeInBits()) in getGCDType()
832 if (GCD < OrigElt.getSizeInBits()) in getGCDType()
833 return LLT::scalar(GCD); in getGCDType()
834 return LLT::vector(GCD / OrigElt.getSizeInBits(), OrigElt); in getGCDType()
844 unsigned GCD = greatestCommonDivisor(OrigSize, TargetSize); in getGCDType() local
845 return LLT::scalar(GCD); in getGCDType()
|
| H A D | LegalizerHelper.cpp | 1409 const int GCD = greatestCommonDivisor(SrcSize, WideSize); in widenScalarMergeValues() local
1410 LLT GCDTy = LLT::scalar(GCD); in widenScalarMergeValues()
1420 if (GCD == SrcSize) { in widenScalarMergeValues()
1436 const int PartsPerGCD = WideSize / GCD; in widenScalarMergeValues()
|
| /netbsd-src/external/lgpl3/gmp/dist/doc/ |
| H A D | gmp.info | 128 Node: Binary GCD307882
130 Node: Subquadratic GCD312962
131 Node: Extended GCD315431
|
| H A D | gmp.info-2 | 54 The factor of b^n on r can be ignored in a GCD when d is odd, hence
111 * Binary GCD::
113 * Subquadratic GCD::
114 * Extended GCD::
118 File: gmp.info, Node: Binary GCD, Next: Lehmer's Algorithm, Prev: Greatest Common Divisor Algori…
120 15.3.1 Binary GCD
123 At small sizes GMP uses an O(N^2) binary style GCD. This is described
130 The Euclidean GCD algorithm, as per Knuth algorithms E and A,
146 The final 1x1 GCD in 'mpn_gcd_1' is done in the generic C code as
173 a 64-bit GCD taking nearly 400 cycles. It's this sort of time which
[all …]
|
| H A D | gmp.texi | 44 @c looking for "GCD" or something is only going to be confused by pointers to
2514 doing a full GCD@. Or when forming a big product it might be known that very
3587 @cindex GCD functions
3604 @cindex Extended GCD
3605 @cindex GCD extended
6806 interface. For example to set @code{a} to the GCD of @code{b} and @code{c},
8686 The factor of @math{b^n} on @math{r} can be ignored in a GCD when @math{d} is
8739 @cindex GCD algorithms
8742 * Binary GCD::
8744 * Subquadratic GCD::
[all …]
|
| /netbsd-src/external/lgpl3/gmp/dist/demos/ |
| H A D | pexpr.c | 95 AND, IOR, XOR, SLL, SRA, POPCNT, HAMDIST, GCD, LCM, SQRT, ROOT, FAC, enumerator
704 {"gcd", GCD, 0},
1039 case GCD: in mpz_eval_expr()
|
| /netbsd-src/sys/external/bsd/compiler_rt/dist/lib/asan/tests/ |
| H A D | asan_mac_test_helpers.mm | 81 // Used by the GCD tests to avoid a race between the worker thread reporting a
|
| /netbsd-src/external/bsd/file/dist/magic/magdir/ |
| H A D | map | 380 … 78~ZIP, RGN or SRF bitmap; 148~ZIP or JAR; 249~display firmware; 251~WiFi or GCD firmware; 255~ZIP
|
| /netbsd-src/external/gpl3/gcc.old/dist/libstdc++-v3/include/std/ |
| H A D | numeric | 107 // GCD implementation
|
| /netbsd-src/share/misc/ |
| H A D | acronyms | 205 GCD greatest common divisor
|
| /netbsd-src/external/gpl3/gcc/dist/libstdc++-v3/include/std/ |
| H A D | numeric | 117 // GCD implementation, using Stein's algorithm
|
| /netbsd-src/external/lgpl3/gmp/dist/ |
| H A D | NEWS | 1054 * New and improved mpz functions, including much faster GCD, fast exact
|