| /barrelfish-2018-10-04/lib/tommath/ |
| H A D | bn_mp_lcm.c | 40 res = mp_mul(b, &t2, c);
46 res = mp_mul(a, &t2, c);
|
| H A D | bn_mp_mulmod.c | 28 if ((res = mp_mul (a, b, &t)) != MP_OKAY) {
|
| H A D | bn_mp_expt_d.c | 34 if ((res = mp_mul (c, &g, c)) != MP_OKAY) {
|
| H A D | bn_mp_exteuclid.c | 44 if ((err = mp_mul(&v1, &q, &tmp)) != MP_OKAY) { goto _ERR; }
46 if ((err = mp_mul(&v2, &q, &tmp)) != MP_OKAY) { goto _ERR; }
48 if ((err = mp_mul(&v3, &q, &tmp)) != MP_OKAY) { goto _ERR; }
|
| H A D | bn_mp_karatsuba_mul.c | 39 * are saved. Note also that the call to mp_mul can end up back
120 if (mp_mul (&x0, &y0, &x0y0) != MP_OKAY)
122 if (mp_mul (&x1, &y1, &x1y1) != MP_OKAY)
130 if (mp_mul (&t1, &x0, &t1) != MP_OKAY)
|
| H A D | bn_mp_mul.c | 19 int mp_mul (mp_int * a, mp_int * b, mp_int * c) function
|
| H A D | bn_mp_reduce_2k_l.c | 39 if ((res = mp_mul(&q, d, &q)) != MP_OKAY) {
|
| H A D | bn_mp_toom_mul.c | 73 if ((res = mp_mul(&a0, &b0, &w0)) != MP_OKAY) {
78 if ((res = mp_mul(&a2, &b2, &w4)) != MP_OKAY) {
109 if ((res = mp_mul(&tmp1, &tmp2, &w1)) != MP_OKAY) {
140 if ((res = mp_mul(&tmp1, &tmp2, &w3)) != MP_OKAY) {
158 if ((res = mp_mul(&tmp1, &tmp2, &w2)) != MP_OKAY) {
|
| H A D | bn_s_mp_exptmod.c | 124 if ((err = mp_mul (&M[x - 1], &M[1], &M[x])) != MP_OKAY) {
199 if ((err = mp_mul (&res, &M[bitbuf], &res)) != MP_OKAY) {
227 if ((err = mp_mul (&res, &M[1], &res)) != MP_OKAY) {
|
| H A D | bn_mp_reduce.c | 37 if ((res = mp_mul (&q, mu, &q)) != MP_OKAY) {
|
| H A D | bn_mp_n_root.c | 72 if ((res = mp_mul (&t3, &t1, &t2)) != MP_OKAY) {
|
| H A D | bn_mp_exptmod_fast.c | 185 if ((err = mp_mul (&M[x - 1], &M[1], &M[x])) != MP_OKAY) {
254 if ((err = mp_mul (&res, &M[bitbuf], &res)) != MP_OKAY) {
283 if ((err = mp_mul (&res, &M[1], &res)) != MP_OKAY) {
|
| H A D | tommath.h | 317 int mp_mul(mp_int *a, mp_int *b, mp_int *c);
|
| H A D | bn.tex | 361 mp_mul(&a, &a, &c); /* c = a * a */
1155 int mp_mul (mp_int * a, mp_int * b, mp_int * c);
1193 if ((result = mp_mul(&number1, &number2,
1354 if ((result = mp_mul(&a, &c, &c)) != MP_OKAY) \{
1461 if ((result = mp_mul(&a, &c, &c)) != MP_OKAY) \{
|
| H A D | tommath.tex | 659 mp_mul(&a, &b, &c); /* c = a * b */
|
| /barrelfish-2018-10-04/lib/tommath/etc/ |
| H A D | mont.c | 34 mp_mul(&p, &R, &pp); /* pp = R * p */
|
| H A D | tune.c | 78 mp_mul(&a,&b,&c);
|
| H A D | pprime.c | 238 if ((res = mp_mul (&a, &b, &z)) != MP_OKAY) { /* z = a * b */
|
| /barrelfish-2018-10-04/lib/tommath/mtest/ |
| H A D | mpi.h | 126 mp_err mp_mul(mp_int *a, mp_int *b, mp_int *c);
131 #define mp_sqr(a, b) mp_mul(a, a, b)
|
| H A D | mtest.c | 88 mp_mul(&a, &a, &c);
148 mp_mul(&a, &b, &c);
|
| H A D | mpi.c | 1041 /* {{{ mp_mul(a, b, c) */
1044 mp_mul(a, b, c)
1049 mp_err mp_mul(mp_int *a, mp_int *b, mp_int *c) function
1077 } /* end mp_mul() */
1103 } /* end mp_mul() */
1589 if((res = mp_mul(a, b, c)) != MP_OKAY)
1997 res = mp_mul(&u, &v, c); /* c = u * v */
2034 if((res = mp_mul(a, b, &prod)) != MP_OKAY)
2157 if((res = mp_mul(&gx, &v, g)) != MP_OKAY) goto CLEANUP;
|
| /barrelfish-2018-10-04/lib/tommath/pre_gen/ |
| H A D | mpi.c | 2485 if ((res = mp_mul (c, &g, c)) != MP_OKAY) {
2807 if ((err = mp_mul (&M[x - 1], &M[1], &M[x])) != MP_OKAY) {
2876 if ((err = mp_mul (&res, &M[bitbuf], &res)) != MP_OKAY) {
2905 if ((err = mp_mul (&res, &M[1], &res)) != MP_OKAY) {
2991 if ((err = mp_mul(&v1, &q, &tmp)) != MP_OKAY) { goto _ERR; }
2993 if ((err = mp_mul(&v2, &q, &tmp)) != MP_OKAY) { goto _ERR; }
2995 if ((err = mp_mul(&v3, &q, &tmp)) != MP_OKAY) { goto _ERR; }
4138 * are saved. Note also that the call to mp_mul can end up back
4219 if (mp_mul (&x0, &y0, &x0y0) != MP_OKAY)
4221 if (mp_mul (
4939 int mp_mul (mp_int * a, mp_int * b, mp_int * c) function
[all...] |
| /barrelfish-2018-10-04/lib/tommath/demo/ |
| H A D | timing.c | 170 DO(mp_mul(&a, &b, &c));
|
| H A D | demo.c | 542 mp_mul(&d, &b, &d);
|