2015-11-12 00:49:07 +00:00
|
|
|
#include <tommath_private.h>
|
2004-10-29 22:07:18 +00:00
|
|
|
#ifdef BN_MP_COUNT_BITS_C
|
2003-02-28 16:08:34 +00:00
|
|
|
/* LibTomMath, multiple-precision integer library -- Tom St Denis
|
|
|
|
*
|
2003-08-05 01:24:44 +00:00
|
|
|
* LibTomMath is a library that provides multiple-precision
|
2003-02-28 16:08:34 +00:00
|
|
|
* integer arithmetic as well as number theoretic functionality.
|
|
|
|
*
|
2003-08-05 01:24:44 +00:00
|
|
|
* The library was designed directly after the MPI library by
|
2003-02-28 16:08:34 +00:00
|
|
|
* Michael Fromberger but has been written from scratch with
|
|
|
|
* additional optimizations in place.
|
|
|
|
*
|
|
|
|
* The library is free for all purposes without any express
|
|
|
|
* guarantee it works.
|
|
|
|
*
|
2015-10-30 21:55:29 +00:00
|
|
|
* Tom St Denis, tstdenis82@gmail.com, http://libtom.org
|
2003-02-28 16:08:34 +00:00
|
|
|
*/
|
|
|
|
|
|
|
|
/* returns the number of bits in an int */
|
2017-09-19 11:35:15 +00:00
|
|
|
int mp_count_bits(const mp_int *a)
|
2003-02-28 16:08:34 +00:00
|
|
|
{
|
2017-08-29 20:23:48 +00:00
|
|
|
int r;
|
|
|
|
mp_digit q;
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
/* shortcut */
|
|
|
|
if (a->used == 0) {
|
|
|
|
return 0;
|
|
|
|
}
|
2003-02-28 16:08:34 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
/* get number of digits and add that */
|
|
|
|
r = (a->used - 1) * DIGIT_BIT;
|
2017-08-30 03:51:11 +00:00
|
|
|
|
2017-08-29 20:23:48 +00:00
|
|
|
/* take the last digit and count the bits in it */
|
|
|
|
q = a->dp[a->used - 1];
|
|
|
|
while (q > ((mp_digit) 0)) {
|
|
|
|
++r;
|
|
|
|
q >>= ((mp_digit) 1);
|
|
|
|
}
|
|
|
|
return r;
|
2003-02-28 16:08:34 +00:00
|
|
|
}
|
2004-10-29 22:07:18 +00:00
|
|
|
#endif
|
2005-08-01 16:37:28 +00:00
|
|
|
|
2017-08-28 14:27:26 +00:00
|
|
|
/* ref: $Format:%D$ */
|
|
|
|
/* git commit: $Format:%H$ */
|
|
|
|
/* commit time: $Format:%ai$ */
|