Lines Matching defs:DIGIT_BIT
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 */
1065 D = (mp_digit) (b % DIGIT_BIT);
1073 shift = DIGIT_BIT - D;
1364 *tmpb-- = (*tmpa-- >> 1) | (r << (DIGIT_BIT - 1));
1396 if (c->alloc < (int)(c->used + b/DIGIT_BIT + 1)) {
1397 if ((res = mp_grow (c, c->used + b / DIGIT_BIT + 1)) != MP_OKAY) {
1403 if (b >= (int)DIGIT_BIT) {
1404 if ((res = mp_lshd (c, b / DIGIT_BIT)) != MP_OKAY) {
1409 /* shift any bit count < DIGIT_BIT */
1410 d = (mp_digit) (b % DIGIT_BIT);
1419 shift = DIGIT_BIT - d;
1560 r = (a->used - 1) * DIGIT_BIT;
1584 if (b >= (int) (a->used * DIGIT_BIT)) {
1595 for (x = (b / DIGIT_BIT) + ((b % DIGIT_BIT) == 0 ? 0 : 1); x < c->used; x++) {
1599 c->dp[b / DIGIT_BIT] &=
1600 (mp_digit) ((((mp_digit) 1) << (((mp_digit) b) % DIGIT_BIT)) - ((mp_digit) 1));
1739 /* normalize both x and y, ensure that y >= b/2, [b == 2**DIGIT_BIT] */
1740 norm = mp_count_bits(&y) % DIGIT_BIT;
1741 if (norm < (int)(DIGIT_BIT-1)) {
1742 norm = (DIGIT_BIT-1) - norm;
1781 q.dp[i - t - 1] = ((((mp_digit)1) << DIGIT_BIT) - 1);
1784 tmp = ((mp_word) x.dp[i]) << ((mp_word) DIGIT_BIT);
2015 bitcnt = (int) DIGIT_BIT;
2019 y = (buf >> (mp_digit)(DIGIT_BIT - 1)) & 1;
2132 (1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) {
2226 if ((res = mp_grow (a, b / DIGIT_BIT + 1)) != MP_OKAY) {
2231 a->used = b / DIGIT_BIT + 1;
2234 a->dp[b / DIGIT_BIT] = ((mp_digit)1) << (b % DIGIT_BIT);
2247 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) {
2272 if (((unsigned long) um) > (((mp_digit)1) << (DIGIT_BIT - 1))) {
2298 if ((res = mp_mod_2d (x, DIGIT_BIT * (um + 1), x)) != MP_OKAY) {
2353 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
2393 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
2473 _W = _W >> ((mp_word)DIGIT_BIT);
2553 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
2574 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
2580 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
2605 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
2640 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
2685 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
2785 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT);
2805 *_W++ += *_W1++ >> ((mp_word) DIGIT_BIT);
2878 rr = *tmpa >> ((mp_digit)(DIGIT_BIT - 1));
2922 bits = mp_count_bits (b) % DIGIT_BIT;
2925 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) {
2935 for (x = bits - 1; x < (int)DIGIT_BIT; x++) {
3028 P->used < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
3138 bitcnt = (int)DIGIT_BIT;
3142 y = (mp_digit)(buf >> (DIGIT_BIT - 1)) & 1;
3318 W1 = _W >> ((mp_word)DIGIT_BIT);
3383 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));