| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| sec_mul.c | 41 mpn_mul_basecase (rp, ap, an, bp, bn);
|
| sec_sqr.c | 67 /* Else use mpn_mul_basecase. */
68 mpn_mul_basecase (rp, ap, an, ap, an);
|
| mullo_n.c | 173 mpn_mul_basecase (tp + n, xp + n2, n1, yp, n1);
182 mpn_mul_basecase (tp + n, xp, n1, yp + n2, n1);
197 THINK: If mpn_mul_basecase is always faster than mpn_mullo_basecase
213 mpn_mul_basecase (tp, xp, n, yp, n);
|
| powm.c | 383 #define MPN_MUL_N(r,a,b,n) mpn_mul_basecase (r,a,n,b,n)
384 #define MPN_SQR(r,a,n) mpn_mul_basecase (r,a,n,a,n)
393 #define MPN_MUL_N(r,a,b,n) mpn_mul_basecase (r,a,n,b,n)
407 #define MPN_MUL_N(r,a,b,n) mpn_mul_basecase (r,a,n,b,n)
408 #define MPN_SQR(r,a,n) mpn_mul_basecase (r,a,n,a,n)
417 #define MPN_MUL_N(r,a,b,n) mpn_mul_basecase (r,a,n,b,n)
454 #define MPN_MUL_N(r,a,b,n) mpn_mul_basecase (r,a,n,b,n)
455 #define MPN_SQR(r,a,n) mpn_mul_basecase (r,a,n,a,n)
464 #define MPN_MUL_N(r,a,b,n) mpn_mul_basecase (r,a,n,b,n)
514 #define MPN_MUL_N(r,a,b,n) mpn_mul_basecase (r,a,n,b,n
[all...] |
| sqr.c | 43 mpn_mul_basecase (p, a, n, a, n);
|
| mul.c | 129 mpn_mul_basecase (prodp, up, un, vp, vn);
147 mpn_mul_basecase (prodp, up, un, vp, vn);
178 mpn_mul_basecase (prodp, up, MUL_BASECASE_MAX_UN, vp, vn);
185 mpn_mul_basecase (prodp, up, MUL_BASECASE_MAX_UN, vp, vn);
195 mpn_mul_basecase (prodp, up, un, vp, vn);
200 mpn_mul_basecase (prodp, vp, vn, up, un);
|
| toom22_mul.c | 65 mpn_mul_basecase (p, a, n, b, n); \
80 mpn_mul_basecase (p, a, an, b, bn); \
|
| mul_basecase.c | 0 /* mpn_mul_basecase -- Internal routine to multiply two natural numbers
53 mpn_mul_basecase (mp_ptr rp, function
|
| mul_n.c | 44 mpn_mul_basecase (p, a, n, b, n);
|
| sec_powm.c | 135 mpn_mul_basecase(rp, up, n, up, n); \
277 mpn_mul_basecase (tp, this_pp, n, pp + n, n);
291 mpn_mul_basecase (tp, this_pp, n, pp + n, n);
329 mpn_mul_basecase (tp, rp, n, tp + 2*n, n); \
|
| sqrlo.c | 170 mpn_mul_basecase (tp + n, xp + n2, n1, xp, n1);
|
| toom6h_mul.c | 65 mpn_mul_basecase (p, a, n, b, n); \
67 mpn_mul_basecase (p2, a2, n, b2, n); \
|
| toom8h_mul.c | 77 mpn_mul_basecase (p, a, n, b, n); \
78 if (f) mpn_mul_basecase (p2, a2, n, b2, n); \
|
| toom44_mul.c | 75 mpn_mul_basecase (p, a, n, b, n); \
|
| /src/external/lgpl3/gmp/dist/mpn/x86/p6/sse2/ |
| mul_basecase.asm | 1 dnl Intel P6/SSE2 mpn_mul_basecase.
34 MULFUNC_PROLOGUE(mpn_mul_basecase)
|
| /src/external/lgpl3/gmp/dist/mpn/x86_64/pentium4/ |
| mul_basecase.asm | 1 dnl X86-64 mpn_mul_basecase optimised for Intel Nocona.
36 MULFUNC_PROLOGUE(mpn_mul_basecase)
|
| /src/external/lgpl3/gmp/dist/mpn/x86_64/silvermont/ |
| mul_basecase.asm | 1 dnl X86-64 mpn_mul_basecase optimised for Intel Silvermont.
36 MULFUNC_PROLOGUE(mpn_mul_basecase)
|
| /src/external/lgpl3/gmp/dist/mpn/x86/pentium/ |
| mul_basecase.asm | 1 dnl Intel Pentium mpn_mul_basecase -- mpn by mpn multiplication.
37 C void mpn_mul_basecase (mp_ptr wp,
51 PROLOGUE(mpn_mul_basecase)
|
| /src/external/lgpl3/gmp/dist/mpn/cray/ieee/ |
| mul_basecase.c | 1 /* Cray PVP/IEEE mpn_mul_basecase.
38 mpn_mul_basecase (mp_ptr rp, function
|
| /src/external/lgpl3/gmp/dist/mpn/s390_32/esame/ |
| mul_basecase.asm | 1 dnl S/390-32/esame mpn_mul_basecase.
55 PROLOGUE(mpn_mul_basecase)
|
| /src/external/lgpl3/gmp/dist/mpn/s390_64/ |
| mul_basecase.asm | 1 dnl S/390-64 mpn_mul_basecase.
55 PROLOGUE(mpn_mul_basecase)
|
| /src/external/lgpl3/gmp/dist/mpn/x86/ |
| mul_basecase.asm | 1 dnl x86 mpn_mul_basecase -- Multiply two limb vectors and store the result
43 C void mpn_mul_basecase (mp_ptr wp,
73 PROLOGUE(mpn_mul_basecase)
|
| /src/external/lgpl3/gmp/dist/tests/mpn/ |
| t-fat.c | 204 mpn_mul_basecase (wp, xp, (mp_size_t) 1, yp, (mp_size_t) 1);
|
| t-instrument.c | 279 pre ("mpn_mul_basecase");
280 mpn_mul_basecase (wp, xp, (mp_size_t) 3, yp, (mp_size_t) 3);
|
| /src/external/lgpl3/mpfr/dist/src/ |
| mulders.c | 80 mpn_mul_basecase (rp, np, n, mp, n); /* result is exact, no error */
|
