| /src/external/lgpl3/gmp/dist/demos/ |
| factorize.c | 41 struct factors struct
48 void factor (mpz_t, struct factors *);
51 factor_init (struct factors *factors)
53 factors->p = malloc (1);
54 factors->e = malloc (1);
55 factors->nfactors = 0;
59 factor_clear (struct factors *factors)
63 for (i = 0; i < factors->nfactors; i++
188 struct factors factors; local
393 struct factors factors; local
[all...] |
| /src/external/lgpl3/gmp/dist/mpz/ |
| prodlimbs.c | 49 /* Computes the product of the j>1 limbs pointed by factors, puts the
54 * The list in {factors, j} is overwritten.
59 mpz_prodlimbs (mpz_ptr x, mp_ptr factors, mp_size_t j)
74 cy = mpn_mul_1 (factors, factors, size, factors[i]);
75 factors[size] = cy;
81 cy = mpn_mul_1 (prod, factors, size, factors[i]);
94 PTR (x1) = factors + i
[all...] |
| mfac_uiui.c | 95 mp_limb_t *factors; local
108 factors = MPZ_NEWALLOC (x, sn / log_n_max (n) + 2);
111 factors = TMP_ALLOC_LIMBS (sn / log_n_max (n) + 2);
115 FACTOR_LIST_STORE (n, prod, max_prod, factors, j);
117 factors[j++] = n;
118 factors[j++] = prod;
122 mpz_prodlimbs (t, factors, j);
124 mpz_prodlimbs (x, factors, j);
|
| 2fac_ui.c | 72 mp_limb_t *factors, prod, max_prod; local
78 factors = TMP_SALLOC_LIMBS (1 + n / (2 * FACTORS_PER_LIMB));
80 factors[0] = ODD_DOUBLEFACTORIAL_TABLE_MAX;
86 FACTOR_LIST_STORE (n, prod, max_prod, factors, j);
88 factors[j++] = prod;
89 mpz_prodlimbs (x, factors, j);
|
| fac_ui.c | 70 mp_ptr factors; local
74 factors = TMP_SALLOC_LIMBS (2 + (n - numberof (table)) / FACTORS_PER_LIMB);
76 factors[0] = table[numberof (table)-1];
85 FACTOR_LIST_STORE (n, prod, max_prod, factors, j);
87 factors[j++] = prod;
88 mpz_prodlimbs (x, factors, j);
|
| oddfac_1.c | 187 Enough (FIXME: explain :-) limbs must be pointed by factors.
191 mpz_2multiswing_1 (mpz_ptr x, mp_limb_t n, mp_ptr sieve, mp_ptr factors)
206 SWING_A_PRIME (3, n, prod, max_prod, factors, j);
218 SWING_A_PRIME (prime, n, prod, max_prod, factors, j);
226 SH_SWING_A_PRIME (prime, n, prod, l_max_prod, factors, j);
232 FACTOR_LIST_STORE (prime, prod, max_prod, factors, j);
237 factors[j++] = prod;
238 mpz_prodlimbs (x, factors, j);
302 mp_ptr factors; local
323 factors = TMP_SALLOC_LIMBS (1 + tn / FACTORS_PER_LIMB)
[all...] |
| primorial_ui.c | 120 mp_limb_t *sieve, *factors; local
132 factors = TMP_ALLOC_LIMBS (size);
145 FACTOR_LIST_STORE (prime, prod, max_prod, factors, j);
151 factors[j++] = prod;
152 mpz_prodlimbs (x, factors, j);
|
| bin_uiui.c | 48 Accumulate chunks of factors first limb-by-limb (using one of mul0-mul8)
50 accumulates divisor factors, the 2nd inner loop accumulates exactly the same
51 number of dividend factors. We avoid accumulating more for the divisor,
52 even with its smaller factors, since we else cannot guarantee divisibility.
69 stored into a limb, perhaps.) The table should take the removed factors of
82 /* Multiply-into-limb functions. These remove factors of 2 on-the-fly. FIXME:
84 that then, shifting just adds some overhead. (We remove factors from the
173 /* Number of factors-of-2 removed by the corresponding mulN function. */
188 /* 1 to 8 factors per iteration */
192 /* 1 to 7 factors per iteration *
593 mp_limb_t *sieve, *factors, count; local
[all...] |
| /src/crypto/external/apache2/openssl/dist/crypto/rsa/ |
| rsa_gen.c | 84 STACK_OF(BIGNUM) *factors,
127 p = sk_BIGNUM_value(factors, 0);
128 q = sk_BIGNUM_value(factors, 1);
131 for (i = 0; i < sk_BIGNUM_num(factors); i++) {
153 factor = sk_BIGNUM_value(factors, i);
175 for (i = 2; i < sk_BIGNUM_num(factors); i++) {
176 factor = sk_BIGNUM_value(factors, i);
210 for (i = 2; i < sk_BIGNUM_num(factors); i++) {
227 if (BN_mod_inverse(iqmp, sk_BIGNUM_value(factors, 1),
228 sk_BIGNUM_value(factors, 0), ctx
[all...] |
| rsa_backend.c | 70 STACK_OF(BIGNUM) *factors = NULL, *exps = NULL, *coeffs = NULL;
124 if (!collect_numbers(factors = sk_BIGNUM_new_null(), params,
136 * need to have at least 2 factors
138 if (sk_BIGNUM_num(factors) < 2) {
144 * if we have more than two factors, n and d must also have
147 if (sk_BIGNUM_num(factors) > 2
154 if (sk_BIGNUM_num(factors) == 2) {
155 /* for 2 factors we can use the sp800 functions to do this */
156 if (!RSA_set0_factors(rsa, sk_BIGNUM_value(factors, 0),
157 sk_BIGNUM_value(factors, 1)))
[all...] |
| rsa_lib.c | 912 STACK_OF(BIGNUM_const) *factors = sk_BIGNUM_const_new_null();
916 if (factors == NULL || exps == NULL || coeffs == NULL)
923 ossl_rsa_get0_all_params(r, factors, exps, coeffs);
935 for (i = 0; i < sk_BIGNUM_const_num(factors); i++) {
936 bits = safe_BN_num_bits(sk_BIGNUM_const_value(factors, i));
950 sk_BIGNUM_const_free(factors);
|
| rsa_local.h | 155 STACK_OF(BIGNUM) *factors, STACK_OF(BIGNUM) *exps,
|
| /src/external/gpl3/gcc.old/dist/gcc/config/sh/ |
| divtab.cc | 135 unsigned char factors[N_ENTRIES]; local
152 factors[i] = factor;
181 calc_defect (1., constants[0], factors[0]));
183 calc_defect (-2., constants[steps], factors[steps]));
189 printf ("/* negative division factors */\n");
191 printf ("\t.byte\t%d\n", factors[i]);
196 printf ("/* positive division factors */\n");
198 printf ("\t.byte\t%d\n", factors[i]);
|
| /src/external/mit/isl/dist/ |
| isl_farkas.c | 366 * "n" is the number of factors in the factorization.
370 * "factors" contains information about the individual "n" factors.
376 struct isl_coefficients_factor_data *factors; member in struct:isl_coefficients_product_data
388 data->factors = isl_calloc_array(ctx,
390 if (!data->factors)
402 if (data->factors) {
404 isl_basic_set_free(data->factors[i].coeff);
407 free(data->factors);
423 * when combining the results over the different factors
[all...] |
| /src/external/lgpl3/gmp/dist/tests/mpz/ |
| t-gcd_ui.c | 57 static const char* factors[NUM_FACTORS] = { local
68 printf ("No usable factors for 2^%i+1.\n", GMP_NUMB_BITS);
82 mpz_set_str (f, factors[i], 10);
|
| /src/crypto/external/bsd/openssl/dist/crypto/rsa/ |
| rsa_backend.c | 68 STACK_OF(BIGNUM) *factors = NULL, *exps = NULL, *coeffs = NULL;
91 if (!collect_numbers(factors = sk_BIGNUM_new_null(), params,
100 if (sk_BIGNUM_num(factors) != 0
101 && !ossl_rsa_set0_all_params(rsa, factors, exps, coeffs))
106 sk_BIGNUM_free(factors);
115 sk_BIGNUM_pop_free(factors, BN_free);
128 STACK_OF(BIGNUM_const) *factors = sk_BIGNUM_const_new_null();
132 if (rsa == NULL || factors == NULL || exps == NULL || coeffs == NULL)
136 ossl_rsa_get0_all_params(rsa, factors, exps, coeffs);
149 factors)
[all...] |
| /src/crypto/external/apache2/openssl/dist/providers/implementations/encode_decode/ |
| encode_key2text.c | 465 STACK_OF(BIGNUM_const) *factors = NULL;
477 factors = sk_BIGNUM_const_new_null();
481 if (factors == NULL || exps == NULL || coeffs == NULL) {
497 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs);
498 primes = sk_BIGNUM_const_num(factors);
522 sk_BIGNUM_const_value(factors, 0)))
525 sk_BIGNUM_const_value(factors, 1)))
536 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) {
540 sk_BIGNUM_const_value(factors, i)))
609 sk_BIGNUM_const_free(factors);
[all...] |
| /src/crypto/external/bsd/openssl/dist/providers/implementations/encode_decode/ |
| encode_key2text.c | 636 STACK_OF(BIGNUM_const) *factors = NULL;
648 factors = sk_BIGNUM_const_new_null();
652 if (factors == NULL || exps == NULL || coeffs == NULL) {
668 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs);
669 primes = sk_BIGNUM_const_num(factors);
691 sk_BIGNUM_const_value(factors, 0)))
694 sk_BIGNUM_const_value(factors, 1)))
705 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) {
709 sk_BIGNUM_const_value(factors, i)))
775 sk_BIGNUM_const_free(factors);
[all...] |
| /src/external/gpl3/gcc/dist/libgcc/config/libbid/ |
| bid64_div.c | 65 extern SINT8 factors[][2];
355 // difference in powers of 2 factors for Y and X
356 nzeros = ed2 - factors[i][0] + factors[j][0];
357 // difference in powers of 5 factors
358 d5 = ed2 - factors[i][1] + factors[j][1];
742 // difference in powers of 2 factors for Y and X
743 nzeros = ed2 - factors[i][0] + factors[j][0]
[all...] |
| bid128_div.c | 33 extern SINT8 factors[][2];
235 // difference in powers of 2 factors for Y and X
236 nzeros = ed2 - factors[i][0] + factors[j][0];
237 // difference in powers of 5 factors
238 d5 = ed2 - factors[i][1] + factors[j][1];
697 // difference in powers of 2 factors for Y and X
698 nzeros = ed2 - factors[i][0] + factors[j][0]
[all...] |
| /src/external/gpl3/gcc.old/dist/libgcc/config/libbid/ |
| bid64_div.c | 65 extern SINT8 factors[][2];
355 // difference in powers of 2 factors for Y and X
356 nzeros = ed2 - factors[i][0] + factors[j][0];
357 // difference in powers of 5 factors
358 d5 = ed2 - factors[i][1] + factors[j][1];
742 // difference in powers of 2 factors for Y and X
743 nzeros = ed2 - factors[i][0] + factors[j][0]
[all...] |
| bid128_div.c | 33 extern SINT8 factors[][2];
235 // difference in powers of 2 factors for Y and X
236 nzeros = ed2 - factors[i][0] + factors[j][0];
237 // difference in powers of 5 factors
238 d5 = ed2 - factors[i][1] + factors[j][1];
697 // difference in powers of 2 factors for Y and X
698 nzeros = ed2 - factors[i][0] + factors[j][0]
[all...] |
| /src/crypto/external/apache2/openssl/dist/util/perl/OpenSSL/ |
| config.pm | 345 my @factors = (100, 1);
346 while (@numbers && @factors) {
347 $CCVER += shift(@numbers) * shift(@factors)
394 my @factors = (100, 1);
396 while (@numbers && @factors) {
397 $v += shift(@numbers) * shift(@factors)
|
| /src/crypto/external/bsd/openssl/dist/util/perl/OpenSSL/ |
| config.pm | 344 my @factors = (100, 1);
345 while (@numbers && @factors) {
346 $CCVER += shift(@numbers) * shift(@factors)
393 my @factors = (100, 1);
395 while (@numbers && @factors) {
396 $v += shift(@numbers) * shift(@factors)
|
| /src/usr.bin/dc/ |
| bcode.c | 341 static BN_ULONG factors[] = { variable
356 if (abs_scale < sizeof(factors)/sizeof(factors[0])) {
358 bn_check(BN_mul_word(n, factors[abs_scale]));
360 (void)BN_div_word(n, factors[abs_scale]);
394 else if (n->scale < sizeof(factors)/sizeof(factors[0])) {
395 rem = BN_div_word(i, factors[n->scale]);
|
