Searched refs:mp_gcd (Results 1 - 11 of 11) sorted by relevance

/barrelfish-2018-10-04/lib/tommath/
H A Dbn_mp_lcm.c30 if ((res = mp_gcd (a, b, &t1)) != MP_OKAY) {
H A Dbn_mp_gcd.c19 int mp_gcd (mp_int * a, mp_int * b, mp_int * c) function
H A Dtommath.h372 int mp_gcd(mp_int *a, mp_int *b, mp_int *c);
H A Dbn.tex1788 int mp_gcd (mp_int * a, mp_int * b, mp_int * c)
/barrelfish-2018-10-04/lib/tommath/mtest/
H A Dmtest.c209 mp_gcd(&a, &b, &c);
254 mp_gcd(&a, &b, &c);
H A Dmpi.h172 mp_err mp_gcd(mp_int *a, mp_int *b, mp_int *c);
H A Dmpi.c1913 /* {{{ 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 Dtiming.c291 mp_gcd(&a, &b, &c);
H A Ddemo.c599 mp_gcd(&d, &b, &d);
665 mp_gcd(&a, &b, &e);
/barrelfish-2018-10-04/lib/tommath/etc/
H A Dpprime.c256 if ((res = mp_gcd (&n, &v, &y)) != MP_OKAY) { /* y = (n, v) */
/barrelfish-2018-10-04/lib/tommath/pre_gen/
H A Dmpi.c3179 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