Searched refs:mp_count_bits (Results 1 - 20 of 20) sorted by relevance
/barrelfish-2018-10-04/lib/tommath/ |
H A D | bn_mp_unsigned_bin_size.c | 21 int size = mp_count_bits (a);
|
H A D | bn_mp_count_bits.c | 20 mp_count_bits (mp_int * a) function
|
H A D | bn_mp_reduce_2k_setup_l.c | 28 if ((res = mp_2expt(&tmp, mp_count_bits(a))) != MP_OKAY) {
|
H A D | bn_mp_reduce_is_2k.c | 29 iy = mp_count_bits(a);
|
H A D | bn_mp_montgomery_calc_normalization.c | 29 bits = mp_count_bits (b) % DIGIT_BIT;
|
H A D | bn_mp_reduce_2k_setup.c | 28 p = mp_count_bits(a);
|
H A D | bn_mp_radix_size.c | 29 *size = mp_count_bits (a) + (a->sign == MP_NEG ? 1 : 0) + 1;
|
H A D | bn_mp_reduce_2k.c | 28 p = mp_count_bits(n);
|
H A D | bn_mp_reduce_2k_l.c | 31 p = mp_count_bits(n);
|
H A D | bn_mp_div.c | 51 n = mp_count_bits(a) - mp_count_bits(b); 152 norm = mp_count_bits(&y) % DIGIT_BIT;
|
H A D | bn_s_mp_exptmod.c | 31 x = mp_count_bits (X);
|
H A D | bn_mp_exptmod_fast.c | 45 x = mp_count_bits (X);
|
H A D | tommath.h | 519 int mp_count_bits(mp_int *a);
|
/barrelfish-2018-10-04/lib/tommath/demo/ |
H A D | timing.c | 123 mp_count_bits(&a), CLK_PER_SEC / tt, tt); 145 mp_count_bits(&a), CLK_PER_SEC / tt, tt); 176 mp_count_bits(&a), CLK_PER_SEC / tt, tt); 177 fprintf(log, "%d %9llu\n", mp_count_bits(&a), tt); 196 mp_count_bits(&a), CLK_PER_SEC / tt, tt); 197 fprintf(log, "%d %9llu\n", mp_count_bits(&a), tt); 246 for (rr = 0; rr < (unsigned) mp_count_bits(&a); rr++) { 268 printf("Different (%d)!!!\n", mp_count_bits(&a)); 273 mp_count_bits(&a), CLK_PER_SEC / tt, tt); 275 "%d %9llu\n", mp_count_bits( [all...] |
H A D | demo.c | 188 if (mp_count_bits(&a) != ix) { 189 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix); 205 if (mp_count_bits(&a) != ix) { 206 printf("Prime is %d not %d bits!!!\n", mp_count_bits(&a), ix);
|
/barrelfish-2018-10-04/lib/tommath/etc/ |
H A D | drprime.c | 50 fprintf(out, "%d-bit prime:\np == %s\n\n", mp_count_bits(&a), buf); fflush(out);
|
H A D | pprime.c | 231 while (mp_count_bits (&a) < k) { 232 fprintf (stderr, "prime has %4d bits left\r", k - mp_count_bits (&a)); 388 printf ("\n\nTook %ld ticks, %d bits\n", t1, mp_count_bits (&p));
|
/barrelfish-2018-10-04/lib/tommath/mtest/ |
H A D | mpi.h | 199 int mp_count_bits(mp_int *mp);
|
H A D | mpi.c | 2425 /* {{{ mp_count_bits(mp) */ 2427 int mp_count_bits(mp_int *mp) function 2444 } /* end mp_count_bits() */ 2512 len = s_mp_outlen(mp_count_bits(mp), radix) + 1; /* for NUL terminator */
|
/barrelfish-2018-10-04/lib/tommath/pre_gen/ |
H A D | mpi.c | 1526 mp_count_bits (mp_int * a) function 1606 n = mp_count_bits(a) - mp_count_bits(b); 1707 norm = mp_count_bits(&y) % DIGIT_BIT; 2667 x = mp_count_bits (X); 4701 bits = mp_count_bits (b) % DIGIT_BIT; 6228 *size = mp_count_bits (a) + (a->sign == MP_NEG ? 1 : 0) + 1; 6693 p = mp_count_bits(n); 6761 p = mp_count_bits(n); 6824 p = mp_count_bits( [all...] |
Completed in 100 milliseconds