Searched refs:mp_gcd (Results 1 - 11 of 11) sorted by relevance
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn_mp_lcm.c | 30 if ((res = mp_gcd (a, b, &t1)) != MP_OKAY) {
|
H A D | bn_mp_gcd.c | 19 int mp_gcd (mp_int * a, mp_int * b, mp_int * c) function
|
H A D | tommath.h | 372 int mp_gcd(mp_int *a, mp_int *b, mp_int *c);
|
H A D | bn.tex | 1788 int mp_gcd (mp_int * a, mp_int * b, mp_int * c)
|
/barrelfish-2018-10-04/lib/tommath/mtest/ |
H A D | mtest.c | 209 mp_gcd(&a, &b, &c); 254 mp_gcd(&a, &b, &c);
|
H A D | mpi.h | 172 mp_err mp_gcd(mp_int *a, mp_int *b, mp_int *c);
|
H A D | mpi.c | 1913 /* {{{ mp_gcd(a, b, c) */ 1916 Like the old mp_gcd() function, except computes the GCD using the 1919 mp_err mp_gcd(mp_int *a, mp_int *b, mp_int *c) function 2036 if((res = mp_gcd(a, b, &gcd)) != MP_OKAY) 2059 based on the Stein algorithm used for mp_gcd()
|
/barrelfish-2018-10-04/lib/tommath/demo/ |
H A D | timing.c | 291 mp_gcd(&a, &b, &c);
|
H A D | demo.c | 599 mp_gcd(&d, &b, &d); 665 mp_gcd(&a, &b, &e);
|
/barrelfish-2018-10-04/lib/tommath/etc/ |
H A D | pprime.c | 256 if ((res = mp_gcd (&n, &v, &y)) != MP_OKAY) { /* y = (n, v) */
|
/barrelfish-2018-10-04/lib/tommath/pre_gen/ |
H A D | mpi.c | 3179 int mp_gcd (mp_int * a, mp_int * b, mp_int * c) function 4425 if ((res = mp_gcd (a, b, &t1)) != MP_OKAY) {
|
Completed in 103 milliseconds