| /external/dropbear/libtommath/ |
| bn_mp_mul_2.c | 49 rr = *tmpa >> ((mp_digit)(DIGIT_BIT - 1));
|
| bn_mp_mul_d.c | 57 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
|
| bn_fast_mp_montgomery_reduce.c | 110 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT);
130 *_W++ += *_W1++ >> ((mp_word) DIGIT_BIT);
|
| bn_mp_div_d.c | 22 for (x = 1; x < DIGIT_BIT; x++) {
82 w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]);
|
| bn_mp_prime_next_prime.c | 132 } while (y == 1 && step < ((((mp_digit)1)<<DIGIT_BIT) - kstep));
140 if (y == 1 && step >= ((((mp_digit)1)<<DIGIT_BIT) - kstep)) {
|
| bn_fast_s_mp_mul_digs.c | 80 _W = _W >> ((mp_word)DIGIT_BIT);
|
| bn_fast_s_mp_mul_high_digs.c | 70 _W = _W >> ((mp_word)DIGIT_BIT);
|
| bn_mp_dr_reduce.c | 67 mu = (mp_digit)(r >> ((mp_word)DIGIT_BIT));
|
| bn_mp_toom_mul.c | 41 if ((res = mp_mod_2d(a, DIGIT_BIT * B, &a0)) != MP_OKAY) {
49 mp_mod_2d(&a1, DIGIT_BIT * B, &a1);
57 if ((res = mp_mod_2d(b, DIGIT_BIT * B, &b0)) != MP_OKAY) {
65 mp_mod_2d(&b1, DIGIT_BIT * B, &b1);
|
| bn_mp_div.c | 151 /* normalize both x and y, ensure that y >= b/2, [b == 2**DIGIT_BIT] */
152 norm = mp_count_bits(&y) % DIGIT_BIT;
153 if (norm < (int)(DIGIT_BIT-1)) {
154 norm = (DIGIT_BIT-1) - norm;
193 q.dp[i - t - 1] = ((((mp_digit)1) << DIGIT_BIT) - 1);
196 tmp = ((mp_word) x.dp[i]) << ((mp_word) DIGIT_BIT);
|
| bn_s_mp_exptmod.c | 155 bitcnt = (int) DIGIT_BIT;
159 y = (buf >> (mp_digit)(DIGIT_BIT - 1)) & 1;
|
| tommath.h | 57 * A "mp_digit" must be able to hold DIGIT_BIT + 1 bits
58 * A "mp_word" must be able to hold 2*DIGIT_BIT + 1 bits
79 #define DIGIT_BIT 60
99 #define DIGIT_BIT 31
102 #define DIGIT_BIT 28
126 #ifndef DIGIT_BIT
127 #define DIGIT_BIT ((int)((CHAR_BIT * sizeof(mp_digit) - 1))) /* bits per digit */
130 #define MP_DIGIT_BIT DIGIT_BIT
131 #define MP_MASK ((((mp_digit)1)<<((mp_digit)DIGIT_BIT))-((mp_digit)1))
176 #define MP_WARRAY (1 << (sizeof(mp_word) * CHAR_BIT - 2 * DIGIT_BIT + 1)
[all...] |
| bn_fast_s_mp_sqr.c | 88 W1 = _W >> ((mp_word)DIGIT_BIT);
|
| bn_mp_exptmod_fast.c | 100 P->used < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
210 bitcnt = (int)DIGIT_BIT;
214 y = (mp_digit)(buf >> (DIGIT_BIT - 1)) & 1;
|
| bn_mp_toom_sqr.c | 34 if ((res = mp_mod_2d(a, DIGIT_BIT * B, &a0)) != MP_OKAY) {
42 mp_mod_2d(&a1, DIGIT_BIT * B, &a1);
|
| /external/wpa_supplicant_8/src/tls/ |
| libtommath.c | 76 #define DIGIT_BIT 60
82 #define DIGIT_BIT 28
92 #define MP_MASK ((((mp_digit)1)<<((mp_digit)DIGIT_BIT))-((mp_digit)1))
123 #define MP_WARRAY (1 << (sizeof(mp_word) * CHAR_BIT - 2 * DIGIT_BIT + 1))
271 u = *tmpc >> ((mp_digit)DIGIT_BIT);
286 u = *tmpc >> ((mp_digit)DIGIT_BIT);
522 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
1060 if (b >= (int)DIGIT_BIT) {
1061 mp_rshd (c, b / DIGIT_BIT);
1064 /* shift any bit count < DIGIT_BIT */
[all...] |
| /external/dropbear/libtommath/demo/ |
| timing.c | 124 fprintf(log, "%d %9llu\n", cnt * DIGIT_BIT, tt);
146 fprintf(log, "%d %9llu\n", cnt * DIGIT_BIT, tt);
162 for (cnt = 4; cnt <= 10240 / DIGIT_BIT; cnt += 2) {
183 for (cnt = 4; cnt <= 10240 / DIGIT_BIT; cnt += 2) {
310 fprintf(log, "%d %9llu\n", cnt * DIGIT_BIT, tt);
|
| demo.c | 270 mp_rand(&b, (cnt / DIGIT_BIT + 1) * 2);
325 mp_dr_reduce(&c, &a, (((mp_digit) 1) << DIGIT_BIT) - a.dp[0]);
|
| /external/dropbear/libtommath/pre_gen/ |
| mpi.c | 314 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT);
334 *_W++ += *_W1++ >> ((mp_word) DIGIT_BIT);
460 _W = _W >> ((mp_word)DIGIT_BIT);
561 _W = _W >> ((mp_word)DIGIT_BIT);
681 W1 = _W >> ((mp_word)DIGIT_BIT);
743 if ((res = mp_grow (a, b / DIGIT_BIT + 1)) != MP_OKAY) {
748 a->used = b / DIGIT_BIT + 1;
751 a->dp[b / DIGIT_BIT] = ((mp_digit)1) << (b % DIGIT_BIT);
934 mu = *tmpc >> DIGIT_BIT;
[all...] |
| /external/dropbear/libtommath/mtest/ |
| mpi.c | 77 /* #define CARRYOUT(W) (((W)>>DIGIT_BIT)&MP_DIGIT_MAX) */
78 #define CARRYOUT(W) ((W)>>DIGIT_BIT)
1287 for(bit = 0; bit < DIGIT_BIT; bit++) {
[all...] |
| mpi.h | 52 #define DIGIT_BIT MP_DIGIT_BIT
|
| /external/dropbear/libtomcrypt/testprof/ |
| x86_prof.c | 653 for (x = 128/DIGIT_BIT; x <= 1536/DIGIT_BIT; x += 128/DIGIT_BIT) {
668 fprintf(stderr, "%4lu bits: %9llu cycles\n", x*DIGIT_BIT, t2);
684 for (x = 128/DIGIT_BIT; x <= 1536/DIGIT_BIT; x += 128/DIGIT_BIT) {
698 fprintf(stderr, "%4lu bits: %9llu cycles\n", x*DIGIT_BIT, t2);
[all...] |
| /external/dropbear/libtommath/etc/ |
| pprime.c | 182 if (k <= (int) DIGIT_BIT) {
|
| /external/dropbear/libtomcrypt/src/math/ |
| ltm_desc.c | 398 (int)DIGIT_BIT,
|
| tfm_desc.c | 686 (int)DIGIT_BIT,
|
