Lines Matching defs:DIGIT_BIT
68 #define DIGIT_BIT 60
74 #define DIGIT_BIT 28
84 #define MP_MASK ((((mp_digit)1)<<((mp_digit)DIGIT_BIT))-((mp_digit)1))
115 #define MP_WARRAY (1 << (sizeof(mp_word) * CHAR_BIT - 2 * DIGIT_BIT + 1))
263 u = *tmpc >> ((mp_digit)DIGIT_BIT);
278 u = *tmpc >> ((mp_digit)DIGIT_BIT);
514 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
1052 if (b >= (int)DIGIT_BIT) {
1053 mp_rshd (c, b / DIGIT_BIT);
1056 /* shift any bit count < DIGIT_BIT */
1057 D = (mp_digit) (b % DIGIT_BIT);
1065 shift = DIGIT_BIT - D;
1356 *tmpb-- = (*tmpa-- >> 1) | (r << (DIGIT_BIT - 1));
1388 if (c->alloc < (int)(c->used + b/DIGIT_BIT + 1)) {
1389 if ((res = mp_grow (c, c->used + b / DIGIT_BIT + 1)) != MP_OKAY) {
1395 if (b >= (int)DIGIT_BIT) {
1396 if ((res = mp_lshd (c, b / DIGIT_BIT)) != MP_OKAY) {
1401 /* shift any bit count < DIGIT_BIT */
1402 d = (mp_digit) (b % DIGIT_BIT);
1411 shift = DIGIT_BIT - d;
1552 r = (a->used - 1) * DIGIT_BIT;
1576 if (b >= (int) (a->used * DIGIT_BIT)) {
1587 for (x = (b / DIGIT_BIT) + ((b % DIGIT_BIT) == 0 ? 0 : 1); x < c->used; x++) {
1591 c->dp[b / DIGIT_BIT] &=
1592 (mp_digit) ((((mp_digit) 1) << (((mp_digit) b) % DIGIT_BIT)) - ((mp_digit) 1));
1731 /* normalize both x and y, ensure that y >= b/2, [b == 2**DIGIT_BIT] */
1732 norm = mp_count_bits(&y) % DIGIT_BIT;
1733 if (norm < (int)(DIGIT_BIT-1)) {
1734 norm = (DIGIT_BIT-1) - norm;
1773 q.dp[i - t - 1] = ((((mp_digit)1) << DIGIT_BIT) - 1);
1776 tmp = ((mp_word) x.dp[i]) << ((mp_word) DIGIT_BIT);
2007 bitcnt = (int) DIGIT_BIT;
2011 y = (buf >> (mp_digit)(DIGIT_BIT - 1)) & 1;
2124 (1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) {
2218 if ((res = mp_grow (a, b / DIGIT_BIT + 1)) != MP_OKAY) {
2223 a->used = b / DIGIT_BIT + 1;
2226 a->dp[b / DIGIT_BIT] = ((mp_digit)1) << (b % DIGIT_BIT);
2239 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) {
2264 if (((unsigned long) um) > (((mp_digit)1) << (DIGIT_BIT - 1))) {
2290 if ((res = mp_mod_2d (x, DIGIT_BIT * (um + 1), x)) != MP_OKAY) {
2345 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
2385 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
2465 _W = _W >> ((mp_word)DIGIT_BIT);
2545 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
2566 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
2572 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
2597 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
2632 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
2677 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
2777 W[ix + 1] += W[ix] >> ((mp_word) DIGIT_BIT);
2797 *_W++ += *_W1++ >> ((mp_word) DIGIT_BIT);
2870 rr = *tmpa >> ((mp_digit)(DIGIT_BIT - 1));
2914 bits = mp_count_bits (b) % DIGIT_BIT;
2917 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) {
2927 for (x = bits - 1; x < (int)DIGIT_BIT; x++) {
3020 P->used < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
3130 bitcnt = (int)DIGIT_BIT;
3134 y = (mp_digit)(buf >> (DIGIT_BIT - 1)) & 1;
3310 W1 = _W >> ((mp_word)DIGIT_BIT);
3375 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));