HomeSort by relevance Sort by last modified time
    Searched full:mp_div (Results 1 - 23 of 23) sorted by null

  /external/dropbear/libtommath/
bn_mp_lcm.c 37 if ((res = mp_div(a, &t1, &t2, NULL)) != MP_OKAY) {
43 if ((res = mp_div(b, &t1, &t2, NULL)) != MP_OKAY) {
bn_mp_sqrt.c 47 if ((res = mp_div(arg,&t1,&t2,NULL)) != MP_OKAY) {
58 if ((res = mp_div(arg,&t1,&t2,NULL)) != MP_OKAY) {
bn_mp_mod.c 29 if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) {
bn_mp_reduce_setup.c 28 return mp_div (a, b, a, NULL);
bn_mp_exteuclid.c 41 if ((err = mp_div(&u3, &v3, &q, NULL)) != MP_OKAY) { goto _ERR; }
bn_mp_n_root.c 88 if ((res = mp_div (&t2, &t3, &t3, NULL)) != MP_OKAY) {
changes.txt 58 v0.33 -- Fixed "small" variant for mp_div() which would munge with negative dividends...
73 -- Merged in the small/slower mp_div replacement. You can now toggle which
74 you want to use as your mp_div() at build time. Saves roughly 8KB or so.
232 -- Re-wrote mp_div_d to be faster than calling mp_div
241 -- removed call to mp_cmp in inner loop of mp_div and put mp_cmp_mag in its place :-)
273 v0.16 -- Sped up mp_div by making normalization one shift call
304 to other functions like mp_invmod, mp_div, etc...
367 -- Fixed bug in mp_div
bn_mp_div.c 21 int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d) function
103 int mp_div (mp_int * a, mp_int * b, mp_int * c, mp_int * d) function
tommath.h 323 int mp_div(mp_int *a, mp_int *b, mp_int *c, mp_int *d);
bn.tex 362 mp_div(&a, &b, &c, &d); /* c = [a/b], d = a mod b */
370 mp_div(&a, &b, &a, &c); /* a = [a/b], c = a mod b */
    [all...]
  /external/dropbear/libtomcrypt/src/pk/dsa/
dsa_verify_key.c 70 if ((err = mp_div(tmp, key->q, tmp, tmp2)) != CRYPT_OK) { goto error; }
  /external/dropbear/
gendss.c 161 if (mp_div(&val, key->q, &div, NULL) != MP_OKAY) {
  /external/dropbear/libtommath/mtest/
mtest.c 160 mp_div(&a, &b, &c, &d);
mpi.h 133 mp_err mp_div(mp_int *a, mp_int *b, mp_int *q, mp_int *r);
mpi.c 1131 /* {{{ mp_div(a, b, q, r) */
1134 mp_div(a, b, q, r)
1143 mp_err mp_div(mp_int *a, mp_int *b, mp_int *q, mp_int *r) function
1221 } /* end mp_div() */
1377 if((res = mp_div(a, m, NULL, c)) != MP_OKAY)
1490 if((res = mp_div(&t, &x, &t, NULL)) != MP_OKAY)
    [all...]
  /external/dropbear/libtomcrypt/src/math/
ltm_desc.c 267 return mpi_to_ltc_error(mp_div(a, b, c, d));
  /external/dropbear/libtommath/etc/
pprime.c 344 mp_div (q, &b, q, NULL);
  /external/dropbear/libtommath/demo/
demo.c 290 mp_div(&a, &d, &b, &e);
563 mp_div(&a, &b, &e, &f);
  /external/wpa_supplicant/
libtommath.c 128 static int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d);
516 if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) {
1536 static int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d) function
    [all...]
  /external/wpa_supplicant_6/wpa_supplicant/src/tls/
libtommath.c 159 static int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d);
556 if ((res = mp_div (a, b, NULL, &t)) != MP_OKAY) {
1594 static int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d) function
1676 static int mp_div (mp_int * a, mp_int * b, mp_int * c, mp_int * d) function
    [all...]
  /external/dropbear/libtomcrypt/src/headers/
tomcrypt_math.h 477 #define mp_div(a, b, c, d) ltc_mp.mpdiv(a, b, c, d) macro
  /external/dropbear/libtommath/pre_gen/
mpi.c 1576 int mp_div(mp_int * a, mp_int * b, mp_int * c, mp_int * d) function
1658 int mp_div (mp_int * a, mp_int * b, mp_int * c, mp_int * d) function
    [all...]
  /external/dropbear/libtomcrypt/
changes     [all...]

Completed in 283 milliseconds