Searched refs:DIGIT_BIT (Results 1 - 25 of 45) sorted by relevance

12

/barrelfish-2018-10-04/lib/tommath/
H A Dbn_mp_2expt.c32 if ((res = mp_grow (a, b / DIGIT_BIT + 1)) != MP_OKAY) {
37 a->used = b / DIGIT_BIT + 1;
40 a->dp[b / DIGIT_BIT] = ((mp_digit)1) << (b % DIGIT_BIT);
H A Dbn_mp_get_int.c29 i = MIN(a->used,(int)((sizeof(unsigned long)*CHAR_BIT+DIGIT_BIT-1)/DIGIT_BIT))-1;
35 res = (res << DIGIT_BIT) | DIGIT(a,i);
H A Dbn_mp_mod_2d.c31 if (b >= (int) (a->used * DIGIT_BIT)) {
42 for (x = (b / DIGIT_BIT) + ((b % DIGIT_BIT) == 0 ? 0 : 1); x < c->used; x++) {
46 c->dp[b / DIGIT_BIT] &=
47 (mp_digit) ((((mp_digit) 1) << (((mp_digit) b) % DIGIT_BIT)) - ((mp_digit) 1));
H A Dbn_mp_montgomery_calc_normalization.c29 bits = mp_count_bits (b) % DIGIT_BIT;
32 if ((res = mp_2expt (a, (b->used - 1) * DIGIT_BIT + bits - 1)) != MP_OKAY) {
42 for (x = bits - 1; x < (int)DIGIT_BIT; x++) {
H A Dbn_mp_dr_setup.c21 /* the casts are required if DIGIT_BIT is one less than
22 * the number of bits in a mp_digit [e.g. DIGIT_BIT==31]
24 *d = (mp_digit)((((mp_word)1) << ((mp_word)DIGIT_BIT)) -
H A Dbn_mp_mul_2d.c31 if (c->alloc < (int)(c->used + b/DIGIT_BIT + 1)) {
32 if ((res = mp_grow (c, c->used + b / DIGIT_BIT + 1)) != MP_OKAY) {
38 if (b >= (int)DIGIT_BIT) {
39 if ((res = mp_lshd (c, b / DIGIT_BIT)) != MP_OKAY) {
44 /* shift any bit count < DIGIT_BIT */
45 d = (mp_digit) (b % DIGIT_BIT);
54 shift = DIGIT_BIT - d;
H A Dbn_mp_count_bits.c31 r = (a->used - 1) * DIGIT_BIT;
H A Dbn_mp_div_2d.c54 if (b >= (int)DIGIT_BIT) {
55 mp_rshd (c, b / DIGIT_BIT);
58 /* shift any bit count < DIGIT_BIT */
59 D = (mp_digit) (b % DIGIT_BIT);
67 shift = DIGIT_BIT - D;
H A Dbn_mp_reduce_setup.c25 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) {
H A Dbn_mp_cnt_lsb.c36 x *= DIGIT_BIT;
H A Dbn_mp_reduce_is_2k.c34 for (ix = DIGIT_BIT; ix < iy; ix++) {
H A Dbn_mp_div_3.c27 /* b = 2**DIGIT_BIT / 3 */
28 b = (((mp_word)1) << ((mp_word)DIGIT_BIT)) / ((mp_word)3);
38 w = (w << ((mp_word)DIGIT_BIT)) | ((mp_word)a->dp[ix]);
42 t = (w * ((mp_word)b)) >> ((mp_word)DIGIT_BIT);
H A Dbn_mp_montgomery_reduce.c34 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
79 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
90 u = *tmpx >> DIGIT_BIT;
H A Dbn_s_mp_sqr.c44 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
65 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
71 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
H A Dbn_mp_montgomery_setup.c51 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
H A Dbn_mp_sqr.c41 (1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) {
H A Dbn_mp_add_d.c67 mu = *tmpc >> DIGIT_BIT;
73 mu = *tmpc >> DIGIT_BIT;
H A Dbn_mp_reduce.c36 if (((unsigned long) um) > (((mp_digit)1) << (DIGIT_BIT - 1))) {
61 if ((res = mp_mod_2d (x, DIGIT_BIT * (um + 1), x)) != MP_OKAY) {
H A Dbn_s_mp_add.c71 u = *tmpc >> ((mp_digit)DIGIT_BIT);
86 u = *tmpc >> ((mp_digit)DIGIT_BIT);
H A Dbn_s_mp_mul_digs.c33 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
72 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
H A Dbn_s_mp_mul_high_digs.c33 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
68 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
H A Dbn_mp_div_2.c48 *tmpb-- = (*tmpa-- >> 1) | (r << (DIGIT_BIT - 1));
H A Dbn_mp_mul.c48 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
H A Dbn_mp_mul_2.c49 rr = *tmpa >> ((mp_digit)(DIGIT_BIT - 1));
/barrelfish-2018-10-04/lib/tommath/etc/
H A Ddrprime.c4 int sizes[] = { 1+256/DIGIT_BIT, 1+512/DIGIT_BIT, 1+768/DIGIT_BIT, 1+1024/DIGIT_BIT, 1+2048/DIGIT_BIT, 1+4096/DIGIT_BIT };
18 printf("Seeking a %d-bit safe prime\n", sizes[x] * DIGIT_BIT);

Completed in 43 milliseconds

12