HomeSort by relevance Sort by last modified time
    Searched refs:DIGIT_BIT (Results 1 - 25 of 51) sorted by null

1 2 3

  /external/dropbear/libtommath/
bn_mp_2expt.c 32 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);
bn_mp_get_int.c 29 i = MIN(a->used,(int)((sizeof(unsigned long)*CHAR_BIT+DIGIT_BIT-1)/DIGIT_BIT))-1;
35 res = (res << DIGIT_BIT) | DIGIT(a,i);
bn_mp_mod_2d.c 31 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));
bn_mp_montgomery_calc_normalization.c 29 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++) {
bn_mp_dr_setup.c 21 /* 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)) -
bn_mp_mul_2d.c 31 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;
bn_mp_expt_d.c 31 for (x = 0; x < (int) DIGIT_BIT; x++) {
39 if ((b & (mp_digit) (((mp_digit)1) << (DIGIT_BIT - 1))) != 0) {
bn_mp_count_bits.c 31 r = (a->used - 1) * DIGIT_BIT;
bn_mp_div_2d.c 54 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;
bn_mp_reduce_setup.c 25 if ((res = mp_2expt (a, b->used * 2 * DIGIT_BIT)) != MP_OKAY) {
bn_mp_cnt_lsb.c 36 x *= DIGIT_BIT;
bn_mp_reduce_is_2k.c 34 for (ix = DIGIT_BIT; ix < iy; ix++) {
bn_mp_div_3.c 27 /* 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);
bn_mp_montgomery_reduce.c 34 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
79 u = (mp_digit)(r >> ((mp_word) DIGIT_BIT));
90 u = *tmpx >> DIGIT_BIT;
bn_s_mp_sqr.c 44 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));
bn_mp_montgomery_setup.c 51 *rho = (unsigned long)(((mp_word)1 << ((mp_word) DIGIT_BIT)) - x) & MP_MASK;
bn_mp_sqr.c 41 (1 << (sizeof(mp_word) * CHAR_BIT - 2*DIGIT_BIT - 1))) {
bn_mp_add_d.c 67 mu = *tmpc >> DIGIT_BIT;
73 mu = *tmpc >> DIGIT_BIT;
bn_mp_reduce.c 36 if (((unsigned long) um) > (((mp_digit)1) << (DIGIT_BIT - 1))) {
61 if ((res = mp_mod_2d (x, DIGIT_BIT * (um + 1), x)) != MP_OKAY) {
bn_s_mp_add.c 71 u = *tmpc >> ((mp_digit)DIGIT_BIT);
86 u = *tmpc >> ((mp_digit)DIGIT_BIT);
bn_s_mp_mul_digs.c 33 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
72 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
bn_s_mp_mul_high_digs.c 33 && MIN (a->used, b->used) < (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
68 u = (mp_digit) (r >> ((mp_word) DIGIT_BIT));
bn_mp_div_2.c 48 *tmpb-- = (*tmpa-- >> 1) | (r << (DIGIT_BIT - 1));
bn_mp_mul.c 48 (1 << ((CHAR_BIT * sizeof (mp_word)) - (2 * DIGIT_BIT)))) {
  /external/dropbear/libtommath/etc/
drprime.c 4 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 288 milliseconds

1 2 3