| /external/dropbear/libtommath/mtest/ |
| mpi.h | 78 mp_digit *dp; /* the digits themselves */
99 void mp_set(mp_int *mp, mp_digit d);
107 mp_err mp_add_d(mp_int *a, mp_digit d, mp_int *b);
108 mp_err mp_sub_d(mp_int *a, mp_digit d, mp_int *b);
109 mp_err mp_mul_d(mp_int *a, mp_digit d, mp_int *b);
111 mp_err mp_div_d(mp_int *a, mp_digit d, mp_int *q, mp_digit *r);
113 mp_err mp_expt_d(mp_int *a, mp_digit d, mp_int *c);
127 mp_err mp_mul_2d(mp_int *a, mp_digit d, mp_int *c);
134 mp_err mp_div_2d(mp_int *a, mp_digit d, mp_int *q, mp_int *r)
[all...] |
| mpi.c | 68 can be contained in an mp_digit. Thus, an mp_word is used. These
133 void s_mp_setz(mp_digit *dp, mp_size count); /* zero digits */
134 void s_mp_copy(mp_digit *sp, mp_digit *dp, mp_size count); /* copy */
146 #define s_mp_setz(dp, count) memset(dp, 0, (count) * sizeof(mp_digit))
153 #define s_mp_copy(sp, dp, count) memcpy(dp, sp, (count) * sizeof(mp_digit))
169 void s_mp_div_2d(mp_int *mp, mp_digit d); /* divide by 2^d in place */
170 void s_mp_mod_2d(mp_int *mp, mp_digit d); /* modulo 2^d in place */
171 mp_err s_mp_mul_2d(mp_int *mp, mp_digit d); /* multiply by 2^d in place*/
174 mp_digit s_mp_norm(mp_int *a, mp_int *b); /* normalize for division *
[all...] |
| /external/dropbear/libtommath/ |
| bn_mp_init.c | 24 a->dp = OPT_CAST(mp_digit) XMALLOC (sizeof (mp_digit) * MP_PREC);
|
| bn_mp_init_size.c | 27 a->dp = OPT_CAST(mp_digit) XMALLOC (sizeof (mp_digit) * size);
|
| bn_mp_reduce_is_2k.c | 22 mp_digit iz;
39 if (iz > (mp_digit)MP_MASK) {
|
| bn_mp_mul_2.c | 34 register mp_digit r, rr, *tmpa, *tmpb;
49 rr = *tmpa >> ((mp_digit)(DIGIT_BIT - 1));
52 *tmpb++ = ((*tmpa++ << ((mp_digit)1)) | r) & MP_MASK;
|
| bn_s_mp_add.c | 50 register mp_digit u, *tmpa, *tmpb, *tmpc;
71 u = *tmpc >> ((mp_digit)DIGIT_BIT);
86 u = *tmpc >> ((mp_digit)DIGIT_BIT);
|
| bn_fast_s_mp_mul_digs.c | 37 mp_digit W[MP_WARRAY];
55 mp_digit *tmpx, *tmpy;
77 W[ix] = ((mp_digit)_W) & MP_MASK;
88 register mp_digit *tmpc;
|
| bn_fast_s_mp_sqr.c | 31 mp_digit W[MP_WARRAY], *tmpx;
47 mp_digit *tmpy;
85 W[ix] = (mp_digit)(_W & MP_MASK);
96 mp_digit *tmpb;
|
| bn_mp_init_set.c | 19 int mp_init_set (mp_int * a, mp_digit b)
|
| bn_mp_set.c | 19 void mp_set (mp_int * a, mp_digit b)
|
| bn_mp_zero.c | 22 mp_digit *tmp;
|
| bn_mp_montgomery_setup.c | 20 mp_montgomery_setup (mp_int * n, mp_digit * rho)
22 mp_digit x, b;
|
| bn_mp_radix_size.c | 23 mp_digit d;
61 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
| bn_mp_toradix.c | 23 mp_digit d;
51 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
| bn_mp_add_d.c | 20 mp_add_d (mp_int * a, mp_digit b, mp_int * c)
23 mp_digit *tmpa, *tmpc, mu;
|
| bn_mp_read_radix.c | 63 if ((res = mp_mul_d (a, (mp_digit) radix, a)) != MP_OKAY) {
66 if ((res = mp_add_d (a, (mp_digit) y, a)) != MP_OKAY) {
|
| bn_mp_toradix_n.c | 26 mp_digit d;
64 if ((res = mp_div_d (&t, (mp_digit) radix, &t, &d)) != MP_OKAY) {
|
| bn_mp_2expt.c | 40 a->dp[b / DIGIT_BIT] = ((mp_digit)1) << (b % DIGIT_BIT);
|
| bn_mp_clear.c | 22 volatile mp_digit *p;
|
| bn_mp_cmp_d.c | 19 int mp_cmp_d(mp_int * a, mp_digit b)
|
| bn_mp_cmp_mag.c | 22 mp_digit *tmpa, *tmpb;
|
| bn_mp_cnt_lsb.c | 26 mp_digit q, qq;
|
| bn_mp_copy.c | 38 register mp_digit *tmpa, *tmpb;
|
| /external/wpa_supplicant_8/src/tls/ |
| libtommath.c | 73 typedef unsigned long mp_digit; typedef
79 typedef unsigned long mp_digit; typedef
92 #define MP_MASK ((((mp_digit)1)<<((mp_digit)DIGIT_BIT))-((mp_digit)1))
128 mp_digit *dp;
156 static void mp_set(mp_int * a, mp_digit b);
193 static int mp_mul_d (mp_int * a, mp_digit b, mp_int * c);
250 register mp_digit u, *tmpa, *tmpb, *tmpc;
271 u = *tmpc >> ((mp_digit)DIGIT_BIT)
[all...] |
