| /src/external/gpl3/gcc/dist/libgcc/config/libbid/ |
| bid_convert_data.c | 980 const SINT8 factors[1024][2] = { variable
|
| bid_convert_data.c | 980 const SINT8 factors[1024][2] = { variable
|
| /src/external/gpl3/gcc.old/dist/libgcc/config/libbid/ |
| bid_convert_data.c | 980 const SINT8 factors[1024][2] = { variable
|
| bid_convert_data.c | 980 const SINT8 factors[1024][2] = { variable
|
| /src/external/lgpl3/gmp/dist/mpz/ |
| 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);
|
| 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);
|
| 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);
|
| 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);
|
| 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);
|
| 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...] |
| 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...] |
| 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...] |
| 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/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);
|
| 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/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...] |
| 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/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]);
|
| 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...] |
| 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/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]);
|
