/netbsd-current/external/lgpl3/gmp/dist/demos/ |
H A D | factorize.c | 41 struct factors struct 48 void factor (mpz_t, struct factors *); 51 factor_init (struct factors *factors) argument 53 factors->p = malloc (1); 54 factors->e = malloc (1); 55 factors->nfactors = 0; 59 factor_clear (struct factors *factors) argument 63 for (i = 0; i < factors 71 factor_insert(struct factors *factors, mpz_t prime) argument 110 factor_insert_ui(struct factors *factors, unsigned long prime) argument 121 factor_using_division(mpz_t t, struct factors *factors) argument 188 struct factors factors; local 269 factor_using_pollard_rho(mpz_t n, unsigned long a, struct factors *factors) argument 366 factor(mpz_t t, struct factors *factors) argument 393 struct factors factors; local [all...] |
/netbsd-current/external/lgpl3/gmp/dist/mpz/ |
H A D | 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) argument 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 [all...] |
H A D | 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);
|
H A D | 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);
|
H A D | 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);
|
H A D | 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) argument 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 [all...] |
H A D | 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);
|
H A D | 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 pe 593 mp_limb_t *sieve, *factors, count; local [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/gcc/config/sh/ |
H A D | divtab.c | 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]);
|
/netbsd-current/external/gpl3/gcc/dist/gcc/config/sh/ |
H A D | 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]);
|
/netbsd-current/external/mit/isl/dist/ |
H A D | 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...] |
/netbsd-current/external/lgpl3/gmp/dist/tests/mpz/ |
H A D | 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);
|
/netbsd-current/crypto/external/bsd/openssl/dist/crypto/rsa/ |
H A D | 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...] |
/netbsd-current/crypto/external/bsd/openssl/dist/providers/implementations/encode_decode/ |
H A D | encode_key2text.c | 635 STACK_OF(BIGNUM_const) *factors = NULL; 647 factors = sk_BIGNUM_const_new_null(); 651 if (factors == NULL || exps == NULL || coeffs == NULL) { 667 ossl_rsa_get0_all_params((RSA *)rsa, factors, exps, coeffs); 668 primes = sk_BIGNUM_const_num(factors); 690 sk_BIGNUM_const_value(factors, 0))) 693 sk_BIGNUM_const_value(factors, 1))) 704 for (i = 2; i < sk_BIGNUM_const_num(factors); i++) { 708 sk_BIGNUM_const_value(factors, i))) 774 sk_BIGNUM_const_free(factors); [all...] |
/netbsd-current/external/gpl3/gcc.old/dist/libgcc/config/libbid/ |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | bid_convert_data.c | 980 const SINT8 factors[1024][2] = { variable
|
/netbsd-current/external/gpl3/gcc/dist/libgcc/config/libbid/ |
H A D | 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[ [all...] |
H A D | 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[ [all...] |
H A D | bid_convert_data.c | 980 const SINT8 factors[1024][2] = { variable
|
/netbsd-current/crypto/external/bsd/openssl/dist/util/perl/OpenSSL/ |
H A D | config.pm | 343 my @factors = (100, 1); 344 while (@numbers && @factors) { 345 $CCVER += shift(@numbers) * shift(@factors) 385 my @factors = (100, 1); 387 while (@numbers && @factors) { 388 $v += shift(@numbers) * shift(@factors)
|
/netbsd-current/usr.bin/dc/ |
H A D | 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]);
|
/netbsd-current/external/gpl3/gcc.old/dist/gcc/ |
H A D | tree-ssa-math-opts.c | 1519 bool *factors; member in struct:pow_synth_sqrt_info 1528 as the factors a[i], the maximum 0.5 power and the number of 1540 memset (info->factors, 0, n * sizeof (bool)); 1554 info->factors[i] = true; 1561 info->factors[i] = true; 1565 info->factors[i] = false; 1619 bool is_set = info->factors[i]; 1712 synth_info.factors = XALLOCAVEC (bool, max_depth + 1); 1743 alt_synth_info.factors = XALLOCAVEC (bool, max_depth + 1); 1756 memcpy (synth_info.factors, alt_synth_inf [all...] |
/netbsd-current/external/gpl3/gcc/dist/gcc/ |
H A D | tree-ssa-math-opts.cc | 1653 bool *factors; member in struct:pow_synth_sqrt_info 1662 as the factors a[i], the maximum 0.5 power and the number of 1674 memset (info->factors, 0, n * sizeof (bool)); 1688 info->factors[i] = true; 1695 info->factors[i] = true; 1699 info->factors[i] = false; 1753 bool is_set = info->factors[i]; 1846 synth_info.factors = XALLOCAVEC (bool, max_depth + 1); 1877 alt_synth_info.factors = XALLOCAVEC (bool, max_depth + 1); 1890 memcpy (synth_info.factors, alt_synth_inf [all...] |
/netbsd-current/crypto/external/bsd/openssl/dist/crypto/evp/ |
H A D | ctrl_params_translate.c | 1843 const BIGNUM *factors[10]; local 1846 && RSA_get0_multi_prime_factors(r, factors)) 1847 bn = factors[factornum - 2];
|