Lines Matching refs:DIGIT_BIT
76 #define DIGIT_BIT 60 macro
82 #define DIGIT_BIT 28 macro
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); in s_mp_add()
286 u = *tmpc >> ((mp_digit)DIGIT_BIT); in s_mp_add()
522 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) { in mp_mul()
1060 if (b >= (int)DIGIT_BIT) { in mp_div_2d()
1061 mp_rshd (c, b / DIGIT_BIT); in mp_div_2d()
1065 D = (mp_digit) (b % DIGIT_BIT); in mp_div_2d()
1073 shift = DIGIT_BIT - D; in mp_div_2d()
1364 *tmpb-- = (*tmpa-- >> 1) | (r << (DIGIT_BIT - 1)); in mp_div_2()
1396 if (c->alloc < (int)(c->used + b/DIGIT_BIT + 1)) { in mp_mul_2d()
1397 if ((res = mp_grow (c, c->used + b / DIGIT_BIT + 1)) != MP_OKAY) { in mp_mul_2d()
1403 if (b >= (int)DIGIT_BIT) { in mp_mul_2d()
1404 if ((res = mp_lshd (c, b / DIGIT_BIT)) != MP_OKAY) { in mp_mul_2d()
1410 d = (mp_digit) (b % DIGIT_BIT); in mp_mul_2d()
1419 shift = DIGIT_BIT - d; in mp_mul_2d()
1560 r = (a->used - 1) * DIGIT_BIT; in mp_count_bits()
1584 if (b >= (int) (a->used * DIGIT_BIT)) { in mp_mod_2d()
1595 for (x = (b / DIGIT_BIT) + ((b % DIGIT_BIT) == 0 ? 0 : 1); x < c->used; x++) { in mp_mod_2d()
1599 c->dp[b / DIGIT_BIT] &= in mp_mod_2d()
1600 (mp_digit) ((((mp_digit) 1) << (((mp_digit) b) % DIGIT_BIT)) - ((mp_digit) 1)); in mp_mod_2d()
1740 norm = mp_count_bits(&y) % DIGIT_BIT; in mp_div()
1741 if (norm < (int)(DIGIT_BIT-1)) { in mp_div()
1742 norm = (DIGIT_BIT-1) - norm; in mp_div()
1781 q.dp[i - t - 1] = ((((mp_digit)1) << DIGIT_BIT) - 1); in mp_div()
1784 tmp = ((mp_word) x.dp[i]) << ((mp_word) DIGIT_BIT); in mp_div()
2015 bitcnt = (int) DIGIT_BIT; in s_mp_exptmod()
2019 y = (buf >> (mp_digit)(DIGIT_BIT - 1)) & 1; in s_mp_exptmod()
2132 (1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) { in mp_sqr()
2226 if ((res = mp_grow (a, b / DIGIT_BIT + 1)) != MP_OKAY) { in mp_2expt()
2231 a->used = b / DIGIT_BIT + 1; in mp_2expt()
2234 a->dp[b / DIGIT_BIT] = ((mp_digit)1) << (b % DIGIT_BIT); in mp_2expt()
2247 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) { in mp_reduce_setup()
2272 if (((unsigned long) um) > (((mp_digit)1) << (DIGIT_BIT - 1))) { in mp_reduce()
2298 if ((res = mp_mod_2d (x, DIGIT_BIT * (um + 1), x)) != MP_OKAY) { in mp_reduce()
2353 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) { in s_mp_mul_digs()
2393 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT)); in s_mp_mul_digs()
2472 _W = _W >> ((mp_word)DIGIT_BIT); in fast_s_mp_mul_digs()
2552 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT)); in s_mp_sqr()
2573 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT)); in s_mp_sqr()
2579 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT)); in s_mp_sqr()
2604 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) { in s_mp_mul_high_digs()
2639 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT)); in s_mp_mul_high_digs()
2684 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK; in mp_montgomery_setup()
2784 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT); in fast_mp_montgomery_reduce()
2804 *_W++ += *_W1++ >> ((mp_word) DIGIT_BIT); in fast_mp_montgomery_reduce()
2877 rr = *tmpa >> ((mp_digit)(DIGIT_BIT - 1)); in mp_mul_2()
2921 bits = mp_count_bits (b) % DIGIT_BIT; in mp_montgomery_calc_normalization()
2924 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) { in mp_montgomery_calc_normalization()
2934 for (x = bits - 1; x < (int)DIGIT_BIT; x++) { in mp_montgomery_calc_normalization()
3027 P->used < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) { in mp_exptmod_fast()
3137 bitcnt = (int)DIGIT_BIT; in mp_exptmod_fast()
3141 y = (mp_digit)(buf >> (DIGIT_BIT - 1)) & 1; in mp_exptmod_fast()
3317 W1 = _W >> ((mp_word)DIGIT_BIT); in fast_s_mp_sqr()
3382 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT)); in mp_mul_d()