| /src/external/lgpl3/gmp/dist/tests/mpn/ |
| t-toom8h.c | 10 #define MIN_BN(an) \
11 (MAX(GMP_NUMB_BITS <= 9*3 ? (an*7)/ 9 : \
12 GMP_NUMB_BITS <= 10*3 ? (an*6)/10 : \
13 GMP_NUMB_BITS <= 11*3 ? (an*5)/11 : \
14 GMP_NUMB_BITS <= 12*3 ? (an*4)/12 : \
15 (an*4)/13, 86) )
|
| t-toom32.c | 5 #define MIN_BN(an) (((an) + 8) / (size_t) 3)
6 #define MAX_BN(an) ((an) - 2)
|
| t-toom42.c | 5 #define MIN_BN(an) (((an) + 7) >> 2)
6 #define MAX_BN(an) ((2*(an)-5) / (size_t) 3)
|
| t-toom43.c | 5 #define MIN_BN(an) (1 + 2*(((an)+3) >> 2))
6 #define MAX_BN(an) ((an)-3)
|
| t-toom52.c | 5 #define MIN_BN(an) (((an) + 9) / (size_t) 5)
6 #define MAX_BN(an) (((an) - 3) >> 1)
|
| t-toom53.c | 5 #define MIN_BN(an) (1 + 2*(((an) + 4) / (size_t) 5))
6 #define MAX_BN(an) ((3*(an) - 11) >> 2)
|
| t-toom54.c | 5 #define MIN_BN(an) ((3*(an) + 32) / (size_t) 5) /* 3/5 */
6 #define MAX_BN(an) ((an) - 6) /* 1/1 */
|
| t-toom62.c | 5 #define MIN_BN(an) (((an) + 11) / (size_t) 6)
6 #define MAX_BN(an) ((2*(an) - 7) / (size_t) 5)
|
| t-toom63.c | 5 #define MIN_BN(an) (2*(((an) + 23) / (size_t) 6)) /* 2/6 */
6 #define MAX_BN(an) ((3*(an) - 23) / (size_t) 5) /* 3/5 */
|
| t-toom22.c | 5 #define MIN_BN(an) \
6 ((an) >= 2*MUL_TOOM22_THRESHOLD \
7 ? (an) + 2 - MUL_TOOM22_THRESHOLD \
8 : ((an)+1)/2 + 1 + (an & 1))
|
| t-toom44.c | 7 #define MIN_BN(an) (1 + 3*(((an)+3)>>2))
|
| t-toom33.c | 7 #define MIN_BN(an) (1 + 2*(((an)+2)/(size_t) 3))
|
| t-toom6h.c | 9 #define MIN_BN(an) (MAX ((an*3)>>3, 46))
|
| toom-sqr-shared.h | 59 mp_size_t an; local
63 an = MIN_AN
66 mpn_random2 (ap, an);
67 mpn_random2 (pp-1, an * 2 + 2);
69 p_after = pp[an * 2];
71 itch = mpn_toomN_sqr_itch (an);
77 mpn_toomN_sqr (pp, ap, an, scratch);
78 refmpn_mul (refp, ap, an, ap, an);
79 if (pp[-1] != p_before || pp[an * 2] != p_afte
[all...] |
| toom-shared.h | 28 * mpn_toomMN_mul_itch, MIN_AN, MIN_BN(an), MAX_BN(an) and then
43 #define MAX_BN(an) (an)
48 * MIN_BN(an) = N + floor(((N-1)*an + M - N)/M)
50 * MAX_BN(an) = floor(N*(an-1)/(M-1)) - N + 1
80 mp_size_t an, bn; local
87 /* We generate an in the MIN_AN <= an <= (1 << size_range). *
[all...] |
| t-mul.c | 53 mp_size_t max_n, an, bn, rn; local
71 for (an = 1; an <= max_n; an += 1)
73 for (bn = 1; bn <= an; bn += 1)
75 mpn_random2 (ap, an + 1);
78 refmpn_mul (refp, ap, an, bp, bn);
79 mpn_mul (rp, ap, an, bp, bn);
81 rn = an + bn;
84 printf ("ERROR, an = %d, bn = %d, rn = %d\n"
[all...] |
| t-mulmid.c | 57 mp_size_t an, bn, rn; local
61 an = 1 + gmp_urandomm_ui(rands, 1L << size_log);
66 /* Make sure an >= bn */
67 if (an < bn)
68 MP_SIZE_T_SWAP (an, bn);
70 mpn_random2 (ap, an);
73 refmpn_mulmid (refp, ap, an, bp, bn);
74 mpn_mulmid (rp, ap, an, bp, bn);
76 rn = an + 3 - bn;
79 printf ("ERROR in test %d, an = %d, bn = %d, rn = %d\n"
[all...] |
| t-sqrmod_bnm1.c | 52 ref_sqrmod_bnm1 (mp_ptr rp, mp_size_t rn, mp_srcptr ap, mp_size_t an)
56 ASSERT (0 < an && an <= rn);
58 refmpn_mul (rp, ap, an, ap, an);
59 an *= 2;
60 if (an > rn) {
61 cy = mpn_add (rp, rp, rn, rp + rn, an - rn);
100 mp_size_t an,rn,n; local
107 /* We generate an in the MIN_N <= n <= (1 << size_range). *
[all...] |
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| divis.c | 40 /* Determine whether A={ap,an} is divisible by D={dp,dn}. Must have both
41 operands normalized, meaning high limbs non-zero, except that an==0 is
50 Getting the remainder limb by limb would make an early exit possible on
60 mpn_divisible_p (mp_srcptr ap, mp_size_t an,
70 ASSERT (an >= 0);
71 ASSERT (an == 0 || ap[an-1] != 0);
74 ASSERT_MPN (ap, an);
78 Notice this test covers all cases of an==0. */
79 if (an < dn
[all...] |
| sec_sqr.c | 42 /* We slightly abuse TUNE_SQR_TOOM2_MAX here. If it is set for an assembly
44 file. An assembly mpn_sqr_basecase that does not define it should allow
59 mp_srcptr ap, mp_size_t an,
65 mpn_sqr_basecase (rp, ap, an);
68 mpn_mul_basecase (rp, ap, an, ap, an);
73 mpn_sec_sqr_itch (mp_size_t an)
|
| nussbaumer_mul.c | 1 /* mpn_nussbaumer_mul -- Multiply {ap,an} and {bp,bn} using
41 /* Multiply {ap,an} by {bp,bn}, and put the result in {pp, an+bn} */
44 mp_srcptr ap, mp_size_t an,
51 ASSERT (an >= bn);
56 if ((ap == bp) && (an == bn))
58 rn = mpn_sqrmod_bnm1_next_size (2*an);
59 tp = TMP_ALLOC_LIMBS (mpn_sqrmod_bnm1_itch (rn, an));
60 mpn_sqrmod_bnm1 (pp, rn, ap, an, tp);
64 rn = mpn_mulmod_bnm1_next_size (an + bn)
[all...] |
| gcd_subdiv_step.c | 80 mp_size_t an, bn, qn; local
87 an = bn = n;
88 MPN_NORMALIZE (ap, an);
95 if (an == bn)
98 MPN_CMP (c, ap, bp, an);
104 hook (ctx, ap, an, NULL, 0, -1);
115 if (an > bn)
117 MPN_PTR_SWAP (ap, an, bp, bn);
121 if (an <= s)
128 ASSERT_NOCARRY (mpn_sub (bp, bp, bn, ap, an));
[all...] |
| sec_mul.c | 37 mp_srcptr ap, mp_size_t an,
41 mpn_mul_basecase (rp, ap, an, bp, bn);
45 mpn_sec_mul_itch (mp_size_t an, mp_size_t bn)
|
| /src/games/primes/ |
| spsp.c | 54 uint64_t an = a % n; local
58 x += an;
59 if ((x < an) || (x >= n))
62 if (an + an < an)
63 an = an + an - n;
64 else if (an + an >= n
[all...] |
| /src/external/historical/nawk/dist/testdir/ |
| t.8.x | 3 # this should produce a blank for an empty input line
|
